메뉴 건너뛰기




Volumn 3, Issue 4, 2005, Pages 303-313

Two-machine flow shop no-wait scheduling with machine maintenance

Author keywords

Approximation scheme; Controllable machine maintenance; Flow shop scheduling; No wait in process

Indexed keywords


EID: 29144519808     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0070-1     Document Type: Article
Times cited : (55)

References (14)
  • 4
    • 0038580606 scopus 로고    scopus 로고
    • Approximability of two-machine flowshop scheduling with availability constraints
    • Cheng TCE, Liu Z (2003) Approximability of two-machine flowshop scheduling with availability constraints. Operations Research Letters 31: 319-322
    • (2003) Operations Research Letters , vol.31 , pp. 319-322
    • Tce, C.1    Liu, Z.2
  • 5
    • 0034824836 scopus 로고    scopus 로고
    • Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
    • Espinouse M-L, Formanowicz P, Penz B (2001) Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability. Journal of the Operational Research Society 52: 116-121
    • (2001) Journal of the Operational Research Society , vol.52 , pp. 116-121
    • Espinouse, M.-L.1    Formanowicz, P.2    Penz, B.3
  • 6
    • 0001068310 scopus 로고
    • Sequencing a one-state variable machine: A solvable case of the traveling salesman problem
    • Gilmore PC, Gomory RE (1964) Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research 12: 655-679
    • (1964) Operations Research , vol.12 , pp. 655-679
    • Gilmore, P.C.1    Gomory, R.E.2
  • 8
    • 0032671338 scopus 로고    scopus 로고
    • Scheduling maintenance and semiresumable jobs on a single machine
    • Graves GH, Lee C-Y (1999) Scheduling maintenance and semiresumable jobs on a single machine. Naval Research Logistics 46: 845-863
    • (1999) Naval Research Logistics , vol.46 , pp. 845-863
    • Graves, G.H.1    Lee, C.-Y.2
  • 9
    • 2342646881 scopus 로고    scopus 로고
    • Two-machine flow shop no-wait scheduling with a non-availability interval
    • Kubzin MA, Strusevich VA (2004) Two-machine flow shop no-wait scheduling with a non-availability interval. Naval Research Logistics 51: 613-631
    • (2004) Naval Research Logistics , vol.51 , pp. 613-631
    • Kubzin, M.A.1    Strusevich, V.A.2
  • 11
    • 84944560904 scopus 로고    scopus 로고
    • Machine scheduling with availability constraints
    • Leung J (ed). Chapman & Hall/CRC, London
    • Lee C-Y (2004) Machine scheduling with availability constraints. In: Leung J (ed) Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC, London, pp. 22-1-22-13
    • (2004) Handbook of Scheduling: Algorithms, Models and Performance Analysis , pp. 221-2213
    • Lee, C.-Y.1
  • 12
    • 0034159705 scopus 로고    scopus 로고
    • Scheduling jobs and maintenance activities on parallel machines
    • Lee C-Y, Chen Z-L (2000) Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics 47: 145-165
    • (2000) Naval Research Logistics , vol.47 , pp. 145-165
    • Lee, C.-Y.1    Chen, Z.-L.2
  • 14
    • 0035980878 scopus 로고    scopus 로고
    • Heuristics for two-machine no-wait flowshop scheduling with availability constraint
    • Wang G, Cheng TCE (2001) Heuristics for two-machine no-wait flowshop scheduling with availability constraint. Information Processing Letters 80: 305-309
    • (2001) Information Processing Letters , vol.80 , pp. 305-309
    • Wang, G.1    Cheng, T.C.E.2


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