| Article ID: | iaor20081239 |
| Country: | United Kingdom |
| Volume: | 9 |
| Issue: | 4 |
| Start Page Number: | 343 |
| End Page Number: | 364 |
| Publication Date: | Aug 2006 |
| Journal: | Journal of Scheduling |
| Authors: | Cheng T.C.E., Ng C.T., Tian Zhongjun |
In this paper, we study the problem of scheduling n equal-length preemptive jobs on a single machine to minimize total tardiness, subject to release dates. The complexity status of this problem has remained open to date. We provide an