Short Communication On the single machine total tardiness problem
2004
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. 2004 Published by Elsevier B.V.
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
10
References
0
Citations
NaN
KQI