Bilevel programming applied to the flow shop scheduling problem
Computers and Operations Research
Scheduling parallel manufacturing cells with resource flexibility
Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Unrelated parallel machine scheduling with resource dependent processing times
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A multiobjective optimization approach to solve a parallel machines scheduling problem
Advances in Artificial Intelligence
Minimizing resource consumption on uniform parallel machines with a bound on makespan
Computers and Operations Research
| Hi-index | 0.01 |
This article addresses the problem of scheduling n non-preemptive jobs on m identical parallel machines with @w operators to minimize the makespan. The number of operators is less than the number of machines. As a result, it may happen that an operator has to supervise simultaneously several machines. This in turn has an impact on the job processing times as they become a function of the operators modus operandi. In this paper we consider the case where each modus operandi can only be changed at the end of a given period, i.e., a period based changing mode. We present heuristic algorithms to solve this problem. An experimental study is conducted to evaluate the performance of these heuristics in the average case, and a worst case analysis is presented for one of them.