| Article ID: | iaor19981673 |
| Country: | Canada |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 286 |
| End Page Number: | 296 |
| Publication Date: | Nov 1997 |
| Journal: | INFOR |
| Authors: | Tanaka Keisuke, Vlach Milan |
| Keywords: | networks: scheduling, manufacturing industries |
The problem of scheduling non-preemptively a finite number of jobs on a single machine so as to minimize the difference between the maximum and minimum lateness is considered under the assumption that due dates are job independent. NP-completeness in the strong sense is established for several variants of the problem, and simple O(