| Article ID: | iaor199783 |
| Country: | Netherlands |
| Volume: | 70 |
| Issue: | 3 |
| Start Page Number: | 311 |
| End Page Number: | 315 |
| Publication Date: | Nov 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Gordon V.S. |
This paper extends T.C.E. Cheng’s approach for optimal assignment of slack due-dates and sequencing in the single-machine shop to the case when preemption is allowed and there are precedence constraints and ready times of jobs. It is shown that under special conditions the presented algorithm may be used when preemption is not allowed.