{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:00:30Z","timestamp":1784995230700,"version":"3.55.0"},"reference-count":99,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s12351-026-01077-6","type":"journal-article","created":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T14:07:21Z","timestamp":1784988441000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comprehensive literature review for hybrid flow shop scheduling problems with dedicated machines"],"prefix":"10.1007","volume":"26","author":[{"given":"Asma","family":"Ouled Bedhief","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amira","family":"Brahmi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Najla","family":"Aissaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,25]]},"reference":[{"key":"1077_CR1","doi-asserted-by":"publisher","first-page":"116158","DOI":"10.1016\/j.eswa.2021.116158","volume":"191","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Abd Elaziz M, Sumari P, Geem ZW, Gandomi AH (2022) Reptile search algorithm (RSA): a nature-inspired meta-heuristic optimizer. Exp Syst Appl 191:116158","journal-title":"Exp Syst Appl"},{"key":"1077_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108672","volume":"173","author":"A Amirteimoori","year":"2022","unstructured":"Amirteimoori A, Mahdavi I, Solimanpur M, Ali SS, Tirkolaee EB (2022) A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation. Comput Ind Eng 173:108672","journal-title":"Comput Ind Eng"},{"key":"1077_CR3","unstructured":"Besbes W, Loukil T, Teghem J (2010) A two-stage flow shop with parallel dedicated machines. In:\u00a08th international conference of modeling and simulation, MOSIM, vol 10"},{"key":"1077_CR4","unstructured":"Blondin J (2009) Particle swarm optimization: a tutorial.\u00a0Availaible from: http:\/\/cs. armstrong. edu\/saad\/csci8100\/pso tutorial. pdf,\u00a034."},{"issue":"4","key":"1077_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","volume":"2","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2(4):353\u2013373","journal-title":"Phys Life Rev"},{"issue":"1","key":"1077_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ejor.2021.08.007","volume":"299","author":"J Brammer","year":"2022","unstructured":"Brammer J, Lutz B, Neumann D (2022) Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning. Eur J Oper Res 299(1):75\u201386","journal-title":"Eur J Oper Res"},{"key":"1077_CR7","first-page":"24","volume":"42","author":"L Bruce","year":"1987","unstructured":"Bruce L (1987) The bright new worlds of Benetton. Int Manag 42:24\u201335","journal-title":"Int Manag"},{"key":"1077_CR8","doi-asserted-by":"crossref","unstructured":"Caserta M, Vo\u00df S (2010) A math-heuristic algorithm for the DNA sequencing roblem. In:\u00a0International conference on learning and intelligent optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 25\u201336","DOI":"10.1007\/978-3-642-13800-3_3"},{"key":"1077_CR10","doi-asserted-by":"crossref","unstructured":"Chaari T, Chaabane S, Aissani N, Trentesaux D (2014) Scheduling under uncertainty: Survey and research directions. In:\u00a02014 International conference on advanced logistics and transport (ICALT) IEEE, pp 229\u2013234","DOI":"10.1109\/ICAdLT.2014.6866316"},{"issue":"1","key":"1077_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2006.06.033","volume":"181","author":"L Chen","year":"2007","unstructured":"Chen L, Bostel N, Dejax P, Cai J, Xi L (2007) A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur J Oper Res 181(1):40\u201358","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1077_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-5273(98)00039-5","volume":"55","author":"TCE Cheng","year":"1998","unstructured":"Cheng TCE, Kovalyov MY (1998) An exact algorithm for batching and scheduling two-part types in a mixed shop: a technical note. Int J Prod Econ 55(1):53\u201356","journal-title":"Int J Prod Econ"},{"issue":"1","key":"1077_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/07408170490247368","volume":"36","author":"TCE Cheng","year":"2004","unstructured":"Cheng TCE, Kovalyov MY, Chakhlevich KN (2004) Batching in a two-stage flowshop with dedicated machines in the second stage. IIE Trans 36(1):87\u201393","journal-title":"IIE Trans"},{"issue":"11","key":"1077_CR14","doi-asserted-by":"publisher","first-page":"3031","DOI":"10.1016\/j.cor.2009.02.001","volume":"36","author":"TE Cheng","year":"2009","unstructured":"Cheng TE, Lin BM, Tian Y (2009) Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times. Comput Oper Res 36(11):3031\u20133040","journal-title":"Comput Oper Res"},{"issue":"4","key":"1077_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/nav.21846","volume":"66","author":"TCE Cheng","year":"2019","unstructured":"Cheng TCE, Kravchenko SA, Lin BM (2019) Server scheduling on parallel dedicated machines with fixed job sequences. Naval Res Logist (NRL) 66(4):321\u2013332","journal-title":"Naval Res Logist (NRL)"},{"key":"1077_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10288-015-0297-4","volume":"13","author":"N Chikhi","year":"2015","unstructured":"Chikhi N, Abbas M, Benmansour R, Bekrar A, Hanafi S (2015) A two-stage flow shop scheduling problem with transportation considerations. 4OR 13:381\u2013402","journal-title":"4OR"},{"key":"1077_CR106","unstructured":"Chikhi, N., & Abbas, M. (2012). Makespan minimization for two-stage hybrid Flow shop with dedicated machines and additional constraints. In 9th International Conference on Modeling, Optimization & SIMulation."},{"key":"1077_CR18","doi-asserted-by":"crossref","unstructured":"Chikhi N, Benmansour R, Bekrar A, Hanafi S, Abbas M (2014) A case study of a two-stage flow shop with dedicated machines and a single robot. In:\u00a02014 international conference on control, decision and information technologies (CoDIT), IEEE, pp 246\u2013250","DOI":"10.1109\/CoDIT.2014.6996901"},{"key":"1077_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.5267\/j.ijiec.2021.12.001","volume":"13","author":"M Colak","year":"2022","unstructured":"Colak M, Keskin GA (2022) An extensive and systematic literature review for hybrid flowshop scheduling problems. Int J Ind Eng Comput 13:185\u2013222","journal-title":"Int J Ind Eng Comput"},{"issue":"23","key":"1077_CR21","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12234732","volume":"12","author":"M Del Gallo","year":"2023","unstructured":"Del Gallo M, Mazzuto G, Ciarapica FE, Bevilacqua M (2023) Artificial intelligence to solve production scheduling problems in real industrial settings: systematic literature review. Electronics 12(23):4732","journal-title":"Electronics"},{"issue":"4","key":"1077_CR22","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1051\/ro\/2009024","volume":"43","author":"N Dridi","year":"2009","unstructured":"Dridi N, Hadda H, Hajri-Gabouj S (2009) M\u00e9thode heuristique pour le probl\u00e8me de flow shop hybride avec machines d\u00e9di\u00e9es. RAIRO 43(4):421\u2013436","journal-title":"RAIRO"},{"key":"1077_CR24","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","volume":"72","author":"O Engin","year":"2018","unstructured":"Engin O, G\u00fc\u00e7l\u00fc A (2018) A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl Soft Comput 72:166\u2013176","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1077_CR25","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10462-018-9667-6","volume":"53","author":"MH Fazel Zarandi","year":"2020","unstructured":"Fazel Zarandi MH, Sadat Asl AA, Sotudian S, Castillo O (2020) A state of the art review of intelligent scheduling. Artif Intell Rev 53(1):501\u2013593","journal-title":"Artif Intell Rev"},{"issue":"1","key":"1077_CR26","first-page":"116","volume":"75","author":"E Feitzinger","year":"1997","unstructured":"Feitzinger E, Lee HL (1997) Mass customization at Hewlett-Packard: the power of postponement. Harv Bus Rev 75(1):116\u2013121","journal-title":"Harv Bus Rev"},{"key":"1077_CR27","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-Completeness. Freeman, San Francisco"},{"issue":"1","key":"1077_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2478\/v10209-011-0004-y","volume":"37","author":"E Gerstl","year":"2012","unstructured":"Gerstl E, Mosheiov G (2012) A two-stage flow shop scheduling with a critical machine and batch availability. Found Comput Decis Sci 37(1):39","journal-title":"Found Comput Decis Sci"},{"issue":"4","key":"1077_CR30","doi-asserted-by":"publisher","first-page":"399","DOI":"10.5267\/j.ijiec.2017.2.001","volume":"8","author":"E Gonz\u00e1lez-Neira","year":"2017","unstructured":"Gonz\u00e1lez-Neira E, Montoya-Torres J, Barrera D (2017) Flow-shop scheduling problem under uncertainties: review and trends. Int J Ind Eng Comput 8(4):399\u2013426","journal-title":"Int J Ind Eng Comput"},{"key":"1077_CR31","doi-asserted-by":"crossref","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In:\u00a0Annals of discrete mathematics, Elsevier vol 5, pp 287\u2013326","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"10","key":"1077_CR33","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1080\/01605682.2019.1621220","volume":"71","author":"JN Gupta","year":"2020","unstructured":"Gupta JN, Majumder A, Laha D (2020) Flowshop scheduling with artificial neural networks. J Oper Res Soc 71(10):1619\u20131637","journal-title":"J Oper Res Soc"},{"issue":"10","key":"1077_CR34","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.cor.2013.03.009","volume":"40","author":"H Hadda","year":"2013","unstructured":"Hadda H (2013) A note on \u201ca heuristic method for two-stage hybrid flow shop with dedicated machines.\u201d Comput Oper Res 40(10):2283","journal-title":"Comput Oper Res"},{"key":"1077_CR35","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1007\/s11590-011-0365-4","volume":"6","author":"H Hadda","year":"2012","unstructured":"Hadda H, Dridi N, Hajri-Gabouj S (2012) A note on the two-stage hybrid flow shop problem with dedicated machines. Optim Lett 6:1731\u20131736","journal-title":"Optim Lett"},{"key":"1077_CR36","doi-asserted-by":"publisher","first-page":"2329","DOI":"10.1007\/s11590-014-0741-y","volume":"8","author":"H Hadda","year":"2014","unstructured":"Hadda H, Dridi N, Hajri-Gabouj S (2014) Exact resolution of the two-stage hybrid flow shop with dedicated machines. Optim Lett 8:2329\u20132339","journal-title":"Optim Lett"},{"issue":"4","key":"1077_CR37","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1051\/ro\/2015005","volume":"49","author":"H Hadda","year":"2015","unstructured":"Hadda H, Hajji MK, Dridi N (2015) On the two-stage hybrid flow shop with dedicated machines. RAIRO Oper Res 49(4):795\u2013804","journal-title":"RAIRO Oper Res"},{"issue":"4","key":"1077_CR38","first-page":"300","volume":"7","author":"MK Hajji","year":"2015","unstructured":"Hajji MK, Hadda H, Dridi N (2015) The two-stage hybrid flow shop problem with dedicated machines under release dates and delivery times. Int J Adv Oper Manag 7(4):300\u2013316","journal-title":"Int J Adv Oper Manag"},{"issue":"7","key":"1077_CR39","doi-asserted-by":"publisher","first-page":"137","DOI":"10.3390\/computation11070137","volume":"11","author":"MK Hajji","year":"2023","unstructured":"Hajji MK, Hadda H, Dridi N (2023) Makespan minimization for the two-stage hybrid flow shop problem with dedicated machines: a comprehensive study of exact and heuristic approaches. Computation 11(7):137","journal-title":"Computation"},{"key":"1077_CR40","first-page":"100144","volume":"9","author":"MK Hajji","year":"2024","unstructured":"Hajji MK, Hamlaoui O, Hadda H (2024) A simulated annealing metaheuristic approach to hybrid flow shop scheduling problem. Adv Ind Manuf Eng 9:100144","journal-title":"Adv Ind Manuf Eng"},{"key":"1077_CR41","unstructured":"Hajji MK, Hadda H, Dridi N (2016) Une heuristique pour le flow shop hybride \u00e0 deux \u00e9tages avec machines d\u00e9di\u00e9es. In\u00a0:\u00a0ROADEF 2016: 17eme congr\u00e9 annuel de le soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision"},{"issue":"19","key":"1077_CR42","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1016\/j.ifacol.2024.09.077","volume":"58","author":"AG Hamiti","year":"2024","unstructured":"Hamiti AG, Bouazza W, Laurent A, Mebarki N, Kenani M (2024) Machine learning prediction model for dynamic scheduling of hybrid flow-shop based on metaheuristic. IFAC-PapersOnLine 58(19):1228\u20131233","journal-title":"IFAC-PapersOnLine"},{"issue":"11","key":"1077_CR43","doi-asserted-by":"publisher","first-page":"222","DOI":"10.3390\/a12110222","volume":"12","author":"W Han","year":"2019","unstructured":"Han W, Guo F, Su X (2019) A reinforcement learning method for a hybrid flow-shop scheduling problem. Algorithms 12 (11):222","journal-title":"Algorithms"},{"key":"1077_CR44","doi-asserted-by":"crossref","unstructured":"Harbaoui H, Bellenguez-Morineau O, Khalfallah S (2016) Scheduling a two-stage hybrid flow shop with dedicated machines, time lags and sequence-dependent family setup times. In:\u00a02016 IEEE international conference on systems, man, and cybernetics (SMC), IEEE, pp 002990\u2013002995","DOI":"10.1109\/SMC.2016.7844695"},{"issue":"01","key":"1077_CR45","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S0217595907001036","volume":"24","author":"L He","year":"2007","unstructured":"He L, Sun S, Luo R (2007) A hybrid two-stage flowshop scheduling problem. Asia-Pac J Oper Res 24(01):45\u201356","journal-title":"Asia-Pac J Oper Res"},{"key":"1077_CR46","unstructured":"Herrmann JW, Lee CY (1992) Three-machine look-ahead scheduling problems. Research Report No. 92\u201393, Department of Industrial Engineering, University of Florida, Florida"},{"key":"1077_CR47","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems.\u00a0University of Michigan Press google schola,\u00a02, 29-41."},{"issue":"17","key":"1077_CR48","doi-asserted-by":"publisher","first-page":"5073","DOI":"10.1080\/00207543.2013.784418","volume":"51","author":"TC Huang","year":"2013","unstructured":"Huang TC, Lin BM (2013) Batch scheduling in differentiation flow shops for makespan minimisation. Int J Prod Res 51(17):5073\u20135082","journal-title":"Int J Prod Res"},{"issue":"3","key":"1077_CR49","doi-asserted-by":"publisher","first-page":"388","DOI":"10.32736\/sisfokom.v13i3.2290","volume":"13","author":"AA Hussein","year":"2024","unstructured":"Hussein AA (2024) Enhancing hybrid flow shop scheduling problem with a hybrid metaheuristic and machine learning approach for dynamic parameter tuning. Jurnal Sisfokom (Sistem Informasi Dan Komputer) 13(3):388\u2013395","journal-title":"Jurnal Sisfokom (Sistem Informasi Dan Komputer)"},{"key":"1077_CR50","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.cor.2018.05.016","volume":"98","author":"FJ Hwang","year":"2018","unstructured":"Hwang FJ, Lin BMT (2018) Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines. Comput Oper Res 98:103\u2013112","journal-title":"Comput Oper Res"},{"issue":"1","key":"1077_CR51","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61\u201368","journal-title":"Nav Res Logist Q"},{"key":"1077_CR53","first-page":"62","volume":"2","author":"AA Juan","year":"2015","unstructured":"Juan AA, Faulin J, Grasman SE, Rabe M, Figueira G (2015) A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Oper Res Perspect 2:62\u201372","journal-title":"Oper Res Perspect"},{"key":"1077_CR54","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.esr.2019.03.003","volume":"24","author":"I Kaya","year":"2019","unstructured":"Kaya I, Colak M, Terzi F (2019) A comprehensive review of fuzzy multi criteria decision making methodologies for energy policy making. Energy Strateg Rev 24:207\u2013228","journal-title":"Energy Strateg Rev"},{"issue":"3","key":"1077_CR55","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s10845-021-01847-3","volume":"34","author":"BM Kayhan","year":"2023","unstructured":"Kayhan BM, Yildiz G (2023) Reinforcement learning applications to machine scheduling problems: a comprehensive literature review. J Intell Manuf 34(3):905\u2013929","journal-title":"J Intell Manuf"},{"issue":"1","key":"1077_CR56","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/S0377-2217(99)00327-6","volume":"127","author":"GJ Kyparisis","year":"2000","unstructured":"Kyparisis GJ, Koulamas C (2000) Flow shop and open shop scheduling with a critical machine and two operations per job. Eur J Oper Res 127(1):120\u2013125","journal-title":"Eur J Oper Res"},{"key":"1077_CR57","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"C-Y Lee","year":"1993","unstructured":"Lee C-Y, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flow shop scheduling problem. Manage Sci 39:616\u2013625","journal-title":"Manage Sci"},{"issue":"1","key":"1077_CR58","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.ejor.2018.09.027","volume":"285","author":"A Legrain","year":"2020","unstructured":"Legrain A, Omer J, Rosat S (2020) An online stochastic algorithm for a dynamic nurse scheduling problem. Eur J Oper Res 285(1):196\u2013210","journal-title":"Eur J Oper Res"},{"key":"1077_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W, Wang Y, Qian L, Meng X, Tang L (2022) A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst Appl 205:117796","journal-title":"Expert Syst Appl"},{"issue":"7","key":"1077_CR60","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0305-0548(98)00080-X","volume":"26","author":"BM Lin","year":"1999","unstructured":"Lin BM (1999) The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine. Comput Oper Res 26(7):695\u2013698","journal-title":"Comput Oper Res"},{"issue":"4","key":"1077_CR61","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1080\/00207543.2014.944631","volume":"53","author":"BM Lin","year":"2015","unstructured":"Lin BM (2015) Two-stage flow shop scheduling with dedicated machines. Int J Prod Res 53(4):1094\u20131097","journal-title":"Int J Prod Res"},{"issue":"5","key":"1077_CR62","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ipl.2010.11.021","volume":"111","author":"BM Lin","year":"2011","unstructured":"Lin BM, Hwang FJ (2011) Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type. Inf Process Lett 111(5):208\u2013212","journal-title":"Inf Process Lett"},{"issue":"2","key":"1077_CR63","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","volume":"86","author":"HT Lin","year":"2003","unstructured":"Lin HT, Liao CJ (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86(2):133\u2013143","journal-title":"Int J Prod Econ"},{"issue":"11","key":"1077_CR64","doi-asserted-by":"publisher","first-page":"6836","DOI":"10.1109\/TSMC.2023.3287655","volume":"53","author":"CL Liu","year":"2023","unstructured":"Liu CL, Huang TH (2023) Dynamic job-shop scheduling problems using graph neural network and deep reinforcement learning. IEEE Trans Syst Man Cybern Syst 53(11):6836\u20136848","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"12","key":"1077_CR65","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1080\/0305215X.2012.737783","volume":"45","author":"YC Liu","year":"2013","unstructured":"Liu YC, Fang KT, Lin B (2013) A branch-and-bound algorithm for makespan minimization in differentiation flow shops. Eng Optim 45(12):1397\u20131408","journal-title":"Eng Optim"},{"issue":"2","key":"1077_CR66","first-page":"73","volume":"76","author":"J Magretta","year":"1998","unstructured":"Magretta J (1998) The power of virtual integration: an interview with Dell Computer\u2019s Michael Dell. Harv Bus Rev 76(2):73\u201384","journal-title":"Harv Bus Rev"},{"issue":"11-12","key":"1077_CR67","first-page":"614","volume":"20","author":"MF Morais","year":"2013","unstructured":"Morais MF, Filho MG, Boiko TJP (2013) Hybrid flow shop scheduling problems involving setup considerations: a literature review and analysis. Int J Ind Eng 20(11\u201312):614\u2013630","journal-title":"Int J Ind Eng"},{"issue":"2","key":"1077_CR68","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2009.03.018","volume":"201","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Sarig A (2010) Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine. Eur J Oper Res 201(2):404\u2013408","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1077_CR69","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0377-2217(03)00236-4","volume":"157","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov G, Yovel U (2004) Comments on \u201cFlow shop and open shop scheduling with a critical machine and two operations per job.\u201d Eur J Oper Res 157(1):257\u2013261","journal-title":"Eur J Oper Res"},{"key":"1077_CR70","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.procs.2018.07.235","volume":"126","author":"Z Nabli","year":"2018","unstructured":"Nabli Z, Khalfallah S, Korbaa O (2018) A two-stage hybrid flow shop problem with dedicated machine and release date. Procedia Comput Sci 126:214\u2013223","journal-title":"Procedia Comput Sci"},{"key":"1077_CR71","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.procs.2024.09.165","volume":"246","author":"Z Nabli","year":"2024","unstructured":"Nabli Z, Khalfallah S, Korbaa O (2024) Resolving a hybrid flow shop problem with dedicated machines: incorporating blocking and release date constraints. Procedia Comput Sci 246:10\u201319","journal-title":"Procedia Comput Sci"},{"key":"1077_CR72","doi-asserted-by":"crossref","unstructured":"Nabli Z, Korbaa O, Khalfallah S (2016) Mathematical programming formulations for hybrid flow shop scheduling with parallel machines at the first stage and two dedicated machines at the second stage. In:\u00a02016 IEEE international conference on systems, man, and cybernetics (SMC), IEEE, pp 004389\u2013004393","DOI":"10.1109\/SMC.2016.7844921"},{"key":"1077_CR73","doi-asserted-by":"crossref","unstructured":"Nabli Z, Khalfallah S, Korbaa O (2017) Heuristics for the hybrid flow shop scheduling problem with parallel machines at the first stage and two dedicated machines at the second stage. In:\u00a0Intelligent systems design and applications: 17th international conference on intelligent systems design and applications (ISDA 2017) held in Delhi, India, December 14\u201316, 2017, Springer International Publishing, pp 693\u2013701","DOI":"10.1007\/978-3-319-76348-4_67"},{"key":"1077_CR74","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld JS, Gupta JND, Buscher U (2016) A comprehensive review of flowshop group scheduling literature. Comput Oper Res 70:56\u201374","journal-title":"Comput Oper Res"},{"key":"1077_CR75","first-page":"53","volume":"31","author":"YD Neumytov","year":"1993","unstructured":"Neumytov YD, Sevastyano SV (1993) Approximation algorithm with tight bound for three-machine counter routes problem. Upravliaemye Sist 31:53\u201363","journal-title":"Upravliaemye Sist"},{"key":"1077_CR76","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-025-02585-6","author":"C Ngwu","year":"2025","unstructured":"Ngwu C, Liu Y, Wu R (2025) Reinforcement learning in dynamic job shop scheduling: a comprehensive review of AI-driven approaches in modern manufacturing. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-025-02585-6","journal-title":"J Intell Manuf"},{"issue":"12","key":"1077_CR77","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1016\/S0305-0548(97)00023-3","volume":"24","author":"C O\u01e7uz","year":"1997","unstructured":"O\u01e7uz C, Lin BM, Cheng TE (1997) Two-stage flowshop scheduling with a common second-stage machine. Comput Oper Res 24(12):1169\u20131174","journal-title":"Comput Oper Res"},{"issue":"2","key":"1077_CR78","doi-asserted-by":"publisher","first-page":"161","DOI":"10.5267\/j.ijiec.2018.10.001","volume":"10","author":"A Ouled Bedhief","year":"2019","unstructured":"Ouled Bedhief A, Dridi N (2019) Minimizing makespan in a three-stage hybrid flow shop with dedicated machines. Int J Ind Eng Comput 10(2):161\u2013176","journal-title":"Int J Ind Eng Comput"},{"key":"1077_CR79","doi-asserted-by":"publisher","DOI":"10.18280\/jesa.530306","author":"A Ouled Bedhief","year":"2020","unstructured":"Ouled Bedhief A, Dridi N (2020) A genetic algorithm for three-stage hybrid flow shop scheduling problem with dedicated machines. J Eur Syst Autom. https:\/\/doi.org\/10.18280\/jesa.530306","journal-title":"J Eur Syst Autom"},{"issue":"4","key":"1077_CR80","first-page":"373","volume":"16","author":"A Ouled Bedhief","year":"2025","unstructured":"Ouled Bedhief A, Brahmi A, Aissaoui N, Layeb SB (2025) Metaheuristics for solving the multi-stage hybrid flow shop scheduling problem with dedicated machines. Int J Adv Oper Manag 16(4):373\u2013415","journal-title":"Int J Adv Oper Manag"},{"key":"1077_CR81","unstructured":"Ouled Bedhief A, Dridi N, (2015) M\u00e9thode heuristique pour le probl\u00e8me de Flow shop hybride \u00e0 trois \u00e9tages avec machines d\u00e9di\u00e9es. In\u00a0: CIGI 2015, 11\u00e8me Congr\u00e8s International de G\u00e9nie Industriel, Qu\u00e9bec-Canada"},{"key":"1077_CR82","unstructured":"Ouled Bedhief A, Dridi N (2016) Experimental analysis of selection, crossover, and mutation operators on the hybrid flow shop with dedicated machines. In: 2nd Annual Tunisian Operational Research Society Conference, Sousse-Tunisia"},{"key":"1077_CR83","unstructured":"Ouled Bedhief A, Dridi N (2014) Flow shop hybride \u00e0 deux \u00e9tages avec machines d\u00e9di\u00e9es et dates de disponibilit\u00e9 des jobs. In\u00a0MOSIM 2014, 10\u00e8me Conf\u00e9rence Francophone de Mod\u00e9lisation, Optimisation et Simulation. Nancy-France"},{"key":"1077_CR105","doi-asserted-by":"crossref","unstructured":"Ouled Bedhief, A., & Dridi, N. (2019). Minimizing makespan in a three-stage hybrid flow shop with dedicated machines. International Journal of Industrial Engineering Computations, 10(2), 161-176.","DOI":"10.5267\/j.ijiec.2018.10.001"},{"key":"1077_CR84","doi-asserted-by":"crossref","unstructured":"Ouled Bedhief A (2021) Comparing mixed-integer programming and constraint programming models for the hybrid flow shop scheduling problem with dedicated machines.\u00a0J Eur des Syst Autom,\u00a054(4)","DOI":"10.18280\/jesa.540408"},{"key":"1077_CR85","first-page":"151","volume-title":"Modern heuristic techniques for combinatorial problems","author":"CR Reeves","year":"1993","unstructured":"Reeves CR (1993) Genetic algorithms. In: Reeves CR (ed) Modern heuristic techniques for combinatorial problems. John Wiley, New York, pp 151\u2013196"},{"issue":"2","key":"1077_CR86","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0377-2217(98)00060-5","volume":"109","author":"F Riane","year":"1998","unstructured":"Riane F, Artiba A, Elmaghraby SE (1998) A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. Eur J Oper Res 109(2):321\u2013329","journal-title":"Eur J Oper Res"},{"issue":"17","key":"1077_CR87","doi-asserted-by":"publisher","first-page":"4353","DOI":"10.1080\/00207540210159536","volume":"40","author":"F Riane","year":"2002","unstructured":"Riane F, Artiba A, Elmaghraby SE (2002) Sequencing a hybrid two-stage flowshop with dedicated machines. Int J Prod Res 40(17):4353\u20134380","journal-title":"Int J Prod Res"},{"key":"1077_CR88","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Framinan JM (2010) Review and classification of hybrid flowshop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439\u20131454","journal-title":"Comput Oper Res"},{"key":"1077_CR89","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, Vazquez-Rodriguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1\u201318","journal-title":"Eur J Oper Res"},{"key":"1077_CR90","volume-title":"Designing and managing the supply chain: concepts, strategies, and cases","author":"D Simchi-Levi","year":"1999","unstructured":"Simchi-Levi D, Kaminsky P, Simchi-Levi E (1999) Designing and managing the supply chain: concepts, strategies, and cases. McGraw-hill, New York"},{"issue":"2","key":"1077_CR91","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1111\/itor.12862","volume":"28","author":"PA Villarinho","year":"2021","unstructured":"Villarinho PA, Panadero J, Pessoa LS, Juan AA, Oliveira FLC (2021) A simheuristic algorithm for the stochastic permutation flow\u2010shop problem with delivery dates and cumulative payoffs. Int Trans Oper Res 28(2):716\u2013737","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"1077_CR92","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.cor.2012.07.015","volume":"40","author":"S Wang","year":"2013","unstructured":"Wang S, Liu M (2013) A heuristic method for two-stage hybrid flow shop with dedicated machines. Comput Oper Res 40(1):438\u2013450","journal-title":"Comput Oper Res"},{"issue":"1","key":"1077_CR93","volume":"2017","author":"L Wang","year":"2017","unstructured":"Wang L, Cai J, Li M, Liu Z (2017) Flexible job shop scheduling problem using an improved ant colony optimization. Sci Program 2017(1):9016303","journal-title":"Sci Program"},{"key":"1077_CR94","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100594","volume":"51","author":"Z Wang","year":"2019","unstructured":"Wang Z, Zhang J, Yang S (2019) An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals. Swarm Evol Comput 51:100594","journal-title":"Swarm Evol Comput"},{"key":"1077_CR95","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge university press"},{"key":"1077_CR108","doi-asserted-by":"crossref","unstructured":"Yamashiro H,  Nonaka H (2021) Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem. Oper Res Perspect 8:100196","DOI":"10.1016\/j.orp.2021.100196"},{"issue":"1","key":"1077_CR96","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.ijpe.2012.04.015","volume":"141","author":"J Xiong","year":"2013","unstructured":"Xiong J, Xing LN, Chen YW (2013) Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns. Int J Prod Econ 141(1):112\u2013126","journal-title":"Int J Prod Econ"},{"issue":"5","key":"1077_CR98","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1080\/00207540802691374","volume":"48","author":"J Yang","year":"2010","unstructured":"Yang J (2010) A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines. Int J Prod Res 48(5):1531\u20131538","journal-title":"Int J Prod Res"},{"issue":"7","key":"1077_CR99","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.cor.2010.10.009","volume":"38","author":"J Yang","year":"2011","unstructured":"Yang J (2011) Minimizing total completion time in two-stage hybrid flow shop with dedicated machines. Comput Oper Res 38(7):1045\u20131053","journal-title":"Comput Oper Res"},{"issue":"12","key":"1077_CR100","doi-asserted-by":"publisher","first-page":"2836","DOI":"10.1016\/j.cor.2013.05.020","volume":"40","author":"J Yang","year":"2013","unstructured":"Yang J (2013) A two-stage hybrid flow shop with dedicated machines at the first stage. Comput Oper Res 40(12):2836\u20132843","journal-title":"Comput Oper Res"},{"key":"1077_CR101","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2014.11.012","volume":"58","author":"J Yang","year":"2015","unstructured":"Yang J (2015a) Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage. Comput Oper Res 58:1\u20138","journal-title":"Comput Oper Res"},{"issue":"1","key":"1077_CR102","first-page":"22","volume":"14","author":"J Yang","year":"2015","unstructured":"Yang J (2015b) Hybrid flow shop with parallel machines at the first stage and dedicated machines at the second stage. Ind Eng Manag Syst 14(1):22\u201331","journal-title":"Ind Eng Manag Syst"},{"issue":"7","key":"1077_CR103","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12652-021-03602-1","volume":"14","author":"RA Zitar","year":"2023","unstructured":"Zitar RA, Abualigah L, Al-Dmour NA (2023) Review and analysis for the red deer algorithm. J Ambient Intell Humanized Comput 14(7):1\u201311","journal-title":"J Ambient Intell Humanized Comput"},{"key":"1077_CR104","doi-asserted-by":"crossref","unstructured":"Yang J (2011) Minimizing total completion time in two-stage hybrid flow shop with dedicated machines. Comput Oper Res 38(7):1045\u20131053","DOI":"10.1016\/j.cor.2010.10.009"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01077-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:01:41Z","timestamp":1784991701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01077-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,25]]},"references-count":99,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["1077"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01077-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,25]]},"assertion":[{"value":"29 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Authors declare that they have no competing interests.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"97"}}