Article ID: | iaor200954125 |
Country: | United States |
Volume: | 32 |
Issue: | 3 |
Start Page Number: | 579 |
End Page Number: | 588 |
Publication Date: | Aug 2007 |
Journal: | Mathematics of Operations Research |
Authors: | Kanet J J |
In an earlier paper by Emmons (1969), the problem of sequencing jobs on a single machine in order to minimize total tardiness was analyzed. Emmons provided three theorems for specifying precedence relations for pairs of jobs. His theorems apply when the tardiness penalty for each job grows at the same rate. Rinnooy Kan