Article ID: | iaor20107557 |
Volume: | 71 |
Issue: | 10 |
Start Page Number: | 2109 |
End Page Number: | 2121 |
Publication Date: | Oct 2010 |
Journal: | Automation and Remote Control |
Authors: | Werner F, Kravchenko A |
In this paper, we consider the problem of scheduling a set of jobs on a set of identical parallel machines. Before the processing of a job can start, a setup is required which has to be performed by a given set of servers. We consider the complexity of such problems for the minimization of the makespan. For the problem with equal processing times and equal setup times we give a polynomial algorithm. For the problem with unit setup times,