메뉴 건너뛰기




Volumn 51, Issue 3, 2004, Pages 307-315

An FPTAS for scheduling a two-machine flowshop with one unavailability interval

Author keywords

Flowshop scheduling; Fully polynomial time approximation scheme; Machine availability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PLANNING; POLYNOMIAL APPROXIMATION; PREVENTIVE MAINTENANCE; PROBLEM SOLVING; SCHEDULING;

EID: 1842611454     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10107     Document Type: Article
Times cited : (30)

References (25)
  • 1
    • 0024944070 scopus 로고
    • Single machine flow-time scheduling with a single breakdown
    • I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan, Single machine flow-time scheduling with a single breakdown, Acta Inform 26 (1989), 679-696.
    • (1989) Acta Inform , vol.26 , pp. 679-696
    • Adiri, I.1    Bruno, J.2    Frostig, E.3    Rinnooy Kan, A.H.G.4
  • 3
    • 0000693192 scopus 로고    scopus 로고
    • Heuristic algorithms for the two-machine flowshop with limited machine availability
    • J. Błazewicz, J. Breit, P. Formanowicz, W. Kubiak, and G. Schmidt, Heuristic algorithms for the two-machine flowshop with limited machine availability, Omega 29 (2001), 599-608.
    • (2001) Omega , vol.29 , pp. 599-608
    • Błazewicz, J.1    Breit, J.2    Formanowicz, P.3    Kubiak, W.4    Schmidt, G.5
  • 5
    • 0002720070 scopus 로고    scopus 로고
    • Two-machine flowshop scheduling with consecutive availability constraints
    • T.C.E. Cheng and G. Wong, Two-machine flowshop scheduling with consecutive availability constraints, Inform Process Lett 71 (1999), 49-54.
    • (1999) Inform Process Lett , vol.71 , pp. 49-54
    • Cheng, T.C.E.1    Wong, G.2
  • 6
    • 0034206108 scopus 로고    scopus 로고
    • An improved heuristic for two-machine flowshop scheduling with an availability constraint
    • T.C.E. Cheng and G. Wong, An improved heuristic for two-machine flowshop scheduling with an availability constraint, Oper Res Lett 26 (2000), 223-229.
    • (2000) Oper Res Lett , vol.26 , pp. 223-229
    • Cheng, T.C.E.1    Wong, G.2
  • 7
    • 0035980878 scopus 로고    scopus 로고
    • Heuristic for two-machine no-wait flowshop scheduling with an availability constraint
    • T.C.E. Cheng and G. Wong, Heuristic for two-machine no-wait flowshop scheduling with an availability constraint, Inform Process Lett 80 (2001), 305-309.
    • (2001) Inform Process Lett , vol.80 , pp. 305-309
    • Cheng, T.C.E.1    Wong, G.2
  • 8
    • 0032599488 scopus 로고    scopus 로고
    • Minimizing the makespan in the two-machine no-wait flowshop with limited machine availability
    • M.L. Espinouse, P. Formanowicz, and B. Penz, Minimizing the makespan in the two-machine no-wait flowshop with limited machine availability, Comput Indust Eng 37 (1999), 497-500.
    • (1999) Comput Indust Eng , vol.37 , pp. 497-500
    • Espinouse, M.L.1    Formanowicz, P.2    Penz, B.3
  • 9
    • 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 Logist Quart 1 (1954), 61-68.
    • (1954) Naval Res Logist Quart , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 11
    • 0001880962 scopus 로고
    • Parallel machines scheduling with non-simultaneous machine available time
    • C.-Y. Lee, Parallel machines scheduling with non-simultaneous machine available time, Discrete Appl Math 30 (1991), 53-61.
    • (1991) Discrete Appl Math , vol.30 , pp. 53-61
    • Lee, C.-Y.1
  • 12
    • 0042519156 scopus 로고
    • Machine scheduling with an availability constraint
    • Working Paper 95-3, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL
    • C.-Y. Lee, Machine scheduling with an availability constraint, Working Paper 95-3, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 1995.
    • (1995)
    • Lee, C.-Y.1
  • 13
    • 0000541519 scopus 로고    scopus 로고
    • Machine scheduling with an availability constraint
    • C.-Y. Lee, Machine scheduling with an availability constraint, J Global Optim 9 (1996), 395-416.
    • (1996) J Global Optim , vol.9 , pp. 395-416
    • Lee, C.-Y.1
  • 14
    • 0000049036 scopus 로고    scopus 로고
    • Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
    • C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Oper Res Lett 20 (1997), 129-139.
    • (1997) Oper Res Lett , vol.20 , pp. 129-139
    • Lee, C.-Y.1
  • 15
    • 0033116875 scopus 로고    scopus 로고
    • Two-machine flowshop scheduling with availability constraints
    • C.-Y. Lee, Two-machine flowshop scheduling with availability constraints, European Journal of Operational Research 114 (1999), 420-429.
    • (1999) European Journal of Operational Research , vol.114 , pp. 420-429
    • Lee, C.-Y.1
  • 16
    • 0031492360 scopus 로고    scopus 로고
    • Current trends in deterministic scheduling
    • C.-Y. Lee, L. Lei, and M. Pinedo, Current trends in deterministic scheduling, Ann Oper Res 70 (1997), 1-42.
    • (1997) Ann Oper Res , vol.70 , pp. 1-42
    • Lee, C.-Y.1    Lei, L.2    Pinedo, M.3
  • 17
    • 0026897390 scopus 로고
    • Single machine flow-time scheduling with scheduled maintenance
    • C.-Y. Lee and S. D. Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Inform 29 (1992), 375-382.
    • (1992) Acta Inform , vol.29 , pp. 375-382
    • Lee, C.-Y.1    Liman, S.D.2
  • 18
    • 38249005916 scopus 로고
    • Capacitated two-parallel machines scheduling to minimize sum of job completion times
    • C.-Y. Lee and S. D. Liman, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Appl Math 41 (1993), 211-222.
    • (1993) Discrete Appl Math , vol.41 , pp. 211-222
    • Lee, C.-Y.1    Liman, S.D.2
  • 19
    • 0000507163 scopus 로고
    • Preemptive scheduling with variable profile, precedence constraints and due dates
    • Z. Liu and E. Sanlaville, Preemptive scheduling with variable profile, precedence constraints and due dates, Discrete Appl Math 58 (1995), 253-280.
    • (1995) Discrete Appl Math , vol.58 , pp. 253-280
    • Liu, Z.1    Sanlaville, E.2
  • 20
    • 0002574777 scopus 로고
    • Minimizing the sum of completion times on capacitated parallel machines
    • G. Mosheiov, Minimizing the sum of completion times on capacitated parallel machines, Math Comput Modelling 20 (1994), 91-99.
    • (1994) Math Comput Modelling , vol.20 , pp. 91-99
    • Mosheiov, G.1
  • 22
    • 0032362468 scopus 로고    scopus 로고
    • Machine scheduling with availability constraints
    • E. Sanlaville and G. Schmidt, Machine scheduling with availability constraints, Acta Inform 35 (1998), 795-811.
    • (1998) Acta Inform , vol.35 , pp. 795-811
    • Sanlaville, E.1    Schmidt, G.2
  • 23
    • 0021506728 scopus 로고
    • Scheduling on semi-identical processors
    • G. Schmidt, Scheduling on semi-identical processors, Z Oper Res 28 (1984), 153-162.
    • (1984) Z Oper Res , vol.28 , pp. 153-162
    • Schmidt, G.1
  • 24
    • 0023978728 scopus 로고
    • Scheduling independent tasks with deadlines on semi-identical processors
    • G. Schmidt, Scheduling independent tasks with deadlines on semi-identical processors, J Oper Res Soc 39 (1988), 271-277.
    • (1988) J Oper Res Soc , vol.39 , pp. 271-277
    • Schmidt, G.1
  • 25
    • 0343963100 scopus 로고    scopus 로고
    • Scheduling with limited availability
    • G. Schmidt, Scheduling with limited availability, European J Oper Res 121 (2000) 1-15.
    • (2000) European J Oper Res , vol.121 , pp. 1-15
    • Schmidt, G.1


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