Article ID: | iaor20022267 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 3 |
Start Page Number: | 295 |
End Page Number: | 315 |
Publication Date: | Mar 2002 |
Journal: | Computers and Operations Research |
Authors: | Wirth Andrew, Abdekhodaee Amir H. |
Keywords: | heuristics |
This paper considers the problem of scheduling two identical parallel machines with a single server which is required to carry out the job setups. Job processing can then be carried out in parallel. The objective is to minimise maximum completion time, that is makespan. The problem is NP-complete in the strong sense. An integer program formulation is presented. Two special cases, short processing times and equal length jobs, are solved. Two simple but effective