메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 72, Issue 1-2, 1997, Pages 47-69
Improving local search heuristics for some scheduling problems. Part II
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0001114898     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00036-4     Document Type: Article
Times cited : (46)
References (13)
  • 1
    • 40849105768 scopus 로고
    • The complexity of one-machine batching problems
    • S. Albers and P. Brucker, The complexity of one-machine batching problems, Discrete Appl. Math. 47 (1993) 87-107.
    • (1993) Discrete Appl. Math. , vol.47 , pp. 87-107
    • Albers, S.1    Brucker, P.2
  • 2
    • 0042130289 scopus 로고    scopus 로고
    • Improving local search heuristics for some scheduling problems
    • P. Brucker, J. Hurink and F. Werner, Improving local search heuristics for some scheduling problems, Discrete Appl. Math. 65 (1996) 97-122.
    • (1996) Discrete Appl. Math. , vol.65 , pp. 97-122
    • Brucker, P.1    Hurink, J.2    Werner, F.3
  • 4
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. of Discrete Math. 5 (1979) 287-326.
    • (1979) Ann. of Discrete Math. , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 5
    • 0003075019 scopus 로고
    • Optimal two-and three-stage production schedules with setup times included
    • S.M. Johnson, Optimal two-and three-stage production schedules with setup times included, Naval Res. Logistic Quart. 1 (1954) 61-68.
    • (1954) Naval Res. Logistic Quart. , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 8
    • 77951587888 scopus 로고
    • Sequencing jobs to minimize total weighted completion time subject to precedence constraints
    • E. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math. 2 (1978) 75-90.
    • (1978) Ann. Discrete Math. , vol.2 , pp. 75-90
    • Lawler, E.1
  • 9
    • 0017924416 scopus 로고
    • Complexity of scheduling under precedence constraints
    • J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Oper. Res. 26 (1978) 22-35.
    • (1978) Oper. Res. , vol.26 , pp. 22-35
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 10
    • 0001463650 scopus 로고
    • Large-step Markov chains for the TSP incorporating local search heuristics
    • O. Martin, S.W. Otto and E.W. Felten, Large-step Markov chains for the TSP incorporating local search heuristics, Oper. Res. Lett. 11 (1992) 219-224.
    • (1992) Oper. Res. Lett. , vol.11 , pp. 219-224
    • Martin, O.1    Otto, S.W.2    Felten, E.W.3
  • 11
    • 0019035345 scopus 로고
    • Sequencing to minimize the maximum job cost
    • C.L. Monma, Sequencing to minimize the maximum job cost, Oper. Res. 28 (1980) 942-951.
    • (1980) Oper. Res. , vol.28 , pp. 942-951
    • Monma, C.L.1
  • 12
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • W.E. Smith, 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

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