Author:
Gafarov E. R.,Lazarev A. A.
Subject
Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software
Reference9 articles.
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).
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献