Scheduling two-stage hybrid flow shop with availability constraints

Lee, 1997, Minimizing the makespan in the two-machine flow-shop scheduling problem with an availability constraint, Operational Research Letters, 20, 129, 10.1016/S0167-6377(96)00041-7 Lee, 1994, Minimizing makespan in hybrid flowshops, Operational Research Letters, 16, 149, 10.1016/0167-6377(94)90026-4 Johnson, 1954, Optimal two- and three-stage productionschedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Garey, 1979 Hoogeveen, 1996, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, European Journal of Operational Research, 89, 172, 10.1016/S0377-2217(96)90070-3 Arthanary, 1971, An extension of two machines sequencing problem, Journal of Operational Research, 41, 641 Gupta, 1998, Two stage hybrid flowshop scheduling problem, Journal of Operational Research Society, 39–4, 359 Rao, 1970, Sequencing in the order A, B with multiplicity of machines for a single operation, Operational Research, 7, 135 Sriskandarajah, 1989, Scheduling algorithms for flexible flow shops, European Journal of Operational Research, 43, 143, 10.1016/0377-2217(89)90208-7 Langston, 1987, Interstage transportation planning in the deterministic flow-shop environment, Operational Research, 35-4, 556, 10.1287/opre.35.4.556 Liu, 1995, Preemptive scheduling with variable profile, precedence constraints and due dates, European Journal of Operational Research, 114, 420 Lee, 1991, Parallel machine scheduling with nonsimultaneous machine available time, Discrete and Applied Mathematics, 30, 53, 10.1016/0166-218X(91)90013-M Lee, 1997, Current trends in deterministic scheduling, Annals of Operational Research, 70, 1, 10.1023/A:1018909801944 Lee, 1996, Machine scheduling with an availability constraint, Journal of Global Optimization, 9, 363, 10.1007/BF00121681 Lee, 2000, Scheduling Jobs and Maintenance Activities on Parallel Machines, Naval Research Logistics, 47, 61, 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 Schmidt, 2000, Scheduling with limited machine availability, European Journal of the Operational Research, 121, 1, 10.1016/S0377-2217(98)00367-1 Cheng, 2000, An improved heuristic for two-machine flowshop scheduling with an availability constraint, Operational Research Letters, 26, 223, 10.1016/S0167-6377(00)00033-X Chen, 1995, Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage, Journal of the Operational Research Society, 46, 234, 10.1057/jors.1995.28 Kubiak, 2002, Two-machine flowshop with limited machine availability, European Journal of the Operational Research, 136, 528, 10.1016/S0377-2217(01)00083-2 Blazewicz, 2001, Heuristic algorithms for two-machine flowshop with limited machine availability, Omega, 29, 599, 10.1016/S0305-0483(01)00048-2 Karp, 1972, Reducibility among combinatorial problems, 85 Salvador MS. A solution to a special case of flow shop scheduling problems. In: Elmaghraby SE, editor. Symposium of the Theory of Scheduling and Applications, 1973, p. 83–91. Rajendran, 1992, Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan, International Journal of Production Economics, 27, 137, 10.1016/0925-5273(92)90006-S Brah, 1991, Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, 51, 88, 10.1016/0377-2217(91)90148-O Portmann, 1998, Branch and bound crossed with GA to solve hybrid flowshops, European Journal of Operational Research, 107, 389, 10.1016/S0377-2217(97)00333-0 Breit J, Schmidt G, Strusevich VA. Two-machine open-shop with an availability constraint. Operational Research Letters 2001;29:65–77. Brucker P. Scheduling algorithms. 2nd ed., Berlin: Springer; 1998. Gupta JND, Hariri AMA, Potts CN. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operational Research 1994;69:171–91. Kurz ME, Askin RG. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 2004;159:66–82. Lin HT, Liao CJ. A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 2004;862:133–43. Lee C-Y. Two-machine flowshop scheduling with an availability constraint. Discrete and Applied Mathematics 1999;58:253–80. Narasimhan SL, Panwalkar SS. Scheduling in a two-stage manufacturing process. International Journal of Production 1984;22:555–64. Pinedo M. Scheduling: theory algorithms and systems. 2nd ed., Englewood Cliffs, NJ: Prentice-Hall; 2002. Oguz C, Zindler Y, Do VH, Lichtenstein M. Hybrid flow-scheduling problems with multiprocessor task system. European Journal of Operational Research 2004;152:115–31. Ohno K, Jin ZH, Elmaghraby SE. Scheduling hybrid flowshops in printed circuit board assembly lines. Production and Operations Management 2002;11-2:216. Riane F, Artiba A, Elmaghraby SE. A hybrid three-stage flowshop problem: efficient heuristics to minimize mekespan. European Journal of the Operational Research 1998;109:321–9. Sahni S. Algorithms for scheduling independent tasks. Journal of the ACM 1976;23:116–27. Schuurman P, Woeginger GJ. A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theoretical Computer Science 2000;237:105–22.