cheduling uniform machines with restricted assignment
The problem of minimizing makespan (maximum completion time) on uniform machines with restricted assignment is considered. The machines differ in their speeds and functionalities. Each job has a set of machines to which it can be assigned, called its processing set. The goal is to finish the jobs as...
Main Authors: | Shuguang Li, Zhimeng Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2022-07-01
|
Series: | Mathematical Biosciences and Engineering |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2022450?viewType=HTML |
Similar Items
-
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS
by: Xiaojuan Liao, et al.
Published: (2023-08-01) -
Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
by: Xin Xiao, et al.
Published: (2023-02-01) -
A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
by: Xiaofang Zhao, et al.
Published: (2022-09-01) -
Effects of Energy-Restricted Feeding during Rearing on the Performance, Uniformity, and Development of Rugao Layer Breeders at the Initiation of the Laying Period
by: Jian Lu, et al.
Published: (2021-07-01) -
A SCHEDULING HEURISTIC FOR A CONVEYOR BELTING TWO-STAGE UNIFORM MACHINES HYBRID FLOW SHOP
by: Domingo Pavolo, et al.
Published: (2024-03-01)