| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9663739 | European Journal of Operational Research | 2005 | 4 Pages |
Abstract
In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Z.J. Tian, C.T. Ng, T.C.E. Cheng,