Article ID: | iaor201526802 |
Volume: | 66 |
Issue: | 9 |
Start Page Number: | 1426 |
End Page Number: | 1429 |
Publication Date: | Sep 2015 |
Journal: | Journal of the Operational Research Society |
Authors: | Mosheiov Gur, Mor Baruch |
Keywords: | combinatorial optimization, scheduling |
A proportionate flowshop is a special case of the classical flowshop, where the job processing times are machine‐independent. We study the problem of minimizing the number of early jobs in this machine setting. This objective function has hardly been investigated on a single machine, and never on a flowshop. We introduce an efficient iterative solution algorithm. In each iteration, a single job is moved to the first position (and is added to the set of early jobs), and the remaining jobs are rescheduled such that the maximum earliness is minimized. The algorithm guarantees an optimal solution in O(n3) time, where n is the number of jobs.