A special case of the single-machine total tardiness problem is NP-hard

Journal of Computer and Systems Sciences International

Volumn 45, Issue 3, 2006, Pages 450-458

  Gafarov, E R ^a   Lazarev, A A ^a  

^a RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; SCHEDULING;

PSEUDO-POLYNOMIAL ALGORITHM; SINGLE-MACHINE TOTAL TARDINESS PROBLEM; TARDINESS;

PROBLEM SOLVING;

EID: 33746885139     PISSN: 10642307     EISSN: None     Source Type: Journal    
DOI: 10.1134/S1064230706030117     Document Type: Article

References (9)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: The Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
2. J. Du and J. Y. Leung, "T. Minimizing Total Tardiness on One Processor is NP-Hard," Math. Oper. Res, No. 15 (1990).
3. E. L. Lawler, "A Pseudopolynomial Algorithm for Sequencing Jobs To Minimize Total Tardiness," Ann. Discrete Math, No. 1 (1977).
4. W. Szwarc, F. Della Croce, and A. Grosso, "Solution of the Single Machine Total Tardiness Problem," J. Scheduling, No. 2 (1999).
5. W. Szwarc, A. Grosso, and F. Della Croce, "Algorithmic Paradoxes of the Single-Machine Total Tardiness Problem," J. Scheduling, No. 4 (2001).
6. C. N. Potts and L. N. Van Wassenhove, "A Decomposition Algorithm for the Single-Machine Total Tardiness Problem," Oper. Res. Lett, No. 1 (1982).
7. Croce F. Della, A. Grosso, and V. Paschos, "Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem," J. of Scheduling, No. 7 (2004).
8. A. Lazarev, A. Kvaratskhelia, and A. Tchernykh, "Solution Algorithms for the Total Tardiness Scheduling Problem on a Single Machine, " in Workshop Proceedings of the ENC'04 International Conference, Colima, Mexico, 2004, pp. 474-480.
9. S. Chang, Q. Lu, G. Tang, and W. Yu, "On Decomposition of Total Tardiness Problem," Oper. Res. Lett, 17, 221-229 (1995).