{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:45:47Z","timestamp":1773931547130,"version":"3.50.1"},"reference-count":141,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00500-023-09086-9","type":"journal-article","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T15:40:01Z","timestamp":1693496401000},"page":"18623-18650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Constraint programming models for the hybrid flow shop scheduling problem and its extensions"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9180-0243","authenticated-orcid":false,"given":"Ey\u00fcp Ensar","family":"I\u015f\u0131k","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6827-126X","authenticated-orcid":false,"given":"Seyda","family":"Topaloglu Yildiz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4112-2533","authenticated-orcid":false,"given":"\u00d6zge","family":"\u015eat\u0131r Akpunar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"issue":"3","key":"9086_CR1","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Soroush HM (2008) The significance of reducing setup times\/setup costs. Eur J Oper Res 187(3):978\u2013984. https:\/\/doi.org\/10.1016\/j.ejor.2006.09.010","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9086_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.060","journal-title":"Eur J Oper Res"},{"key":"9086_CR3","doi-asserted-by":"publisher","first-page":"113716","DOI":"10.1016\/j.eswa.2020.113716","volume":"162","author":"S Aqil","year":"2020","unstructured":"Aqil S, Allali K (2020) Local search metaheuristic for solving hybrid flow shop problem in slabs and beams manufacturing. Expert Syst Appl 162:113716. https:\/\/doi.org\/10.1016\/j.eswa.2020.113716","journal-title":"Expert Syst Appl"},{"key":"9086_CR4","doi-asserted-by":"publisher","first-page":"104196","DOI":"10.1016\/j.engappai.2021.104196","volume":"100","author":"S Aqil","year":"2021","unstructured":"Aqil S, Allali K (2021) Two efficient nature inspired meta-heuristics solving blocking hybrid flow shop manufacturing problem. Eng Appl Artif Intell 100:104196. https:\/\/doi.org\/10.1016\/j.engappai.2021.104196","journal-title":"Eng Appl Artif Intell"},{"key":"9086_CR5","first-page":"10","volume":"8","author":"TS Arthanari","year":"1971","unstructured":"Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8:10\u201322","journal-title":"Opsearch"},{"issue":"5\u20138","key":"9086_CR6","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"Asefi H, Jolai F, Rabiee M, Tayebi Araghi ME (2014) A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. Int J Adv Manuf Technol 75(5\u20138):1017\u20131033","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"9086_CR7","first-page":"113","volume":"12","author":"S Brah","year":"1991","unstructured":"Brah S, Hunsucker J, Shah J (1991) Mathematical modeling of scheduling problems. J Inf Optim Sci 12(1):113\u2013137","journal-title":"J Inf Optim Sci"},{"issue":"18","key":"9086_CR8","doi-asserted-by":"publisher","first-page":"5592","DOI":"10.1080\/00207543.2020.1788732","volume":"59","author":"C Cao","year":"2020","unstructured":"Cao C, Zhang Y, Gu X, Li D, Li J (2020) An improved gravitational search algorithm to the hybrid flowshop with unrelated parallel machines scheduling problem. Int J Prod Res 59(18):5592\u20135608. https:\/\/doi.org\/10.1080\/00207543.2020.1788732","journal-title":"Int J Prod Res"},{"issue":"1","key":"9086_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2000103","volume":"34","author":"J Carlier","year":"2000","unstructured":"Carlier J, Neron E (2000) An exact method for solving the multi-processor flow-shop. RAIRO Oper Res Recherche Op\u00e9rationnelle 34(1):1\u201325","journal-title":"RAIRO Oper Res Recherche Op\u00e9rationnelle"},{"issue":"3","key":"9086_CR10","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.cor.2011.05.020","volume":"39","author":"S Carpov","year":"2012","unstructured":"Carpov S, Carlier J, Nace D, Sirdey R (2012) Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. Comput Oper Res 39(3):736\u2013745. https:\/\/doi.org\/10.1016\/j.cor.2011.05.020","journal-title":"Comput Oper Res"},{"key":"9086_CR11","doi-asserted-by":"publisher","unstructured":"Chang J, Ma G, Ma X (2006) A new heuristic for minimal makespan in no-wait hybrid flowshops. In: Chinese control conference, Harbin, China, pp 1352\u20131356. https:\/\/doi.org\/10.1109\/CHICC.2006.280673","DOI":"10.1109\/CHICC.2006.280673"},{"issue":"2","key":"9086_CR12","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1631\/jzus.2006.A0234","volume":"7","author":"L Chen","year":"2006","unstructured":"Chen L, Xi LF, Cai JG, Bostel N, Dejax P (2006) Integrated approach for modeling and solving the scheduling problem of container handling systems. J Zhejiang Univ Sci 7(2):234\u2013239","journal-title":"J Zhejiang Univ Sci"},{"issue":"1","key":"9086_CR13","doi-asserted-by":"crossref","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":"4","key":"9086_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1111\/j.1937-5956.2000.tb00464.x","volume":"9","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Sriskandarajah C, Wang G (2000) Two- and three-stage flowshop scheduling with no-wait in process. Prod Oper Manag 9(4):367\u2013378","journal-title":"Prod Oper Manag"},{"key":"9086_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.5267\/j.ijiec.2021.12.001","volume":"13","author":"M \u00c7olak","year":"2022","unstructured":"\u00c7olak M, Ayd\u0131n Keskin G (2022) An extensive and systematic literature review for hybrid flowshop scheduling problems. Int J Ind Eng Comput 13:185\u2013222. https:\/\/doi.org\/10.5267\/j.ijiec.2021.12.001","journal-title":"Int J Ind Eng Comput"},{"issue":"5","key":"9086_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.13374\/j.issn1001-053x.2005.05.058","volume":"27","author":"J Cui","year":"2005","unstructured":"Cui J, Li T, Zhang W (2005) Hybrid flowshop scheduling model and its genetic algorithm. [In Chinese]. J Univ Sci Technol Beijing 27(5):623\u2013626. https:\/\/doi.org\/10.13374\/j.issn1001-053x.2005.05.058","journal-title":"J Univ Sci Technol Beijing"},{"issue":"7\u20138","key":"9086_CR17","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00170-008-1887-5","volume":"44","author":"H Davoudpour","year":"2009","unstructured":"Davoudpour H, Ashrafi M (2009) Solving multi-objective SDST flexible flow shop using GRASP algorithm. Int J Adv Manuf Technol 44(7\u20138):737\u2013747","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"9086_CR18","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1111\/itor.12662","volume":"27","author":"EC de Siqueira","year":"2020","unstructured":"de Siqueira EC, Souza MJF, de Souza SR (2020) An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem. Int Trans Oper Res 27(1):614\u2013650","journal-title":"Int Trans Oper Res"},{"issue":"9\u201310","key":"9086_CR19","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1016\/j.apm.2013.10.061","volume":"38","author":"M Ebrahimi","year":"2014","unstructured":"Ebrahimi M, Fatemi Ghomi SMT, Karimi B (2014) Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl Math Model 38(9\u201310):2490\u20132504. https:\/\/doi.org\/10.1016\/j.apm.2013.10.061","journal-title":"Appl Math Model"},{"issue":"10","key":"9086_CR20","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1016\/j.cor.2013.01.024","volume":"40","author":"A Elmi","year":"2013","unstructured":"Elmi A, Topaloglu S (2013) A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. Comput Oper Res 40(10):2543\u20132555. https:\/\/doi.org\/10.1016\/j.cor.2013.01.024","journal-title":"Comput Oper Res"},{"issue":"12","key":"9086_CR21","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1080\/0951192X.2013.874576","volume":"27","author":"A Elmi","year":"2014","unstructured":"Elmi A, Topaloglu S (2014) Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot. Int J Comput Integr Manuf 27(12):1144\u20131159. https:\/\/doi.org\/10.1080\/0951192X.2013.874576","journal-title":"Int J Comput Integr Manuf"},{"issue":"1","key":"9086_CR22","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L Fanjul-Peyro","year":"2010","unstructured":"Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55\u201369. https:\/\/doi.org\/10.1016\/j.ejor.2010.03.030","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9086_CR23","first-page":"62","volume":"226","author":"F Fereidoonian","year":"2012","unstructured":"Fereidoonian F, Mirzazadeh A (2012) A genetic algorithm for the integrated scheduling model of a container-handling system in a maritime terminal. Proc Inst Mech Eng Part M J Eng Marit Environ 226(1):62\u201377","journal-title":"Proc Inst Mech Eng Part M J Eng Marit Environ"},{"key":"9086_CR24","doi-asserted-by":"publisher","first-page":"113462","DOI":"10.1016\/j.eswa.2020.113462","volume":"153","author":"V Fernandez-Viagas","year":"2020","unstructured":"Fernandez-Viagas V, Costa A, Framinan JM (2020) Hybrid flow shop with multiple servers: a computational evaluation and efficient divide-and-conquer heuristics. Expert Syst Appl 153:113462. https:\/\/doi.org\/10.1016\/j.eswa.2020.113462","journal-title":"Expert Syst Appl"},{"issue":"6","key":"9086_CR25","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/21681015.2019.1647299","volume":"36","author":"EA Garavito-Hern\u00e1ndez","year":"2019","unstructured":"Garavito-Hern\u00e1ndez EA, Pe\u00f1a-Tibaduiza E, Perez-Figueredo LE, Moratto-Chimenty E (2019) A meta-heuristic based on the Imperialist Competitive Algorithm (ICA) for solving Hybrid Flow Shop (HFS) scheduling problem with unrelated parallel machines. J Ind Prod Eng 36(6):362\u2013370. https:\/\/doi.org\/10.1080\/21681015.2019.1647299","journal-title":"J Ind Prod Eng"},{"key":"9086_CR26","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.cie.2017.03.017","volume":"107","author":"R Gedik","year":"2017","unstructured":"Gedik R, Kirac E, Bennet Milburn A, Rainwater C (2017) A constraint programming approach for the team orienteering problem with time windows. Comput Ind Eng 107:178\u2013195. https:\/\/doi.org\/10.1016\/j.cie.2017.03.017","journal-title":"Comput Ind Eng"},{"key":"9086_CR27","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.matcom.2020.08.019","volume":"180","author":"E Gheisariha","year":"2021","unstructured":"Gheisariha E, Tavana M, Jolai F, Rabiee M (2021) A simulation\u2013optimization model for solving flexible flow shop scheduling problems with rework and transportation. Math Comput Simul 180:152\u2013177. https:\/\/doi.org\/10.1016\/j.matcom.2020.08.019","journal-title":"Math Comput Simul"},{"issue":"1\u20132","key":"9086_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s00170-008-1577-3","volume":"42","author":"M Gholami","year":"2009","unstructured":"Gholami M, Zandieh M, Alem-Tabriz A (2009) Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Adv Manuf Technol 42(1\u20132):189\u2013201","journal-title":"Int J Adv Manuf Technol"},{"key":"9086_CR29","doi-asserted-by":"publisher","DOI":"10.3390\/app12189332","author":"CB Gil","year":"2022","unstructured":"Gil CB, Lee JH (2022) Deep reinforcement learning approach for material scheduling considering high-dimensional environment of hybrid flow-shop problem. Appl Sci. https:\/\/doi.org\/10.3390\/app12189332","journal-title":"Appl Sci"},{"issue":"9","key":"9086_CR30","doi-asserted-by":"crossref","first-page":"8095","DOI":"10.1016\/j.eswa.2012.01.158","volume":"39","author":"P G\u00f3mez-Gasquet","year":"2012","unstructured":"G\u00f3mez-Gasquet P, Andr\u00e9s C, Lario FC (2012) An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan. Expert Syst Appl 39(9):8095\u20138107","journal-title":"Expert Syst Appl"},{"issue":"3","key":"9086_CR31","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125(3):535\u2013550","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9086_CR32","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359\u20133641","journal-title":"J Oper Res Soc"},{"key":"9086_CR33","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cie.2016.11.001","volume":"102","author":"AM Ham","year":"2016","unstructured":"Ham AM, Cakici E (2016) Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches. Comput Ind Eng 102:160\u2013165. https:\/\/doi.org\/10.1016\/j.cie.2016.11.001","journal-title":"Comput Ind Eng"},{"issue":"11","key":"9086_CR34","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. https:\/\/doi.org\/10.3390\/a12110222","journal-title":"Algorithms"},{"issue":"1","key":"9086_CR35","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00186-006-0066-4","volume":"64","author":"M Haouari","year":"2006","unstructured":"Haouari M, Hidri L, Gharbi A (2006) Optimal scheduling of a two-stage hybrid flow shop. Math Methods Oper Res 64(1):107\u2013124","journal-title":"Math Methods Oper Res"},{"key":"9086_CR36","doi-asserted-by":"publisher","unstructured":"Harbaoui H, Khalfallah S, Bellenguez-Morineau O (2017) A case study of a hybrid flow shop with no-wait and limited idle time to minimize material waste. In: IEEE 15th international symposium on intelligent systems and informatics (SISY), Subotica, Serbia, pp 207\u2013212. https:\/\/doi.org\/10.1109\/SISY.2017.8080554","DOI":"10.1109\/SISY.2017.8080554"},{"issue":"9\u201310","key":"9086_CR37","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1007\/s00170-008-1865-y","volume":"44","author":"RH Huang","year":"2009","unstructured":"Huang RH, Yang CL, Huang YC (2009) No-wait two-stage multiprocessor flow shop scheduling with unit setup. Int J Adv Manuf Technol 44(9\u201310):921\u2013927","journal-title":"Int J Adv Manuf Technol"},{"key":"9086_CR38","unstructured":"IBM (2017) IBM ILOG CPLEX optimization studio CP optimizer user\u2019s manual, 12th edn. IBM"},{"issue":"1\u20134","key":"9086_CR39","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00170-012-3911-z","volume":"63","author":"N Javadian","year":"2012","unstructured":"Javadian N, Fattahi P, Farahmand-Mehr M, Amiri-Aref M, Kazemi M (2012) An immune algorithm for hybrid flow shop scheduling problem with time lags and sequence-dependent setup times. Int J Adv Manuf Technol 63(1\u20134):337\u2013348","journal-title":"Int J Adv Manuf Technol"},{"issue":"5\u20136","key":"9086_CR40","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00170-008-1618-y","volume":"42","author":"F Jolai","year":"2009","unstructured":"Jolai F, Sheikh S, Rabbani M, Karimi B (2009) A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. Int J Adv Manuf Technol 42(5\u20136):523\u2013532","journal-title":"Int J Adv Manuf Technol"},{"issue":"24","key":"9086_CR41","doi-asserted-by":"crossref","first-page":"7447","DOI":"10.1080\/00207543.2011.653012","volume":"50","author":"F Jolai","year":"2012","unstructured":"Jolai F, Rabiee M, Asefi H (2012) A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times. Int J Prod Res 50(24):7447\u20137466","journal-title":"Int J Prod Res"},{"issue":"3\u20134","key":"9086_CR42","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/s00170-007-0977-0","volume":"37","author":"J Jungwattanakit","year":"2008","unstructured":"Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2008) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37(3\u20134):354\u2013370","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"9086_CR43","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.cor.2007.10.004","volume":"36","author":"J Jungwattanakit","year":"2009","unstructured":"Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2009) A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Comput Oper Res 36(2):358\u2013378","journal-title":"Comput Oper Res"},{"key":"9086_CR44","unstructured":"Kanet JJ, Ahire SL, Gorman MF (2004) Constraint programming for scheduling. In: Handbook of scheduling: algorithms, models, and performance analysis. University of Dayton MIS\/OM\/DS Faculty Publications Department, pp 1\u201322. http:\/\/ecommons.udayton.edu\/mis_fac_pub\/1"},{"issue":"16","key":"9086_CR45","doi-asserted-by":"crossref","first-page":"4965","DOI":"10.1080\/00207543.2010.481644","volume":"49","author":"N Karimi","year":"2011","unstructured":"Karimi N, Zandieh M, Najafi AA (2011) Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism. Int J Prod Res 49(16):4965\u20134977","journal-title":"Int J Prod Res"},{"issue":"4","key":"9086_CR46","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1243\/09544054JEM1318","volume":"223","author":"HW Kim","year":"2009","unstructured":"Kim HW, Lee DH (2009) Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines. Proc Inst Mech Eng Part B J Eng Manuf 223(4):433\u2013442","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"issue":"2","key":"9086_CR47","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2017.10.014","volume":"266","author":"S Kreter","year":"2018","unstructured":"Kreter S, Schutt A, Stuckey PJ, Zimmermann J (2018) Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems. Eur J Oper Res 266(2):472\u2013486. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.014","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9086_CR48","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"ME Kurz","year":"2004","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159(1):66\u201382","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9086_CR49","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie P, Rogerie J, Shaw P, Vil\u00edm P (2018) IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM\/ILOG. Constraints 23(2):210\u2013250","journal-title":"Constraints"},{"key":"9086_CR50","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.asoc.2017.07.058","volume":"61","author":"D Lei","year":"2017","unstructured":"Lei D, Zheng Y (2017) Hybrid flow shop scheduling with assembly operations and key objectives: a novel neighborhood search. Appl Soft Comput J 61:122\u2013128. https:\/\/doi.org\/10.1016\/j.asoc.2017.07.058","journal-title":"Appl Soft Comput J"},{"issue":"2","key":"9086_CR51","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TEM.2017.2774281","volume":"65","author":"D Lei","year":"2018","unstructured":"Lei D, Gao L, Zheng Y (2018) A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybrid flow shop. IEEE Trans Eng Manag 65(2):330\u2013340","journal-title":"IEEE Trans Eng Manag"},{"key":"9086_CR52","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","volume":"316","author":"JQ Li","year":"2015","unstructured":"Li JQ, Pan QK (2015) Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inf Sci\u00a0(NY) 316:487\u2013502. https:\/\/doi.org\/10.1016\/j.ins.2014.10.009","journal-title":"Inf Sci\u00a0(NY)"},{"issue":"1\u20132","key":"9086_CR53","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/00207543.2018.1437288","volume":"56","author":"L Lin","year":"2018","unstructured":"Lin L, Gen M (2018) Hybrid evolutionary optimisation with learning for production scheduling: state-of-the-art survey on algorithms and applications. Int J Prod Res 56(1\u20132):193\u2013223. https:\/\/doi.org\/10.1080\/00207543.2018.1437288","journal-title":"Int J Prod Res"},{"issue":"2","key":"9086_CR54","doi-asserted-by":"crossref","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":"1\u20134","key":"9086_CR55","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00170-013-4766-7","volume":"67","author":"CW Lin","year":"2013","unstructured":"Lin CW, Lin YK, Hsieh HT (2013) Ant colony optimization for unrelated parallel machine scheduling. Int J Adv Manuf Technol 67(1\u20134):35\u201345","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"9086_CR56","first-page":"43","volume":"8","author":"Z Liu","year":"2003","unstructured":"Liu Z, Xie J, Li J, Dong J (2003) Heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage. Tsinghua Sci Technol 8(1):43\u201348","journal-title":"Tsinghua Sci Technol"},{"issue":"5","key":"9086_CR57","first-page":"5160","volume":"53","author":"H Liu","year":"2023","unstructured":"Liu H, Zhao F, Wang L, Cao J, Tang J, Jonrinaldi J (2023) An estimation of distribution algorithm with multiple intensification strategies for two-stage hybrid flow-shop scheduling problem with sequence-dependent setup time. Appl Intell 53(5):5160\u20135178","journal-title":"Appl Intell"},{"issue":"8","key":"9086_CR58","doi-asserted-by":"crossref","first-page":"2013","DOI":"10.1016\/j.cor.2004.01.003","volume":"32","author":"C Low","year":"2005","unstructured":"Low C (2005) Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput Oper Res 32(8):2013\u20132025","journal-title":"Comput Oper Res"},{"issue":"6","key":"9086_CR59","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1287\/inte.31.7.29.9647","volume":"31","author":"IJ Lustig","year":"2001","unstructured":"Lustig IJ, Puget J-F (2001) Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces\u00a0(providence) 31(6):29\u201353. https:\/\/doi.org\/10.1287\/inte.31.7.29.9647","journal-title":"Interfaces\u00a0(providence)"},{"issue":"4","key":"9086_CR60","doi-asserted-by":"publisher","first-page":"201","DOI":"10.5267\/j.jpm.2022.5.002","volume":"7","author":"ISF Maciel","year":"2022","unstructured":"Maciel ISF, de Athayde Prata B, Nagano MS, de Abreu LR (2022) A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times. J Proj Manag 7(4):201\u2013216. https:\/\/doi.org\/10.5267\/j.jpm.2022.5.002","journal-title":"J Proj Manag"},{"issue":"2","key":"9086_CR61","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0166-218X(96)00087-X","volume":"75","author":"S Martello","year":"1997","unstructured":"Martello S, Soumis F, Toth P (1997) Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discret Appl Math 75(2):169\u2013188","journal-title":"Discret Appl Math"},{"issue":"4","key":"9086_CR62","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1080\/00207543.2018.1501166","volume":"57","author":"L Meng","year":"2019","unstructured":"Meng L, Zhang C, Shao X, Ren Y, Ren C (2019) Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines. Int J Prod Res 57(4):1119\u20131145","journal-title":"Int J Prod Res"},{"issue":"2020","key":"9086_CR63","doi-asserted-by":"publisher","first-page":"106347","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","unstructured":"Meng L, Zhang C, Ren Y, Zhang B, Lv C (2020a) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng 142(2020):106347. https:\/\/doi.org\/10.1016\/j.cie.2020.106347","journal-title":"Comput Ind Eng"},{"issue":"13","key":"9086_CR64","doi-asserted-by":"crossref","first-page":"3905","DOI":"10.1080\/00207543.2019.1636324","volume":"58","author":"L Meng","year":"2020","unstructured":"Meng L, Zhang C, Shao X, Zhang B, Ren Y, Lin W (2020b) More MILP models for hybrid flow shop scheduling problem and its extended problems. Int J Prod Res 58(13):3905\u20133930","journal-title":"Int J Prod Res"},{"issue":"2","key":"9086_CR65","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1049\/cim2.12005","volume":"3","author":"L Meng","year":"2021","unstructured":"Meng L, Lu C, Zhang B, Ren Y, Lv C, Sang H, Li J, Zhang C (2021) Constraint programming for solving four complex flexible shop scheduling problems. IET Collab Intell Manuf 3(2):147\u2013160","journal-title":"IET Collab Intell Manuf"},{"issue":"2022","key":"9086_CR66","doi-asserted-by":"publisher","first-page":"101058","DOI":"10.1016\/j.swevo.2022.101058","volume":"71","author":"L Meng","year":"2022","unstructured":"Meng L, Gao K, Ren Y, Zhang B, Sang H, Chaoyong Z (2022) Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 71(2022):101058. https:\/\/doi.org\/10.1016\/j.swevo.2022.101058","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"9086_CR67","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejor.2022.02.019","volume":"303","author":"A Missaoui","year":"2022","unstructured":"Missaoui A, Ruiz R (2022) A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows. Eur J Oper Res 303(1):99\u2013113. https:\/\/doi.org\/10.1016\/j.ejor.2022.02.019","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9086_CR68","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1051\/ro\/2021076","volume":"55","author":"A Missaoui","year":"2021","unstructured":"Missaoui A, Boujelbene Y (2021) An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window. RAIRO Oper Res 55(3):1603\u20131616","journal-title":"RAIRO Oper Res"},{"issue":"2","key":"9086_CR69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40430-018-0980-4","volume":"40","author":"JV Moccellin","year":"2018","unstructured":"Moccellin JV, Nagano MS, Pitombeira Neto AR, de Athayde Prata B (2018) Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. J Braz Soc Mech Sci Eng 40(2):1\u201311","journal-title":"J Braz Soc Mech Sci Eng"},{"issue":"2","key":"9086_CR70","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1080\/17509653.2018.1505565","volume":"14","author":"A Mollaei","year":"2019","unstructured":"Mollaei A, Mohammadi M, Naderi B (2019) A bi-objective MILP model for blocking hybrid flexible flow shop scheduling problem: robust possibilistic programming approach. Int J Manag Sci Eng Manag 14(2):137\u2013146. https:\/\/doi.org\/10.1080\/17509653.2018.1505565","journal-title":"Int J Manag Sci Eng Manag"},{"issue":"2","key":"9086_CR71","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/0952813X.2012.682752","volume":"25","author":"N Moradinasab","year":"2013","unstructured":"Moradinasab N, Shafaei R, Rabiee M, Ramezani P (2013) No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms. J Exp Theor Artif Intell 25(2):207\u2013225","journal-title":"J Exp Theor Artif Intell"},{"issue":"1\u20134","key":"9086_CR72","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00170-010-2930-x","volume":"54","author":"SM Mousavi","year":"2011","unstructured":"Mousavi SM, Zandieh M, Amiri M (2011) An efficient bi-objective heuristic for scheduling of hybrid flow shops. Int J Adv Manuf Technol 54(1\u20134):287\u2013307","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"9086_CR73","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.jmsy.2014.06.002","volume":"33","author":"B Naderi","year":"2014","unstructured":"Naderi B, Yazdani M (2014) A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times. J Manuf Syst 33(4):647\u2013653. https:\/\/doi.org\/10.1016\/j.jmsy.2014.06.002","journal-title":"J Manuf Syst"},{"issue":"6","key":"9086_CR74","doi-asserted-by":"publisher","first-page":"9625","DOI":"10.1016\/j.eswa.2008.09.063","volume":"36","author":"B Naderi","year":"2009","unstructured":"Naderi B, Zandieh M, Khaleghi Ghoshe Balagh A, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36(6):9625\u20139633. https:\/\/doi.org\/10.1016\/j.eswa.2008.09.063","journal-title":"Expert Syst Appl"},{"issue":"24","key":"9086_CR75","doi-asserted-by":"publisher","first-page":"5767","DOI":"10.1016\/j.apm.2014.04.012","volume":"38","author":"B Naderi","year":"2014","unstructured":"Naderi B, Gohari S, Yazdani M (2014) Hybrid flexible flowshop problems: models and solution methods. Appl Math Model 38(24):5767\u20135780. https:\/\/doi.org\/10.1016\/j.apm.2014.04.012","journal-title":"Appl Math Model"},{"key":"9086_CR76","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2023.1287","author":"B Naderi","year":"2023","unstructured":"Naderi B, Ruiz R, Roshanaei V (2023) Mixed-integer programming versus constraint programming for shop scheduling problems: new results and outlook. INFORMS J Comput. https:\/\/doi.org\/10.1287\/ijoc.2023.1287","journal-title":"INFORMS J Comput"},{"issue":"6","key":"9086_CR77","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0305-0483(01)00040-8","volume":"29","author":"E N\u00e9ron","year":"2001","unstructured":"N\u00e9ron E, Baptiste P, Gupta JND (2001) Solving hybrid flow shop problem using energetic reasoning and global operations. Omega 29(6):501\u2013511","journal-title":"Omega"},{"issue":"1","key":"9086_CR78","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.ifacol.2021.08.207","volume":"54","author":"S Oujana","year":"2021","unstructured":"Oujana S, Yalaoui F, Amodeo L (2021) A linear programming approach for hybrid flexible flow shop with sequence-dependent setup times to minimise total tardiness. IFAC-PapersOnLine 54(1):1162\u20131167. https:\/\/doi.org\/10.1016\/j.ifacol.2021.08.207","journal-title":"IFAC-PapersOnLine"},{"issue":"10","key":"9086_CR79","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/app13106003","volume":"13","author":"S Oujana","year":"2023","unstructured":"Oujana S, Amodeo L, Yalaoui F, Brodart D (2023) Mixed-integer linear programming, constraint programming and a novel dedicated heuristic for production scheduling in a packaging plant. Appl Sci 13(10):1\u201321. https:\/\/doi.org\/10.3390\/app13106003","journal-title":"Appl Sci"},{"key":"9086_CR80","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.cor.2019.06.009","volume":"111","author":"H Oztop","year":"2019","unstructured":"Oztop H, Fatih Tasgetiren M, Eliiyi DT, Pan QK (2019) Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput Oper Res 111:177\u2013196","journal-title":"Comput Oper Res"},{"issue":"2","key":"9086_CR81","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"QK Pan","year":"2013","unstructured":"Pan QK, Wang L, Mao K, Zhao JH, Zhang M (2013) An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans Autom Sci Eng 10(2):307\u2013322","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"9086_CR82","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","volume":"303","author":"QK Pan","year":"2017","unstructured":"Pan QK, Gao L, Li XY, Gao KZ (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112. https:\/\/doi.org\/10.1016\/j.amc.2017.01.004","journal-title":"Appl Math Comput"},{"issue":"10","key":"9086_CR83","doi-asserted-by":"crossref","first-page":"2609","DOI":"10.1080\/00207543.2010.546380","volume":"50","author":"F Pargar","year":"2012","unstructured":"Pargar F, Zandieh M (2012) Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach. Int J Prod Res 50(10):2609\u20132623","journal-title":"Int J Prod Res"},{"key":"9086_CR84","unstructured":"Pessoa R, Maciel I, Moccellin J, Pitombeira-Neto A, Prata B (2019) Hybrid flow shop scheduling problem with machine blocking, setup times and unrelated parallel machines per stage. Investig Oper"},{"issue":"9","key":"9086_CR85","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0895-7177(96)00150-1","volume":"24","author":"N Piersma","year":"1996","unstructured":"Piersma N, Van Dijk W (1996) A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Math Comput Model 24(9):11\u201319","journal-title":"Math Comput Model"},{"issue":"4","key":"9086_CR86","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s10845-015-1144-3","volume":"29","author":"W Qin","year":"2018","unstructured":"Qin W, Zhang J, Song D (2018) An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. J Intell Manuf 29(4):891\u2013904","journal-title":"J Intell Manuf"},{"key":"9086_CR87","doi-asserted-by":"publisher","first-page":"106115","DOI":"10.1016\/j.cie.2019.106115","volume":"138","author":"W Qin","year":"2019","unstructured":"Qin W, Zhuang Z, Liu Y, Tang O (2019) A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Comput Ind Eng 138:106115. https:\/\/doi.org\/10.1016\/j.cie.2019.106115","journal-title":"Comput Ind Eng"},{"issue":"3","key":"9086_CR88","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.ejor.2020.02.021","volume":"285","author":"T Qin","year":"2020","unstructured":"Qin T, Du Y, Chen JH, Sha M (2020) Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel. Eur J Oper Res 285(3):884\u2013901","journal-title":"Eur J Oper Res"},{"issue":"5\u20138","key":"9086_CR89","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s00170-013-5375-1","volume":"71","author":"M Rabiee","year":"2014","unstructured":"Rabiee M, Sadeghi Rad R, Mazinani M, Shafaei R (2014) An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. Int J Adv Manuf Technol 71(5\u20138):1229\u20131245","journal-title":"Int J Adv Manuf Technol"},{"issue":"9","key":"9086_CR90","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1080\/0951192X.2015.1130256","volume":"29","author":"M Rabiee","year":"2016","unstructured":"Rabiee M, Jolai F, Asefi H, Fattahi P, Lim S (2016) A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness. Int J Comput Integr Manuf 29(9):1007\u20131024. https:\/\/doi.org\/10.1080\/0951192X.2015.1130256","journal-title":"Int J Comput Integr Manuf"},{"issue":"4","key":"9086_CR91","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10845-013-0830-2","volume":"26","author":"P Ramezani","year":"2015","unstructured":"Ramezani P, Rabiee M, Jolai F (2015) No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach. J Intell Manuf 26(4):731\u2013744. https:\/\/doi.org\/10.1007\/s10845-013-0830-2","journal-title":"J Intell Manuf"},{"issue":"9\u201312","key":"9086_CR92","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s00170-009-2475-z","volume":"49","author":"E Rashidi","year":"2010","unstructured":"Rashidi E, Jahandar M, Zandieh M (2010) An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int J Adv Manuf Technol 49(9\u201312):1129\u20131139","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"9086_CR93","doi-asserted-by":"publisher","first-page":"798","DOI":"10.3182\/20090603-3-RU-2001.0239","volume":"42","author":"N Rezaie","year":"2009","unstructured":"Rezaie N, Tavakkoli-Moghaddam R, Torabi SA (2009) A new mathematical model for fuzzy flexible flow shop scheduling of unrelated parallel machines maximizing the weighted satisfaction level. IFAC 42(4):798\u2013803. https:\/\/doi.org\/10.3182\/20090603-3-RU-2001.0239","journal-title":"IFAC"},{"issue":"8","key":"9086_CR94","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas I, Leisten R, Frami\u00f1an JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37(8):1439\u20131454","journal-title":"Comput Oper Res"},{"issue":"3","key":"9086_CR95","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R Ruiz","year":"2006","unstructured":"Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169(3):781\u2013800","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9086_CR96","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, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1\u201318. https:\/\/doi.org\/10.1016\/j.ejor.2009.09.024","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9086_CR97","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1016\/j.cor.2006.07.014","volume":"35","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, \u015eerifo\u01e7lu FS, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35(4):1151\u20131175","journal-title":"Comput Oper Res"},{"issue":"4\u20135","key":"9086_CR98","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0895-7177(02)00176-0","volume":"36","author":"T Sawik","year":"2002","unstructured":"Sawik T (2002) An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Math Comput Model 36(4\u20135):461\u2013471","journal-title":"Math Comput Model"},{"key":"9086_CR99","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ijpe.2016.06.005","volume":"179","author":"O Shahvari","year":"2016","unstructured":"Shahvari O, Logendran R (2016) Hybrid flow shop batching and scheduling with a bi-criteria objective. Int J Prod Econ 179:239\u2013258. https:\/\/doi.org\/10.1016\/j.ijpe.2016.06.005","journal-title":"Int J Prod Econ"},{"key":"9086_CR100","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ijpe.2017.10.015","volume":"195","author":"O Shahvari","year":"2018","unstructured":"Shahvari O, Logendran R (2018) A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. Int J Prod Econ 195:227\u2013248. https:\/\/doi.org\/10.1016\/j.ijpe.2017.10.015","journal-title":"Int J Prod Econ"},{"key":"9086_CR101","doi-asserted-by":"publisher","first-page":"105527","DOI":"10.1016\/j.knosys.2020.105527","volume":"194","author":"W Shao","year":"2020","unstructured":"Shao W, Shao Z, Pi D (2020) Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowl Based Syst 194:105527. https:\/\/doi.org\/10.1016\/j.knosys.2020.105527","journal-title":"Knowl Based Syst"},{"issue":"1","key":"9086_CR102","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1080\/09537289008919291","volume":"1","author":"HD Sherali","year":"1990","unstructured":"Sherali HD, Sarin SC, Kodialam MS (1990) Models and algorithms for a two-stage production process. Prod Plan Control 1(1):2","journal-title":"Prod Plan Control"},{"issue":"3","key":"9086_CR103","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0377-2217(93)90248-L","volume":"70","author":"C Sriskandarajah","year":"1993","unstructured":"Sriskandarajah C (1993) Performance of scheduling algorithms for no-wait flowshops with parallel machines. Eur J Oper Res 70(3):365\u2013378","journal-title":"Eur J Oper Res"},{"key":"9086_CR104","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/11427391_126","volume-title":"Advances in neural networks\u2014ISNN 2005. Lecture notes in computer science","author":"L Tang","year":"2005","unstructured":"Tang L, Zhang Y (2005) Heuristic combined artificial neural networks to schedule hybrid flow shop with sequence dependent setup times. In: Wang J, Liao X, Yi Z (eds) Advances in neural networks\u2014ISNN 2005. Lecture notes in computer science, vol 3496. Springer, Berlin, Heidelberg, pp 788\u2013793. https:\/\/doi.org\/10.1007\/11427391_126"},{"issue":"3","key":"9086_CR105","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1057\/palgrave.jors.2602033","volume":"57","author":"L Tang","year":"2006","unstructured":"Tang L, Xuan H (2006) Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers. J Oper Res Soc 57(3):316\u2013324","journal-title":"J Oper Res Soc"},{"key":"9086_CR106","doi-asserted-by":"publisher","unstructured":"Tao Z, Zhou Q (2017) Study on MS-BHFSP with multi-objective. In: 13th international conference on natural computation, fuzzy systems and knowledge discovery (ICNC-FSKD), Guilin, China, pp 319\u2013323. https:\/\/doi.org\/10.1109\/FSKD.2017.8393286","DOI":"10.1109\/FSKD.2017.8393286"},{"issue":"1","key":"9086_CR107","doi-asserted-by":"crossref","first-page":"593","DOI":"10.2174\/1874444301406010593","volume":"6","author":"Z Tao","year":"2014","unstructured":"Tao Z, Liu X, Zeng P (2014) Study on hybrid flow shop scheduling problem with blocking based on GASA. Open Autom Control Syst J 6(1):593\u2013600","journal-title":"Open Autom Control Syst J"},{"issue":"2","key":"9086_CR108","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.cor.2007.10.011","volume":"36","author":"R Tavakkoli-Moghaddam","year":"2009","unstructured":"Tavakkoli-Moghaddam R, Safaei N, Sassani F (2009) A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Comput Oper Res 36(2):402\u2013414","journal-title":"Comput Oper Res"},{"issue":"1","key":"9086_CR109","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cor.2010.04.018","volume":"38","author":"S Topaloglu","year":"2011","unstructured":"Topaloglu S, Ozkarahan I (2011) A constraint programming-based solution approach for medical resident scheduling problems. Comput Oper Res 38(1):246\u2013255. https:\/\/doi.org\/10.1016\/j.cor.2010.04.018","journal-title":"Comput Oper Res"},{"issue":"12","key":"9086_CR110","doi-asserted-by":"publisher","first-page":"4750","DOI":"10.1016\/j.asoc.2013.07.029","volume":"13","author":"SA Torabi","year":"2013","unstructured":"Torabi SA, Sahebjamnia N, Mansouri SA, Bajestani MA (2013) A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem. Appl Soft Comput J 13(12):4750\u20134762. https:\/\/doi.org\/10.1016\/j.asoc.2013.07.029","journal-title":"Appl Soft Comput J"},{"issue":"2","key":"9086_CR111","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0483(93)90053-N","volume":"21","author":"H Tsubone","year":"1993","unstructured":"Tsubone H, Ohba M, Takamuki H, Miyake Y (1993) A production scheduling system for a hybrid flow shop-a case study. Omega 21(2):205\u2013214","journal-title":"Omega"},{"issue":"12","key":"9086_CR112","doi-asserted-by":"publisher","first-page":"2042","DOI":"10.1080\/01605682.2019.1654414","volume":"71","author":"AT \u00dcnal","year":"2020","unstructured":"\u00dcnal AT, A\u011fral\u0131 S, Ta\u015fk\u0131n ZC (2020) A strong integer programming formulation for hybrid flowshop scheduling. J Oper Res Soc 71(12):2042\u20132052. https:\/\/doi.org\/10.1080\/01605682.2019.1654414","journal-title":"J Oper Res Soc"},{"issue":"2","key":"9086_CR113","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1016\/j.ejor.2010.05.041","volume":"207","author":"T Urlings","year":"2010","unstructured":"Urlings T, Ruiz R, St\u00fctzle T (2010) Shifting representation search for hybrid flexible flowline problems. Eur J Oper Res 207(2):1086\u20131095. https:\/\/doi.org\/10.1016\/j.ejor.2010.05.041","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9086_CR114","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.cor.2012.10.015","volume":"40","author":"S Wang","year":"2013","unstructured":"Wang S, Liu M (2013) A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput Oper Res 40(4):1064\u20131075. https:\/\/doi.org\/10.1016\/j.cor.2012.10.015","journal-title":"Comput Oper Res"},{"issue":"3","key":"9086_CR115","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1016\/j.cor.2007.11.004","volume":"36","author":"X Wang","year":"2009","unstructured":"Wang X, Tang L (2009) A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Comput Oper Res 36(3):907\u2013918","journal-title":"Comput Oper Res"},{"issue":"12","key":"9086_CR116","first-page":"1551","volume":"29","author":"L Wang","year":"2012","unstructured":"Wang L, Zhou G, Xu Y, Wang S (2012) An artificial bee colony algorithm for solving hybrid flow-shop scheduling problem with unrelated parallel machines. Control Theory Appl 29(12):1551\u20131556","journal-title":"Control Theory Appl"},{"issue":"4","key":"9086_CR117","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207543.2014.949363","volume":"53","author":"S Wang","year":"2015","unstructured":"Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53(4):1143\u20131167. https:\/\/doi.org\/10.1080\/00207543.2014.949363","journal-title":"Int J Prod Res"},{"issue":"22","key":"9086_CR118","doi-asserted-by":"publisher","first-page":"6893","DOI":"10.1080\/00207543.2019.1571251","volume":"57","author":"S Wang","year":"2019","unstructured":"Wang S, Kurz M, Mason SJ, Rashidi E (2019) Two-stage hybrid flow shop batching and lot streaming with variable sublots and sequence-dependent setups. Int J Prod Res 57(22):6893\u20136907. https:\/\/doi.org\/10.1080\/00207543.2019.1571251","journal-title":"Int J Prod Res"},{"issue":"3","key":"9086_CR119","first-page":"291","volume":"7","author":"S Wang","year":"2020","unstructured":"Wang S, Wang X, Yu L (2020) Two-stage no-wait hybrid flow-shop scheduling with sequence-dependent setup times. Int J Syst Sci Oper Logist 7(3):291\u2013307","journal-title":"Int J Syst Sci Oper Logist"},{"key":"9086_CR120","doi-asserted-by":"publisher","DOI":"10.3390\/math11112453","author":"Y Wang","year":"2023","unstructured":"Wang Y, Wang Y, Han Y (2023) A variant iterated greedy algorithm integrating multiple decoding rules for hybrid blocking flow shop scheduling problem. Mathematics. https:\/\/doi.org\/10.3390\/math11112453","journal-title":"Mathematics"},{"issue":"12","key":"9086_CR121","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1016\/j.camwa.2003.08.003","volume":"47","author":"J Xie","year":"2004","unstructured":"Xie J, Xing W, Liu Z, Dong J (2004) Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines. Comput Math Appl 47(12):1857\u20131863","journal-title":"Comput Math Appl"},{"issue":"5","key":"9086_CR122","doi-asserted-by":"crossref","first-page":"794","DOI":"10.3969\/j.issn.1004-4132.2011.05.011","volume":"22","author":"Y Xu","year":"2011","unstructured":"Xu Y, Wang L (2011) Differential evolution algorithm for hybrid flow-shop scheduling problems. J Syst Eng Electron 22(5):794\u2013798","journal-title":"J Syst Eng Electron"},{"issue":"1\u20134","key":"9086_CR123","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00170-013-4773-8","volume":"67","author":"L Yang-Kuei","year":"2013","unstructured":"Yang-Kuei L, Chi-Wei L (2013) Dispatching rules for unrelated parallel machine scheduling with release dates. Int J Adv Manuf Technol 67(1\u20134):269\u2013279","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"9086_CR124","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.cie.2008.09.004","volume":"56","author":"V Yaurima","year":"2009","unstructured":"Yaurima V, Burtseva L, Tchernykh A (2009) Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comput Ind Eng 56(4):1452\u20131463. https:\/\/doi.org\/10.1016\/j.cie.2008.09.004","journal-title":"Comput Ind Eng"},{"key":"9086_CR125","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/8682203","volume":"2022","author":"L Yong","year":"2022","unstructured":"Yong L, Zhantao L, Xiang L, Chenfeng P (2022) Heuristics for the hybrid flow shop scheduling problem with sequence-dependent setup times. Math Probl Eng 2022:1\u201316. https:\/\/doi.org\/10.1155\/2022\/8682203","journal-title":"Math Probl Eng"},{"key":"9086_CR126","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"C Yu","year":"2018","unstructured":"Yu C, Semeraro Q, Matta A (2018) A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Comput Oper Res 100:211\u2013229. https:\/\/doi.org\/10.1016\/j.cor.2018.07.025","journal-title":"Comput Oper Res"},{"issue":"7","key":"9086_CR127","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2021.1885068","volume":"60","author":"P Yunusoglu","year":"2021","unstructured":"Yunusoglu P, Topaloglu Yildiz S (2021) Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times. Int J Prod Res 60(7):1\u201318. https:\/\/doi.org\/10.1080\/00207543.2021.1885068","journal-title":"Int J Prod Res"},{"key":"9086_CR128","doi-asserted-by":"publisher","unstructured":"Zacharias M, Tonnius A, Gottschling J (2019) Machine learning in hybrid flow shop scheduling with unrelated machines. In: Proceedings of the 2019 international conference on industrial engineering and systems management IESM 2019, Shanghai, China, pp 1\u20136. https:\/\/doi.org\/10.1109\/IESM45758.2019.8948113","DOI":"10.1109\/IESM45758.2019.8948113"},{"key":"9086_CR129","unstructured":"Zandieh M, Rashidi E (2009) An effective hybrid genetic algorithm for hybrid flow shops with sequence dependent setup times and processor blocking. J Ind Eng [Internet] 4(Issue 4):51\u201358. http:\/\/www.qjie.ir\/article_32.html"},{"issue":"1","key":"9086_CR130","first-page":"111","volume":"180","author":"M Zandieh","year":"2006","unstructured":"Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl Math Comput 180(1):111\u2013127","journal-title":"Appl Math Comput"},{"issue":"7\u20138","key":"9086_CR131","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s00170-008-1740-x","volume":"43","author":"M Zandieh","year":"2009","unstructured":"Zandieh M, Dorri B, Khamseh AR (2009) Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops. Int J Adv Manuf Technol 43(7\u20138):767\u2013778","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"9086_CR132","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10845-009-0250-5","volume":"21","author":"M Zandieh","year":"2010","unstructured":"Zandieh M, Mozaffari E, Gholami M (2010) A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. J Intell Manuf 21(6):731\u2013743","journal-title":"J Intell Manuf"},{"issue":"3","key":"9086_CR133","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1080\/00207543.2017.1408971","volume":"34","author":"Q Zhang","year":"2014","unstructured":"Zhang Q, Chen Y (2014) Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem. Syst Eng | Theory Pract 34(3):802\u2013809","journal-title":"Syst Eng | Theory Pract"},{"issue":"16","key":"9086_CR134","doi-asserted-by":"publisher","first-page":"5293","DOI":"10.1080\/00207543.2017.1408971","volume":"56","author":"XY Zhang","year":"2018","unstructured":"Zhang XY, Chen L (2018) A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints. Int J Prod Res 56(16):5293\u20135305. https:\/\/doi.org\/10.1080\/00207543.2017.1408971","journal-title":"Int J Prod Res"},{"issue":"2019","key":"9086_CR135","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cie.2019.07.036","volume":"136","author":"B Zhang","year":"2019","unstructured":"Zhang B, Pan Q, Gao L, Li X, Meng L, Peng K (2019) A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem. Comput Ind Eng 136(2019):325\u2013344. https:\/\/doi.org\/10.1016\/j.cie.2019.07.036","journal-title":"Comput Ind Eng"},{"issue":"12","key":"9086_CR136","doi-asserted-by":"crossref","first-page":"4984","DOI":"10.1109\/TSMC.2019.2916088","volume":"50","author":"B Zhang","year":"2020","unstructured":"Zhang B, Pan QK, Gao L, Meng LL, Li XY, Peng KK (2020) A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem. IEEE Trans Syst Man Cybern Syst 50(12):4984\u20134999","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"9086_CR137","doi-asserted-by":"publisher","first-page":"102081","DOI":"10.1016\/j.rcim.2020.102081","volume":"68","author":"C Zhang","year":"2021","unstructured":"Zhang C, Tan J, Peng K, Gao L, Shen W, Lian K (2021) A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers. Robot Comput Integr Manuf 68:102081. https:\/\/doi.org\/10.1016\/j.rcim.2020.102081","journal-title":"Robot Comput Integr Manuf"},{"key":"9086_CR138","doi-asserted-by":"publisher","first-page":"107819","DOI":"10.1016\/j.knosys.2021.107819","volume":"238","author":"B Zhang","year":"2022","unstructured":"Zhang B, Pan Q, Meng L, Lu C, Mou J, Li J (2022) An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowl Based Syst 238:107819. https:\/\/doi.org\/10.1016\/j.knosys.2021.107819","journal-title":"Knowl Based Syst"},{"key":"9086_CR139","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2016.08.039","volume":"65","author":"X Zheng","year":"2016","unstructured":"Zheng X, Wang L (2016) A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints. Expert Syst Appl 65:28\u201339. https:\/\/doi.org\/10.1016\/j.eswa.2016.08.039","journal-title":"Expert Syst Appl"},{"issue":"1","key":"9086_CR140","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/s10878-017-0155-8","volume":"35","author":"W Zhong","year":"2018","unstructured":"Zhong W, Shi Y (2018) Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility. J Comb Optim 35(1):108\u2013125","journal-title":"J Comb Optim"},{"issue":"30","key":"9086_CR141","doi-asserted-by":"publisher","first-page":"224","DOI":"10.3778\/j.issn.1002-8331.2009.30.066","volume":"45","author":"HR Zhou","year":"2009","unstructured":"Zhou HR, Tang WS (2009) Optimise flexible flow-shop scheduling using genetic algorithm. [In Chinese]. Comput Eng Appl 45(30):224\u2013227. https:\/\/doi.org\/10.3778\/j.issn.1002-8331.2009.30.066","journal-title":"Comput Eng Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-09086-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09086-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T18:52:28Z","timestamp":1703098348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-09086-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,31]]},"references-count":141,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9086"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-09086-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,31]]},"assertion":[{"value":"1 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the author(s).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}