Two-machine flow shop no-wait scheduling with a nonavailability interval

Naval Research Logistics

Volumn 51, Issue 4, 2004, Pages 613-631

  Kubzin, Mikhail A ^a   Strusevich, Vitaly A ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Flow shop scheduling; No wait in process; Nonavailability interval; Worst case analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MACHINE COMPONENTS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; POLYNOMIALS; PRESSING (FORMING); PROBLEM SOLVING; SCHEDULING; STAMPING; TRAVELING SALESMAN PROBLEM;

FLOW SHOP SCHEDULING; NO-WAIT IN PROCESS; NONAVIALABILITY INTERVALS; WORST-CASE ANALYSIS;

MACHINING;

EID: 2342646881     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10118     Document Type: Article

References (16)

1. J. Breit, G. Schmidt, and V.A. Strusevich, Two-machine open shop scheduling with an availability constraint, Oper Res Lett 29 (2001), 65-77.
2. R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen, and G.J. Woeginger, Well-solvable special cases of the traveling salesman problem: A survey, SIAM Rev 40 (1998), 496-546.
3. T.C.E. Cheng and G. Wang, An improved heuristic for two-machine flowshop scheduling with an availability constraint, Oper Res Letters 26 (2000), 223-229.
4. T.C.E. Cheng and Z. Liu, Approximability of two-machine flowshop scheduling with availability constraints, Oper Res Lett 31 (2003), 319-322.
5. M.-L. Espinouse, P. Formanowicz, and B. Penz, Minimizing the makespan in the two machine no-wait flow-shop with limited machine availability, Comput Indust Engng 37 (1999), 497-500.
6. M.-L. Espinouse, P. Formanowicz, and B. Penz, Complexity results on and approximation algorithms for the two machine no-wait flow-shop with limited machine availability, J Oper Res Soc 52 (2001), 116-121.
7. P.C. Gilmore and R.E. Gomory, Sequencing a one-state variable machine: a solvable case of the traveling salesman problem, Oper Res 12 (1964), 655-679.
8. P.C. Gilmore, E.L. Lawler, and D.B. Shmoys, "Well solved special cases," The Traveling salesman problem. A guided tour of combinatorial optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Editors), Wiley, New York, 1986, pp. 87-143.
9. W. Kubiak, J. Błažewicz, P. Formanowicz, J. Breit, and G. Schmidt, Two-machine flow shops with imited machine availability, European J Oper Res 136 (2002), 528-540.
10. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, "Sequencing and scheduling: algorithms and complexity," Handbooks in operations research and management science, volume 4, Logistics of production and inventory, S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (Editors), North-Holland, Amsterdam, 1993, pp. 455-522.
11. C.-Y. Lee, Machine scheduling with an availability constraint, J Global Optim 9 (1996), 395-416.
12. C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Oper Res Lett 20 (1997), 129-139.
13. C.-Y. Lee, Two-machine flowshop scheduling with availability constraints, European J Oper Res 114 (1999), 420-429.
14. E. Sanlaville and G. Schmidt, Machine scheduling with availability constraints, Acta Inform 35 (1998), 795-811.
15. G. Schmidt, Scheduling with limited machine availability, European J Oper Res 121 (2000), 1-15.
16. G. Wang and T.C.E. Cheng, Heuristics for two-machine no-wait flowshop scheduling with availability constraint, Inform Process Lett 80 (2001), 305-309.