| Article ID: | iaor19971350 |
| Country: | Singapore |
| Volume: | 12 |
| Issue: | 1 |
| Start Page Number: | 55 |
| End Page Number: | 63 |
| Publication Date: | May 1995 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Foulds L.R., Tang Guochun |
The authors present an algorithm for a single machine scheduling problem, in which they assume that jobs cannot be interrupted and started again later, but where it is possible to reduce the processing time of each job, at a cost. The objective is to find a job sequence, and which job processing times are to be compressed, in order to minimize the sum of the total cost of all late jobs and the total cost of all crashed jobs.