You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
Minimizing Total Tardiness on One Machine Is NP-Hard
Jianzhong Du and Joseph Y.-T. Leung
Mathematics of Operations Research
Vol. 15, No. 3 (Aug., 1990), pp. 483-495
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3689992
Page Count: 13
Preview not available
The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered. Lawler has given a pseudo-polynomial-time algorithm to solve this problem. In spite of extensive research efforts for more than a decade, the question of whether it can be solved in polynomial time or it is NP-hard (in the ordinary sense) remained open. In this paper the problem is shown to be NP-hard (in the ordinary sense).
Mathematics of Operations Research © 1990 INFORMS