Article ID: | iaor20162183 |
Volume: | 67 |
Issue: | 6 |
Start Page Number: | 872 |
End Page Number: | 883 |
Publication Date: | Jun 2016 |
Journal: | Journal of the Operational Research Society |
Authors: | Wan Guohua, Yue Qing |
Keywords: | scheduling, combinatorial optimization |
We consider single machine scheduling problems with deteriorating jobs and SLK/DIF due window assignment, where the deteriorating rates of jobs are assumed to be job‐dependent. We consider two different objectives under SLK and DIF due window assignment, respectively. The first objective is to minimise total costs of earliness, tardiness, due window location and due window size, while the second objective is to minimise a cost function that includes number of early jobs, number of tardy jobs and the costs for due window location and due window size. We study the optimality properties for all problems and develop algorithms for solving these problems in polynomial time.