No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates

References

• Aggoune , R and Portmann , MC . 2006 . Flow shop scheduling problem with limited machine availability: a heuristic approach . International Journal of Production Economics , 99 ( 1–2 ) : 4 – 15 .
   Web of Science ®Google Scholar
• Allaoui , H . 2006 . Scheduling of a two-machine flowshop with availability constraints on the first machine . International Journal of Production Economics , 99 ( 1–2 ) : 16 – 27 .
   Web of Science ®Google Scholar
• Allahverdi , A and Aldowaisan , T . 2002 . No-wait flowshops with bicriteria of makespan and total completion time . Journal of the Operational Research Society , 53 ( 9 ) : 1004 – 1015 .
   Web of Science ®Google Scholar
• Bagchi , TP , Gupta , JND and Sriskandarajah , C . 2006 . A review of TSP based approaches for flowshop scheduling . European Journal of Operational Research , 169 ( 3 ) : 816 – 854 .
   Web of Science ®Google Scholar
• Ben Chihaoui , F , Dridi , N and Ben Hadj-Alouane , A . Two-machine no-wait flowshop scheduling with availability constraints and release dates . Proceedings of the, international conference on computers & industrial engineering . 6–8 July 2009 , Troyes. France, 170–176
   Google Scholar
• Bianco , L , Dell’Olmo , P and Giordani , S . 1999 . Flow shop no-wait scheduling with sequence dependent setup times and release dates . INFOR , 37 ( 1 ) : 3 – 19 .
   Web of Science ®Google Scholar
• Carlier , J . 1982 . The one-machine sequencing problem . European Journal of Operational Research , 11 ( 1 ) : 42 – 47 .
   Web of Science ®Google Scholar
• Carlier , J . 2010 . Exact resolution of the one-machine sequencing problem with no machine idle time . Computers & Industrial Engineering , 59 ( 2 ) : 193 – 199 .
   Web of Science ®Google Scholar
• Cheng , J , Steiner , G and Stephenson , P . 2001 . A computational study with a new algorithm for three-machine permutation flow shop problem with release times . European Journal of Operational Research , 130 ( 3 ) : 559 – 575 .
   Web of Science ®Google Scholar
• Cheng , TCE and Liu , Z . 2003 . 3/2 approximation for two-machine no-wait flowshop scheduling with availability constraints . Information Processing Letters , 88 ( 4 ) : 161 – 165 .
   Web of Science ®Google Scholar
• Espinouse , ML , Formanowicz , P and Penz , B . 1999 . Minimizing the makespan in the two–machine no-wait flow-shop with limited machine availability . Computers & Industrial Engineering , 37 ( 1–2 ) : 497 – 500 .
   Web of Science ®Google Scholar
• Espinouse , ML , Formanowicz , P and Penz , B . 2001 . Complexity results and approximation for the two-machine no-wait flow-shop with limited machine availability . Journal of the Operational Research Society , 52 ( 1 ) : 116 – 121 .
   Web of Science ®Google Scholar
• Finke , G . Espinouse, M.L., and Jiang, H., 1997. Flowshops and extensions. In: Proceedings of the conference on management and control of production and logistics (MCPL’97), 31 August–3 September 1997, Campinas, Brazil, 275–280
   Google Scholar
• França , PM ,  Tin , G and Buriol , LS . 2006 . Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions . International Journal of Production Research , 44 ( 5 ) : 939 – 957 .
   Web of Science ®Google Scholar
• Gilmore , PC and Gomory , RE . 1964 . Sequencing a one-state variable machine: a solvable case of the travelling salesman problem . Operations Research , 12 ( 5 ) : 655 – 679 .
   Web of Science ®Google Scholar
• Hall , LA . 1994 . A polynomial approximation scheme for a constrained flow-shop scheduling problem . Mathematics of Operations Research , 19 ( 1 ) : 68 – 85 .
   Web of Science ®Google Scholar
• Hall , LA . 1995 . Approximability of flowshop scheduling . Proceedings of the 36th annual symposium on foundations of computer science . 23–25 October 1995 , Milwaukee, Los Alamitos, WI. CA: IEEE Computer Society Press, 82–91
   Google Scholar
• Hall , NG and Sriskandarajah , C . 1996 . A survey of machine scheduling problems with blocking and no-wait in process . Operations Research , 44 ( 3 ) : 510 – 525 .
   Web of Science ®Google Scholar
• Kacem , I and Haouari , M . 2009 . Approximation algorithms for single machine scheduling with one unavailability period . 4OR: A Quarterly Journal of Operations Research , 7 ( 1 ) : 79 – 92 .
   Web of Science ®Google Scholar
• Kashyrskikh , KN , Potts , CN and Sevastianov , SV . 2001 . A (3/2)-approximation algorithm for two-machine flwo-shop sequencing subject to release dates . Discrete Applied Mathematics , 114 ( 1–3 ) : 255 – 271 .
   Web of Science ®Google Scholar
• Kubzin , MA and Strusevich , VA . 2004 . Approximation algorithms for two-machine flow shop no-wait scheduling with a non-availability interval . Naval Research Logistics , 51 ( 4 ) : 613 – 631 .
   Web of Science ®Google Scholar
• Kovalyov , MY and Werner , F . 1997 . A polynomial approximation scheme for problem F2/rj/Cmax . Operations Research Letters , 20 ( 2 ) : 75 – 79 .
   Web of Science ®Google Scholar
• Lee , CY . 1997 . Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint . Operations Research Letters , 20 ( 3 ) : 129 – 139 .
   Web of Science ®Google Scholar
• Lee , CY . 1999 . Two-machine flowshop scheduling with availability constraints . European Journal of Operational Research , 114 ( 2 ) : 420 – 429 .
   Web of Science ®Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1977 . “ Complexity of machine scheduling problems ” . In Studies in integer programming, volume 1 (annals of discrete mathematics) , Edited by: Hammer , PL . 343 – 362 . Amsterdam : North-Holland .
   Google Scholar
• Ma , Y , Chu , C and Zuo , C . 2010 . A survey of scheduling with deterministic machine availability constraints . Computers & Industrial Engineering , 58 ( 2 ) : 199 – 211 .
   Web of Science ®Google Scholar
• Potts , CN . 1985 . Analysis of heuristics for two-machine flow-shop sequencing subject to release dates . Mathematics of Operations Research , 10 ( 4 ) : 576 – 584 .
   Web of Science ®Google Scholar
• Ronconi , DP . 2005 . A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking . Annals of Operations Research , 138 ( 1 ) : 53 – 65 .
   Web of Science ®Google Scholar
• Röck , H . 1980 . The three machine-machine no-wait flow shop problem is NP-complete . Journal of ACM , 31 ( 2 ) : 336 – 345 .
   Web of Science ®Google Scholar
• Schmidt , G . 2000 . Scheduling with limited machine availability . European Journal of Operational Research , 121 ( 1 ) : 1 – 15 .
   Web of Science ®Google Scholar
• Wang , G and Cheng , TCE . 2001 . Heuristics for two-machine no-wait flowshop scheduling with an availability constraint . Information Processing Letters , 80 ( 6 ) : 305 – 309 .
   Web of Science ®Google Scholar