메뉴 건너뛰기
Computational Mathematics and Mathematical Physics
Volumn 47, Issue 6, 2007, Pages 1039-1049
Solution of the NP-hard total tardiness minimization problem in scheduling theory
Author keywords

Minimization of total tardiness; One machine; Pseudopolynomial algorithms; Scheduling theory
Indexed keywords

EID: 34547255341     PISSN: 09655425     EISSN: 15556662     Source Type: Journal    
DOI: 10.1134/S0965542507060139     Document Type: Article
Times cited : (5)
References (12)
  • 1
    • 0000474126 scopus 로고
    • Minimizing Total Tardiness on One Processor Is NP-Hard
    • J. Du and J. Y.-T. Leung, "Minimizing Total Tardiness on One Processor Is NP-Hard," Math. Operat. Res., No. 15, 483-495 (1990).
    • (1990) Math. Operat. Res , Issue.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.-T.2
  • 2
    • 77957077792 scopus 로고
    • A Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness
    • E. L. Lawler, "A Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness," Ann. Discrete Math., No. 1, 331-342 (1977).
    • (1977) Ann. Discrete Math , Issue.1 , pp. 331-342
    • Lawler, E.L.1
  • 3
    • 0001957734 scopus 로고    scopus 로고
    • Solution of the Single Machine Total Tardiness Problem
    • W. Szwarc, F. Della Croce, and A. Grosso, "Solution of the Single Machine Total Tardiness Problem," J. Scheduling 2, 55-71 (1999).
    • (1999) J. Scheduling , vol.2 , pp. 55-71
    • Szwarc, W.1    Della Croce, F.2    Grosso, A.3
  • 4
    • 0001957735 scopus 로고    scopus 로고
    • Algorithmic Paradoxes of the Single Machine Total Tardiness Problem
    • W. Szwarc, A. Grosso, and F. Della Croce, "Algorithmic Paradoxes of the Single Machine Total Tardiness Problem," J. Scheduling 4, 93-104 (2001).
    • (2001) J. Scheduling , vol.4 , pp. 93-104
    • Szwarc, W.1    Grosso, A.2    Della Croce, F.3
  • 5
    • 0020205577 scopus 로고
    • A Decomposition Algorithm for the Single Machine Total Tardiness Problem
    • C. N. Potts and L. N. van Wassenhove, "A Decomposition Algorithm for the Single Machine Total Tardiness Problem," Operat. Res. Lett., No. 1, 177-182 (1982).
    • (1982) Operat. Res. Lett , Issue.1 , pp. 177-182
    • Potts, C.N.1    van Wassenhove, L.N.2
  • 6
    • 3543055799 scopus 로고    scopus 로고
    • Lower Bounds on the Approximation Ratios of Leading Heuristics for Single-Machine Total Tardiness Problem
    • CroceF. Della, A. Grosso, and V. Psachos, "Lower Bounds on the Approximation Ratios of Leading Heuristics for Single-Machine Total Tardiness Problem," J. Scheduling 7, 85-91 (2004).
    • (2004) J. Scheduling , vol.7 , pp. 85-91
    • CroceF1    Della2    Grosso, A.3    Psachos, V.4
  • 7
    • 34547268806 scopus 로고    scopus 로고
    • j, Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 3, 120-128 (2006).
    • j," Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 3, 120-128 (2006).
  • 8
    • 34547368043 scopus 로고    scopus 로고
    • Analysis of the NP-Hard Single Machine Total Tardiness Problem in Scheduling Theory
    • Kazan, in Russian
    • A. A. Lazarev and A. G. Kvaratskheliya, "Analysis of the NP-Hard Single Machine Total Tardiness Problem in Scheduling Theory," in Research in Applied Mathematics (Kazan, 2003), Vol. 24, pp. 90-106 [in Russian].
    • (2003) Research in Applied Mathematics , vol.24 , pp. 90-106
    • Lazarev, A.A.1    Kvaratskheliya, A.G.2
  • 9
    • 34547321010 scopus 로고    scopus 로고
    • Algorithms for Solving the NP-Hard Problem of Minimizing Total Tardiness for One Machine
    • A. A. Lazarev, A. G. Kvaratskheliya, and E. R. Gafarov, "Algorithms for Solving the NP-Hard Problem of Minimizing Total Tardiness for One Machine," Dokl. Akad. Nauk 412, 739-742 (2007)
    • (2007) Dokl. Akad. Nauk , vol.412 , pp. 739-742
    • Lazarev, A.A.1    Kvaratskheliya, A.G.2    Gafarov, E.R.3
  • 10
    • 34547274027 scopus 로고    scopus 로고
    • Dokl
    • [Dokl. Math. 75 (2007)].
    • (2007) , vol.75
    • Math1
  • 11
    • 0014535952 scopus 로고
    • One Machine Sequencing to Minimizing Certain Function of Job Tardiness
    • H. Emmons, "One Machine Sequencing to Minimizing Certain Function of Job Tardiness," Operat. Res, 17, 701-715 (1969).
    • (1969) Operat. Res , vol.17 , pp. 701-715
    • Emmons, H.1
  • 12
    • 0029313617 scopus 로고
    • On Decomposition of the Total Tardiness Problem
    • S. Chang, Q. Lu, G. Tang, and W. Yu, "On Decomposition of the Total Tardiness Problem," Operat. Res. Lett., 17, 221-229 (1995).
    • (1995) Operat. Res. Lett , vol.17 , pp. 221-229
    • Chang, S.1    Lu, Q.2    Tang, G.3    Yu, W.4

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.