{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:51:47Z","timestamp":1776750707063,"version":"3.51.2"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T00:00:00Z","timestamp":1691452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72174160"],"award-info":[{"award-number":["72174160"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["WUT: 233102003"],"award-info":[{"award-number":["WUT: 233102003"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2020-YB-036"],"award-info":[{"award-number":["2020-YB-036"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper deals with a reentrant hybrid flow shop problem with sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model with the minimization of total weighted completion time is constructed for this problem. Considering the complexity of the problem at hand, an effective cooperative adaptive genetic algorithm (CAGA) is proposed. In the algorithm, a dual chain coding scheme and a staged-hierarchical decoding approach are, respectively, designed to encode and decode each solution. Six dispatch heuristics and a dynamic adjustment method are introduced to define initial population. To balance the exploration and exploitation abilities, three effective operations are implemented: (1) two new crossover and mutation operators with collaborative mechanism are imposed on genetic algorithm; (2) an adaptive adjustment strategy is introduced to re-optimize better solutions after mutation operations, where ant colony search algorithm and modified greedy heuristic are intelligently switched; (3) a reset strategy with dynamic variable step strategy is embedded to re-generate some non-improved solutions. A Taguchi method of design of experiment is adopted to calibrate the parameter values in the presented algorithm. Comparison experiments are executed on test instances with different scale problems. Computational results show that the proposed CAGA is more effective and efficient than several well-known algorithms in solving the studied problem.<\/jats:p>","DOI":"10.1007\/s40747-023-01147-8","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T06:01:46Z","timestamp":1691474506000},"page":"781-809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers"],"prefix":"10.1007","volume":"10","author":[{"given":"Qianqian","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Tian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3428-9493","authenticated-orcid":false,"given":"Lijun","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,8]]},"reference":[{"key":"1147_CR1","first-page":"83","volume":"86","author":"MS Salvador","year":"1973","unstructured":"Salvador MS (1973) A solution to a special class of flow shop scheduling problems. Lect Notes Econ Math 86:83\u201391","journal-title":"Lect Notes Econ Math"},{"issue":"8","key":"1147_CR2","first-page":"2221","volume":"49","author":"D Lin","year":"2010","unstructured":"Lin D, Lee CKM (2010) A review of the research methodology for the re-entrant scheduling problem. Int J Prod Res 49(8):2221\u20132242","journal-title":"Int J Prod Res"},{"issue":"3","key":"1147_CR3","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","volume":"16","author":"W Shao","year":"2019","unstructured":"Shao W, Pi D, Shao Z (2019) A pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time. IEEE Trans Autom Sci Eng 16(3):1344\u20131360","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"1147_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCYB.2018.2884597","volume":"49","author":"YY Han","year":"2019","unstructured":"Han YY, Gong DW, Jin YC, Pan QK (2019) Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE T Cybern 49(1):1\u201314","journal-title":"IEEE T Cybern"},{"issue":"3","key":"1147_CR5","first-page":"565","volume":"36","author":"H Xuan","year":"2021","unstructured":"Xuan H, Zheng QQ, Li B (2021) Hybrid heuristic algorithm for multi-stage hybrid flow shop scheduling with unrelated parallel machines and finite buffers. Control Decis 36(3):565\u2013576","journal-title":"Control Decis"},{"key":"1147_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"CL Yu","year":"2018","unstructured":"Yu CL, 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","journal-title":"Comput Oper Res"},{"key":"1147_CR7","doi-asserted-by":"crossref","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 316:487\u2013502","journal-title":"Inf Sci"},{"issue":"5","key":"1147_CR8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.3390\/a11050068","volume":"11","author":"VH Yaurima-Basaldua","year":"2018","unstructured":"Yaurima-Basaldua VH, Tchernykh A, Villalobos-Rodriguez F, Salomon-Torres R (2018) Hybrid flow shop with unrelated machines, setup time, and work in progress buffers for bi-objective optimization of tortilla manufacturing. Algorithms 11(5):68","journal-title":"Algorithms"},{"key":"1147_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3069184","author":"WF Li","year":"2021","unstructured":"Li WF, He LJ, Cao YL (2021) Many-objective evolutionary algorithm with reference point-based fuzzy correlation entropy for energy-efficient job shop scheduling with limited workers. IEEE T Cybern. https:\/\/doi.org\/10.1109\/TCYB.2021.3069184","journal-title":"IEEE T Cybern"},{"key":"1147_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100575","author":"LJ He","year":"2019","unstructured":"He LJ, Li WF, Zhang Y, Cao YL (2019) A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2019.100575","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"1147_CR11","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 flow shop scheduling problem. J Oper Res Soc 39(4):359\u2013364","journal-title":"J Oper Res Soc"},{"issue":"5","key":"1147_CR12","doi-asserted-by":"crossref","first-page":"2395","DOI":"10.1016\/j.eswa.2014.10.043","volume":"42","author":"C Sangsawang","year":"2015","unstructured":"Sangsawang C, Sethanan K, Fujimoto T, Gen M (2015) Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint. Expert Syst Appl 42(5):2395\u20132410","journal-title":"Expert Syst Appl"},{"issue":"8","key":"1147_CR13","doi-asserted-by":"crossref","first-page":"4530","DOI":"10.1016\/j.asoc.2011.08.013","volume":"11","author":"M Hekmatfar","year":"2011","unstructured":"Hekmatfar M, Ghomi S, Karimi B (2011) Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Appl Soft Comput 11(8):4530\u20134539","journal-title":"Appl Soft Comput"},{"issue":"8","key":"1147_CR14","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1007\/s10845-015-1078-9","volume":"28","author":"C Chamnanlor","year":"2017","unstructured":"Chamnanlor C, Sethanan K, Gen M (2017) Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. J Intell Manuf 28(8):1915\u20131931","journal-title":"J Intell Manuf"},{"issue":"1","key":"1147_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00521-016-2692-y","volume":"30","author":"BH Zhou","year":"2018","unstructured":"Zhou BH, Hu LM, Zhong ZY (2018) A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem. Neural Comput Appl 30(1):193\u2013209","journal-title":"Neural Comput Appl"},{"issue":"3","key":"1147_CR16","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","volume":"61","author":"HM Cho","year":"2011","unstructured":"Cho HM, Bae SJ, Kim J, Jeong IJ (2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput Ind Eng 61(3):529\u2013541","journal-title":"Comput Ind Eng"},{"issue":"19\u201320","key":"1147_CR17","doi-asserted-by":"crossref","first-page":"5735","DOI":"10.1080\/00207543.2014.910627","volume":"52","author":"KC Ying","year":"2014","unstructured":"Ying KC, Lin SW, Wan SY (2014) Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm. Int J Prod Res 52(19\u201320):5735\u20135747","journal-title":"Int J Prod Res"},{"key":"1147_CR18","first-page":"1","volume":"139","author":"CC Lin","year":"2020","unstructured":"Lin CC, Liu WY, Chen YH (2020) Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity. Comput Ind Eng 139:1\u201314","journal-title":"Comput Ind Eng"},{"key":"1147_CR19","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.cie.2017.02.010","volume":"106","author":"HM Cho","year":"2017","unstructured":"Cho HM, Jeong IJ (2017) A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops. Comput Ind Eng 106:174\u2013181","journal-title":"Comput Ind Eng"},{"key":"1147_CR20","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/2573873","author":"K Geng","year":"2019","unstructured":"Geng K, Ye C, Cao L, Liu L (2019) Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm. Math Probl Eng. https:\/\/doi.org\/10.1155\/2019\/2573873","journal-title":"Math Probl Eng"},{"issue":"8","key":"1147_CR21","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1057\/jors.2013.70","volume":"65","author":"H Eskandari","year":"2014","unstructured":"Eskandari H, Hosseinzadeh A (2014) A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times. J Oper Res Soc 65(8):1221\u20131231","journal-title":"J Oper Res Soc"},{"issue":"4","key":"1147_CR22","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":"4","key":"1147_CR23","first-page":"105","volume":"16","author":"YH Yu","year":"2013","unstructured":"Yu YH, Li TK (2013) Heuristic scheduling method for a class of two-stage hybrid flow shop with limited buffer. Ind Eng 16(4):105\u2013110","journal-title":"Ind Eng"},{"issue":"1\u20134","key":"1147_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00170-011-3368-5","volume":"58","author":"SH Abyaneh","year":"2012","unstructured":"Abyaneh SH, Zandieh M (2012) Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. Int J Adv Manuf Technol 58(1\u20134):309\u2013325","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"1147_CR25","first-page":"509","volume":"95","author":"R Rooeinfar","year":"2019","unstructured":"Rooeinfar R, Raissi S, Ghezavati VR (2019) Stochastic flexible flow shop scheduling problem with limited buffers and fixed interval preventive maintenance: a hybrid approach of simulation and metaheuristic algorithms. Simul-Trans Soc Model Simul Int 95(6):509\u2013528","journal-title":"Simul-Trans Soc Model Simul Int"},{"issue":"4","key":"1147_CR26","first-page":"474","volume":"46","author":"ZH Han","year":"2017","unstructured":"Han ZH, Sun Y, Shi HB (2017) Research on flexible flow shop scheduling problem with limited buffer based on an improved ICA algorithm. Inf Control 46(4):474\u2013482","journal-title":"Inf Control"},{"key":"1147_CR27","doi-asserted-by":"crossref","first-page":"34477","DOI":"10.1109\/ACCESS.2019.2904848","volume":"7","author":"SL Jiang","year":"2019","unstructured":"Jiang SL, Zhang L (2019) Energy-oriented scheduling for hybrid flow shop with limited buffers through efficient multi-objective optimization. IEEE Access 7:34477\u201334487","journal-title":"IEEE Access"},{"issue":"5\u20138","key":"1147_CR28","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":"1","key":"1147_CR29","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ijpe.2012.09.014","volume":"145","author":"C Almeder","year":"2013","unstructured":"Almeder C, Hartl RF (2013) A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer. Int J Prod Econ 145(1):88\u201395","journal-title":"Int J Prod Econ"},{"issue":"9\u201312","key":"1147_CR30","doi-asserted-by":"crossref","first-page":"1739","DOI":"10.1007\/s00170-014-6343-0","volume":"76","author":"SA Soltani","year":"2015","unstructured":"Soltani SA, Karimi B (2015) Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints. Int J Adv Manuf Technol 76(9\u201312):1739\u20131755","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"1147_CR31","doi-asserted-by":"crossref","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","journal-title":"Comput Ind Eng"},{"issue":"22","key":"1147_CR32","doi-asserted-by":"crossref","first-page":"1","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):1\u201315","journal-title":"Int J Prod Res"},{"issue":"1","key":"1147_CR33","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1504\/IJOR.2018.091204","volume":"32","author":"MK Marichelvam","year":"2018","unstructured":"Marichelvam MK, Azhagurajan A, Geetha M (2018) Minimisation of total tardiness in hybrid flowshop scheduling problems with sequence dependent setup times using a discrete firefly algorithm. Int J Oper Res 32(1):114\u2013126","journal-title":"Int J Oper Res"},{"issue":"2","key":"1147_CR34","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/s40430-018-0980-4","volume":"40","author":"JV Moccellin","year":"2018","unstructured":"Moccellin JV, Ncagano MS, Neto A, Prata BA (2018) Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. J Braz Soc Mech Sci Eng 40(2):40","journal-title":"J Braz Soc Mech Sci Eng"},{"issue":"2","key":"1147_CR35","first-page":"107","volume":"12","author":"J Behnamian","year":"2019","unstructured":"Behnamian J (2019) Diversified particle swarm optimization for hybrid flowshop scheduling. J Optim Ind Eng 12(2):107\u2013119","journal-title":"J Optim Ind Eng"},{"issue":"4","key":"1147_CR36","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s10845-013-0830-2","volume":"26","author":"P Ramezani","year":"2013","unstructured":"Ramezani P, Rabiee M, Jolai F (2013) 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","journal-title":"J Intell Manuf"},{"key":"1147_CR37","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.cie.2019.06.057","volume":"135","author":"A Khare","year":"2019","unstructured":"Khare A, Agrawal S (2019) Scheduling hybrid flowshop with sequence-dependent setup times and due windows to minimize total weighted earliness and tardiness. Comput Ind Eng 135:780\u2013792","journal-title":"Comput Ind Eng"},{"key":"1147_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104196","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. https:\/\/doi.org\/10.1016\/j.engappai.2021.104196","journal-title":"Eng Appl Artif Intell"},{"key":"1147_CR39","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/1257060","author":"H Tian","year":"2016","unstructured":"Tian H, Li K, Liu W (2016) A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time. Math Probl Eng. https:\/\/doi.org\/10.1155\/2016\/1257060","journal-title":"Math Probl Eng"},{"issue":"4","key":"1147_CR40","doi-asserted-by":"crossref","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","journal-title":"J Manuf Syst"},{"issue":"9\u201310","key":"1147_CR41","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1016\/j.apm.2013.10.061","volume":"38","author":"M Ebrahimi","year":"2014","unstructured":"Ebrahimi M, Ghomi S, 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","journal-title":"Appl Math Model"},{"issue":"4\u20135","key":"1147_CR42","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1051\/ro\/2018023","volume":"52","author":"A Sbihi","year":"2018","unstructured":"Sbihi A, Chemangui M (2018) A genetic algorithm for solving the steel continuous casting problem with inter-sequence dependent setups and dedicated machines. Rairo-Oper Res 52(4\u20135):1351\u20131376","journal-title":"Rairo-Oper Res"},{"key":"1147_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106638","author":"Y Li","year":"2020","unstructured":"Li Y, Li X, Gao L, Meng LL (2020) An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2020.106638","journal-title":"Comput Ind Eng"},{"issue":"6","key":"1147_CR44","first-page":"362","volume":"36","author":"EA Garavito-Hern\u00e1ndez","year":"2019","unstructured":"Garavito-Hern\u00e1ndez EA, Pea-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","journal-title":"J Ind Prod Eng"},{"key":"1147_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113716","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. https:\/\/doi.org\/10.1016\/j.eswa.2020.113716","journal-title":"Expert Syst Appl"},{"issue":"10","key":"1147_CR46","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1177\/0959651819827705","volume":"233","author":"B Zhou","year":"2019","unstructured":"Zhou B, Liu W (2019) Energy-efficient multi-objective scheduling algorithm for hybrid flow shop with fuzzy processing time. Proc Inst Mech Eng Part I-J Syst Control Eng 233(10):1282\u20131297","journal-title":"Proc Inst Mech Eng Part I-J Syst Control Eng"},{"key":"1147_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106570","author":"C Yu","year":"2020","unstructured":"Yu C, Andreotti P, Semeraro Q (2020) Multi-objective scheduling in hybrid flow shop: evolutionary algorithms using multi-decoding framework. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2020.106570","journal-title":"Comput Ind Eng"},{"issue":"2","key":"1147_CR48","first-page":"137","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 Manage Sci Eng Manage 14(2):137\u2013146","journal-title":"Int J Manage Sci Eng Manage"},{"issue":"13","key":"1147_CR49","doi-asserted-by":"crossref","first-page":"2128","DOI":"10.1016\/j.ifacol.2019.11.520","volume":"52","author":"M Liu","year":"2019","unstructured":"Liu M, Yang X (2019) Bi-objective optimization for scheduling and multi-skilled worker assignments in the hybrid flow shop. IFAC-PapersOnLine 52(13):2128\u20132133","journal-title":"IFAC-PapersOnLine"},{"key":"1147_CR50","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8520503","author":"H Xuan","year":"2019","unstructured":"Xuan H, Zhang HX, Li B (2019) An improved discrete artificial bee colony algorithm for flexible flow shop scheduling with step deteriorating jobs and sequence-dependent setup times. Math Probl Eng. https:\/\/doi.org\/10.1155\/2019\/8520503","journal-title":"Math Probl Eng"},{"key":"1147_CR51","doi-asserted-by":"crossref","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:2543\u20132555","journal-title":"Comput Oper Res"},{"issue":"1","key":"1147_CR52","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5(1):287\u2013326","journal-title":"Ann Discret Math"},{"key":"1147_CR53","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","volume":"3","author":"S Nguyen","year":"2017","unstructured":"Nguyen S, Mei Y, Zhang M (2017) Genetic programming for production scheduling: a survey with a unified framework. Complex Intell Syst 3:41\u201366","journal-title":"Complex Intell Syst"},{"key":"1147_CR54","doi-asserted-by":"crossref","first-page":"P104503","DOI":"10.1016\/j.engappai.2021.104503","volume":"106","author":"QQ Zheng","year":"2021","unstructured":"Zheng QQ, Zhang Y, Tian HW, He LJ (2021) An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs. Eng Appl Artif Intel 106:P104503","journal-title":"Eng Appl Artif Intel"},{"issue":"2","key":"1147_CR55","doi-asserted-by":"crossref","first-page":"40","DOI":"10.14419\/ijet.v7i2.2.11868","volume":"7","author":"J Panggabean","year":"2018","unstructured":"Panggabean J (2018) Hybrid ant colony optimization-genetics algorithm to minimize makespan flow shop scheduling. Int J Eng Technol 7(2):40\u201344","journal-title":"Int J Eng Technol"},{"issue":"1","key":"1147_CR56","first-page":"55","volume":"18","author":"V Riahi","year":"2018","unstructured":"Riahi V, Kazemi M (2018) A new hybrid ant colony algorithm for scheduling of no-wait flowshop. Oper Res 18(1):55\u201374","journal-title":"Oper Res"},{"key":"1147_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.10.012","author":"M Kurdi","year":"2018","unstructured":"Kurdi M (2018) Ant colony system with a novel Non-DaemonActions procedure for multiprocessor task scheduling in multistage hybrid flow shop. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2018.10.012","journal-title":"Swarm Evol Comput"},{"issue":"12","key":"1147_CR58","first-page":"121","volume":"32","author":"J Deng","year":"2016","unstructured":"Deng J, Wang L (2016) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32(12):121\u2013131","journal-title":"Swarm Evol Comput"},{"key":"1147_CR59","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s40747-020-00193-w","volume":"7","author":"XR Tao","year":"2021","unstructured":"Tao XR, Li JQ, Huang TH, Duan P (2021) Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption. Complex Intell Syst 7:311\u2013326","journal-title":"Complex Intell Syst"},{"issue":"6","key":"1147_CR60","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s12293-019-00290-5","volume":"11","author":"J Liang","year":"2019","unstructured":"Liang J, Wang P, Guo L, Yue C, Yu K, Wang Y (2019) Multi-objective flow shop scheduling with limited buffers using hybrid self-adaptive differential evolution. Memet Comput 11(6):407\u2013422","journal-title":"Memet Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01147-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01147-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01147-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T22:24:02Z","timestamp":1707603842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01147-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,8]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1147"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01147-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,8]]},"assertion":[{"value":"7 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}