Article ID: | iaor20141081 |
Volume: | 41 |
Issue: | 6 |
Start Page Number: | 94 |
End Page Number: | 97 |
Publication Date: | Jan 2014 |
Journal: | Computers and Operations Research |
Authors: | Werner Frank, Hasani Keramat, Kravchenko Svetlana A |
Keywords: | combinatorial optimization, production, programming: linear |
We consider the problem of scheduling a set of non‐preemptable jobs on two identical parallel machines such that the makespan is minimized. Before processing, each job must be loaded on a machine, which takes a given setup time. All these setups have to be done by a single server which can handle at most one job at a time. For this problem, we propose a mixed integer linear programming formulation based on the idea of decomposing a schedule into a set of blocks. We compare the results obtained by the model suggested with known heuristics from the literature.