Article ID: | iaor201525812 |
Volume: | 66 |
Issue: | 5 |
Start Page Number: | 732 |
End Page Number: | 736 |
Publication Date: | May 2015 |
Journal: | Journal of the Operational Research Society |
Authors: | Oron Daniel |
Keywords: | combinatorial optimization |
In this paper, we consider a single machine no‐wait scheduling model whereby job processing times are general functions of their position in the job sequence. We assume that the single machine must operate at a certain cycle, which can be determined by the scheduler. Furthermore, exactly one job has to be completed by the end of each cycle. Using different variations of the Linear Assignment Problem formulation, we develop polynomial time algorithms for minimizing the following objectives: makespan, total completion time, maximum earliness and total earliness.