메뉴 건너뛰기
Journal of the Operational Research Society
Volumn 49, Issue 1, 1998, Pages 77-85
Minimising makespan in the two-machine flow-shop with release times
Author keywords

Branch and bound; Flow shop scheduling; Release times
Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING;
EID: 0032221633     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600481     Document Type: Article
Times cited : (26)
References (11)
  • 1
    • 0003075019 scopus 로고
    • Theory of Scheduling. Addison Wesley: Reading, Massachusetts.Johnson SM (1954). Optimal two- and three-stage production schedules with setup times included
    • Conway RW, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison Wesley: Reading, Massachusetts.Johnson SM (1954). Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1: 61-68.
    • (1967) Naval Res Logist Q , vol.1 , pp. 61-68
    • Conway, R.W.1    Maxwell, W.L.2    Miller, L.W.3
  • 2
    • 0345901561 scopus 로고
    • Sequencing and scheduling: Algorithms and complexity
    • Graves SC, Rinnooy Kan AHG and Zipkin PH, North Holland, Amsterdam, Netherlands
    • Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG and Zipkin PH (eds). Logistics of Production and Inventory. North Holland, Amsterdam, Netherlands, pp 445-522.
    • (1993) Logistics of Production and Inventory , pp. 445-522
    • Lawler, E.L.1    Lenstra, J.K.2    Rinnooy Kan, A.3    Shmoys, D.B.4
  • 5
    • 11744302506 scopus 로고
    • Minimizing the maximum penalty in the two-machine flow shop
    • Towsend W (1977). Minimizing the maximum penalty in the two-machine flow shop. Mgmt Sci 24: 230-234.
    • (1977) Mgmt Sci , vol.24 , pp. 230-234
    • Towsend, W.1
  • 6
    • 0001537909 scopus 로고
    • On two-machine scheduling with release and due dates to minimize maximum lateness
    • Grabowski J (1980). On two-machine scheduling with release and due dates to minimize maximum lateness. Opsearch 17: 133-154.
    • (1980) Opsearch , vol.17 , pp. 133-154
    • Grabowski, J.1
  • 7
    • 0022161575 scopus 로고
    • Analysis of heuristics for two-machine flow- shop sequencing subject to release dates
    • Potts CN (1985). Analysis of heuristics for two-machine flow- shop sequencing subject to release dates. Math Opns Res 10: 576-584.
    • (1985) Math Opns Res , vol.10 , pp. 576-584
    • Potts, C.N.1
  • 8
    • 0039135521 scopus 로고
    • A polynomial approximation scheme for a constrained flow shop scheduling problem
    • Hall LA (1994). A polynomial approximation scheme for a constrained flow shop scheduling problem. Math Opns Res 19: 68-85.
    • (1994) Math Opns Res , vol.19 , pp. 68-85
    • Hall, L.A.1
  • 9
    • 0016034348 scopus 로고
    • Some simple scheduling algorithms
    • Horn WA (1974). Some simple scheduling algorithms. Naval Res Logist Q 21: 846-847.
    • (1974) Naval Res Logist Q , vol.21 , pp. 846-847
    • Horn, W.A.1
  • 10
    • 0019525293 scopus 로고
    • Minimizing maximum lateness in a two-machine open shop
    • Lawler EL, Lenstra JK and Rinnoy Kan AHG (1981). Minimizing maximum lateness in a two-machine open shop. Math Opns Res 6: 153-158.
    • (1981) Math Opns Res , vol.6 , pp. 153-158
    • Lawler, E.L.1    Lenstra, J.K.2    Rinnoy Kan, A.3
  • 11
    • 0026836953 scopus 로고
    • A branch-and-bound algorithm to minimize total tardiness with different release times
    • Chu C (1992). A branch-and-bound algorithm to minimize total tardiness with different release times. Naval Res Logist 39: 265-283.
    • (1992) Naval Res Logist , vol.39 , pp. 265-283
    • Chu, C.1

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