Article ID: | iaor19952073 |
Country: | South Korea |
Volume: | 20 |
Issue: | 1 |
Start Page Number: | 115 |
End Page Number: | 130 |
Publication Date: | Apr 1995 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Sung Chang Sup, Joo Un Gi |
This paper considers a single machine nonpreemptive scheduling problem with a given common due date. In the problem, the optimal job sequence is sought to minimize the sum of earliness/tardiness and flow time measures in the situation where all jobs are available at time zero, and weights per unit length of earliness/tardiness and flow time are