Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your 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
  • Download ($30.00)
  • Cite this Item
Minimizing Total Tardiness on One Machine Is NP-Hard
Preview not available

Abstract

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).

Page Thumbnails

  • Thumbnail: Page 
483
    483
  • Thumbnail: Page 
484
    484
  • Thumbnail: Page 
485
    485
  • Thumbnail: Page 
486
    486
  • Thumbnail: Page 
487
    487
  • Thumbnail: Page 
488
    488
  • Thumbnail: Page 
489
    489
  • Thumbnail: Page 
490
    490
  • Thumbnail: Page 
491
    491
  • Thumbnail: Page 
492
    492
  • Thumbnail: Page 
493
    493
  • Thumbnail: Page 
494
    494
  • Thumbnail: Page 
495
    495