Article ID: | iaor19962051 |
Country: | Netherlands |
Volume: | 43 |
Issue: | 1 |
Start Page Number: | 29 |
End Page Number: | 35 |
Publication Date: | May 1996 |
Journal: | International Journal of Production Economics |
Authors: | Cheng T.C.E., Oguz C., Qi X.D. |
In this paper the authors consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the due-dates, while in the second model the due-dates are assigned using the slack due-date assignment method. The objective is to determine the optimal sequence, the optimal due-dates and the optimal processing time compressions to minimize a total penalty function based on earliness, tardiness, due-dates and compression. The authors solve the problem by formulating it as an assignment problem which is polynomially solvable. For the case that all the jobs have a common upper bound for compressions and an equal unit compression penalty, they present an O(