| Article ID: | iaor19911984 |
| Country: | Netherlands |
| Volume: | 10 |
| Issue: | 3 |
| Start Page Number: | 153 |
| End Page Number: | 158 |
| Publication Date: | Apr 1991 |
| Journal: | Operations Research Letters |
| Authors: | Leung Joseph Y.-T., Du Jinzhong |
The authors consider the problem of preemptively scheduling a set of independent jobs with release times on an arbitrary number of unrelated machines so as to minimize the number of late jobs. They show that the problem is NP-hard in the strong sense, giving the first strong NP-hardness result for this problem.