On-line and semi-online scheduling for flow shop problems on two machines

References

• B. Chen and G.J. Woeginger, A study of on-line scheduling two-stage shops, in Minimax and Applications, D.-Z. Du and P.M. Pardalos, eds., Kluwer, Dordrecht, (1995), pp. 97–107
   Google Scholar
• Gonzalez , T and Sahni , S . 1978 . Flow shop and job shop schedules: Complexity and approximation . Oper. Res. , 26 : 36 – 52 .
   Web of Science ®Google Scholar
• Johnson , SM . 1954 . Optimal two-and-three-stage production schedules with set-up times included . Nav. Res. Log. Quart. , 1 : 61 – 68 .
   Google Scholar
• Kubzin , MA , Potts , CN and Strusevich , VA . 2009 . Approximation results for flow shops scheduling problems with machine availability constraints . Comput. Oper. Res. , 36 : 379 – 390 .
   Web of Science ®Google Scholar
• Lawler , EL , Lenstra , JK , Rinnooy Kan , AHG and Shmoys , DB . 1993 . Sequencing and scheduling: Algorithms and complexity . Handbooks Oper. Res. Manag. Sci. , 4 : 445 – 522 .
   Google Scholar
• Lee , C-Y . 1997 . Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint . Oper. Res. Lett. , 20 : 129 – 139 .
   Web of Science ®Google Scholar
• Ma , Y , Chu , C and Zuo , C . 2010 . A survey of scheduling with deterministic machine availability constraints . Comput. Ind. Eng. , 58 : 199 – 211 .
   Web of Science ®Google Scholar
• Potts , CN . 1985 . Analysis of heuristics for two-machine flow-shop sequencing subject to release dates . Math. Oper. Res. , 10 : 576 – 584 .
   Web of Science ®Google Scholar