메뉴 건너뛰기
Theoretical Computer Science
Volumn 369, Issue 1-3, 2006, Pages 230-238
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Author keywords

[No Author keywords available]
Indexed keywords

EID: 33751069221     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.030     Document Type: Article
Times cited : (31)
References (15)
  • 1
    • 0000315146 scopus 로고
    • A survey of algorithms for the single machine total weighted tardiness scheduling problem
    • Abdul-Razaq T.S., Potts C.N., and Van Wassenhove L.N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Appl. Math. 26 (1990) 235-253
    • (1990) Discrete Appl. Math. , vol.26 , pp. 235-253
    • Abdul-Razaq, T.S.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 2
    • 13444309301 scopus 로고    scopus 로고
    • Single machine scheduling to minimize total weighted tardiness
    • Cheng T.C.E., Ng C.T., Yuan J.J., and Liu Z.H. Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165 (2005) 423-443
    • (2005) Eur. J. Oper. Res. , vol.165 , pp. 423-443
    • Cheng, T.C.E.1    Ng, C.T.2    Yuan, J.J.3    Liu, Z.H.4
  • 3
    • 0013238227 scopus 로고    scopus 로고
    • An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
    • Congram R.K., Potts C.N., and van de Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 14 (2002) 52-67
    • (2002) INFORMS J. Comput. , vol.14 , pp. 52-67
    • Congram, R.K.1    Potts, C.N.2    van de Velde, S.L.3
  • 4
    • 3543055799 scopus 로고    scopus 로고
    • Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
    • Della Croce F., Grosso A., and Paschos V.T. Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. J. Scheduling 7 (2004) 85-91
    • (2004) J. Scheduling , vol.7 , pp. 85-91
    • Della Croce, F.1    Grosso, A.2    Paschos, V.T.3
  • 5
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15 (1990) 483-495
    • (1990) Math. Oper. Res. , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.-T.2
  • 6
    • 0025494671 scopus 로고
    • Heuristics for the common due date weighted tardiness problem
    • Fathi Y., and Nuttle H.W.L. Heuristics for the common due date weighted tardiness problem. IIE Trans. 22 (1990) 215-225
    • (1990) IIE Trans. , vol.22 , pp. 215-225
    • Fathi, Y.1    Nuttle, H.W.L.2
  • 7
    • 33644880309 scopus 로고    scopus 로고
    • Approximation algorithms for minimizing the total weighted tardiness on a single machine
    • Kolliopoulos S.V., and Steiner G. Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theoret. Comput. Sci. 355 (2006) 261-273
    • (2006) Theoret. Comput. Sci. , vol.355 , pp. 261-273
    • Kolliopoulos, S.V.1    Steiner, G.2
  • 8
    • 77957077792 scopus 로고
    • A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness
    • Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 (1977) 331-342
    • (1977) Ann. Discrete Math. , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 9
    • 0020296482 scopus 로고
    • A fully polynomial approximation scheme for the total tardiness problem
    • Lawler E.L. A fully polynomial approximation scheme for the total tardiness problem. Oper. Res. Lett. 1 (1982) 207-208
    • (1982) Oper. Res. Lett. , vol.1 , pp. 207-208
    • Lawler, E.L.1
  • 10
    • 0014571702 scopus 로고
    • A functional equation and its application to resource allocation and sequencing problems
    • Lawler E.L., and Moore J.M. A functional equation and its application to resource allocation and sequencing problems. Management Sci. 16 (1969) 77-84
    • (1969) Management Sci. , vol.16 , pp. 77-84
    • Lawler, E.L.1    Moore, J.M.2
  • 12
    • 0022023671 scopus 로고
    • A branch and bound algorithm for the total weighted tardiness problem
    • Potts C.N., and Van Wassenhove L.N. A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33 (1985) 363-377
    • (1985) Oper. Res. , vol.33 , pp. 363-377
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 13
    • 0037464639 scopus 로고    scopus 로고
    • Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey
    • Sen T., Sulek J.M., and Dileepan P. Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. Int. J. Production Econom. 83 (2003) 1-12
    • (2003) Int. J. Production Econom. , vol.83 , pp. 1-12
    • Sen, T.1    Sulek, J.M.2    Dileepan, P.3
  • 14
    • 0002066821 scopus 로고
    • Various optimizers for single stage production
    • Smith W.E. Various optimizers for single stage production. Naval Res. Logist. Quart. 3 (1956) 59-66
    • (1956) Naval Res. Logist. Quart. , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 15
    • 0042764200 scopus 로고
    • The NP-hardness of the single machine common due date weighted tardiness problem
    • Yuan J. The NP-hardness of the single machine common due date weighted tardiness problem. Systems Sci. Math. Sci. 5 (1992) 328-333
    • (1992) Systems Sci. Math. Sci. , vol.5 , pp. 328-333
    • Yuan, J.1

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