On the two‑stage assembly fow shop problem

• Hatem Hadda ^[1] ; Najoua Dridi ^[2] ; Sonia Hajri Gabouj ^[2]
  1. [1] Tunis University

     Tunis University

     Túnez

     
  2. [2] LISI, INSAT, Centre Urbain Nord, Tunisia
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 32, Nº. 2, 2024, págs. 224-244
• Idioma: inglés
• DOI: 10.1007/s11750-024-00664-0
• Enlaces
  • Texto completo
• Resumen

  • Numerous operational constraints within both industry and service sectors mandate the concurrent scheduling of tasks. This need is particularly evident in the assembly of products within manufacturing processes. This paper concentrates on minimizing makespan in the two-stage assembly fow shop problem. Our contributions include the introduction of novel dominance rules, a proposal for a heuristic method, and the development of a branch and bound algorithm. Additionally, we conduct an empirical analysis of makespan distribution for small-size instances. Through extensive experimentation, our study demonstrates the efciency of the introduced dominance rules and the strong performance of the developed branch and bound algorithm.

• Referencias bibliográficas
  • Framinan JM, Perez-Gonzalez P, Fernandez-Viagas V (2019) Deterministic assembly scheduling problems: a review and classifcation of concurrent-type...
  • Dridi N, Hadda H, Hajri-Gabouj S (2009) Heuristic method applied to the hybrid fow shop problem with dedicated machines. RAIRO Oper Res 43:421–436...
  • Hadda H, Dridi N, Hajri-Gabouj S (2007) The two-stage assembly fow shop scheduling with an availability constraint. In: Proc. 3rd Multidisciplinary...
  • Hadda H, Dridi N, Hajri-Gabouj S (2014a) Exact resolution of the two-stage hybrid fow shop with dedicated machines. Optim Lett 8:2329–2339
  • Hadda H, Dridi N, Hajri-Gabouj S (2014b) The two-stage assembly fow shop scheduling with an availability constraint: worst case analysis....
  • Hadda H, Hajji MK, Dridi N (2015) On the two-stage Hybrid fow shop with dedicated machines. RAIRO Oper Res 49:795–804
  • Hadda H, Dridi N, Hajji MK (2018) On the optimality conditions of the two-machine fow shop problem. Eur J Oper Res 266:426–435
  • Haouari M, Daouas T (1999) Optimal scheduling of the 3-machine assembly-type fow shop. RAIRO Oper Res 33:439–445
  • Hariri AMA, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Oper Res 103:547–556
  • Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Res Log Q 1:61–68
  • Komaki GM, Sheikh Shaya, Malakooti Behnam (2019) Scheduling problems with assembly operations: a review and new trends. Int J Prod Res 57:2926–2955...
  • Koulamas C, Kyparisis GJ (2001) The three-stage assembly fowshop scheduling problem. Comput Oper Res 28:689–704
  • Koulamas C, Kyparisis GJ (2007) A note on the two-stage assembly fow shop scheduling problem with uniform parallel machines. Eur J Oper Res...
  • Lee CY, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type fowshop scheduling problem. Manag Sci 39:616–625
  • Navaeia J, Ghomib SMTF, Jolaic F, Mozdgird A (2014) Heuristics for an assembly fow-shop with nonidentical assembly machines and sequence dependent...
  • Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job fowshop sequencing problem. Omega 11:91–95
  • Potts CN, Sevast’janov SV, Strusevich VA, Van wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and...
  • Shoaardebili N, Fattahi P (2015) Multi-objective meta-heuristics to solve three-stage assembly fow shop scheduling problem with machine availability...
  • Xi S, Kazuko M, Hiroyuki N (2003) Powerful heuristics to minimize makespan in fxed, 3-machine, assembly-type fowshop scheduling. Eur J Oper...
  • Yokoyama M (2004) Scheduling for Two-Stage Production System with Setup and Assembly Operations. Comput Oper Res 31:2063–2078