{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T10:14:16Z","timestamp":1778753656903,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:00:00Z","timestamp":1778716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:00:00Z","timestamp":1778716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"crossref","award":["ZR2019QF008"],"award-info":[{"award-number":["ZR2019QF008"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08561-y","type":"journal-article","created":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T09:21:18Z","timestamp":1778750478000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A discrete whale optimization algorithm for distributed no-wait multi-product batch plant scheduling with sequence-dependent setup times"],"prefix":"10.1007","volume":"82","author":[{"given":"Ping","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangquan","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuning","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanlong","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,14]]},"reference":[{"key":"8561_CR1","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1002\/bit.26260","volume":"114","author":"G Sandoval","year":"2017","unstructured":"Sandoval G, Espinoza D, Figueroa N, Asenjo JA (2017) Optimization of a biotechnological multiproduct batch plant design for the manufacture of four different products: a real case scenario. Biotechnol Bioeng 114:1252\u20131263. https:\/\/doi.org\/10.1002\/bit.26260","journal-title":"Biotechnol Bioeng"},{"key":"8561_CR2","doi-asserted-by":"publisher","first-page":"111342","DOI":"10.1016\/j.cie.2025.111342","volume":"208","author":"L Ding","year":"2025","unstructured":"Ding L, Luo D, Rauf M, Yue L (2025) Deep reinforcement learning for data-driven scheduling in multi-variety and small-batch flexible job shops: integrating fluid models for enhanced optimization. Comput Ind Eng 208:111342. https:\/\/doi.org\/10.1016\/j.cie.2025.111342","journal-title":"Comput Ind Eng"},{"key":"8561_CR3","doi-asserted-by":"publisher","first-page":"8535","DOI":"10.1021\/ie300217a","volume":"51","author":"B Shi","year":"2012","unstructured":"Shi B, Yan L-X, Wu W (2012) Rule-based scheduling of single-stage multiproduct batch plants with parallel units. Ind Eng Chem Res 51:8535\u20138549. https:\/\/doi.org\/10.1021\/ie300217a","journal-title":"Ind Eng Chem Res"},{"key":"8561_CR4","doi-asserted-by":"publisher","first-page":"113094","DOI":"10.1016\/j.asoc.2025.113094","volume":"175","author":"Y Li","year":"2025","unstructured":"Li Y, Zheng C, Pei X (2025) Multi-search mechanism-improved differential evolution algorithm for the no-wait flow shop scheduling problem. Appl Soft Comput 175:113094. https:\/\/doi.org\/10.1016\/j.asoc.2025.113094","journal-title":"Appl Soft Comput"},{"key":"8561_CR5","doi-asserted-by":"publisher","first-page":"122112","DOI":"10.1016\/j.eswa.2023.122112","volume":"238","author":"G Deng","year":"2024","unstructured":"Deng G, Wei M, Zhang S, Xu M, Jiang T, Wang F (2024) A simple migrating birds optimization algorithm with two search modes to solve the no-wait job shop problem. Expert Syst Appl 238:122112. https:\/\/doi.org\/10.1016\/j.eswa.2023.122112","journal-title":"Expert Syst Appl"},{"key":"8561_CR6","doi-asserted-by":"publisher","first-page":"100742","DOI":"10.1016\/j.swevo.2020.100742","volume":"59","author":"J-P Huang","year":"2020","unstructured":"Huang J-P, Pan Q-K, Gao L (2020) An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 59:100742. https:\/\/doi.org\/10.1016\/j.swevo.2020.100742","journal-title":"Swarm Evol Comput"},{"key":"8561_CR7","doi-asserted-by":"publisher","first-page":"111310","DOI":"10.1016\/j.cie.2025.111310","volume":"207","author":"B Yan","year":"2025","unstructured":"Yan B, Liu X, Lu S, Hu C, Wang X, Zhou Z (2025) Deep reinforcement learning approach for a dynamic flexible job shop problem with sequence dependent setup times. Comput Ind Eng 207:111310. https:\/\/doi.org\/10.1016\/j.cie.2025.111310","journal-title":"Comput Ind Eng"},{"key":"8561_CR8","doi-asserted-by":"publisher","first-page":"100557","DOI":"10.1016\/j.swevo.2019.100557","volume":"50","author":"J Chen","year":"2019","unstructured":"Chen J, Wang L, Peng Z (2019) A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evol Comput 50:100557. https:\/\/doi.org\/10.1016\/j.swevo.2019.100557","journal-title":"Swarm Evol Comput"},{"key":"8561_CR9","doi-asserted-by":"publisher","first-page":"107705","DOI":"10.1016\/j.asoc.2021.107705","volume":"111","author":"C-Y Cheng","year":"2021","unstructured":"Cheng C-Y, Pourhejazy P, Ying K-C, Liao Y-H (2021) New benchmark algorithms for no-wait flowshop group scheduling problem with sequence-dependent setup times. Appl Soft Comput 111:107705. https:\/\/doi.org\/10.1016\/j.asoc.2021.107705","journal-title":"Appl Soft Comput"},{"key":"8561_CR10","doi-asserted-by":"publisher","first-page":"113678","DOI":"10.1016\/j.eswa.2020.113678","volume":"160","author":"F Zhao","year":"2020","unstructured":"Zhao F, Zhao L, Wang L, Song H (2020) An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion. Expert Syst Appl 160:113678. https:\/\/doi.org\/10.1016\/j.eswa.2020.113678","journal-title":"Expert Syst Appl"},{"key":"8561_CR11","doi-asserted-by":"publisher","first-page":"111197","DOI":"10.1016\/j.engappai.2025.111197","volume":"156","author":"J Duan","year":"2025","unstructured":"Duan J, Liu Z, Wang M, Du Y, Yang M (2025) A problem-specific knowledge-based multi-objective algorithm for sustainable scheduling of distributed heterogeneous welding permutation flow shop. Eng Appl Artif Intell 156:111197. https:\/\/doi.org\/10.1016\/j.engappai.2025.111197","journal-title":"Eng Appl Artif Intell"},{"key":"8561_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.swevo.2018.12.001","volume":"44","author":"H-Y Sang","year":"2019","unstructured":"Sang H-Y, Pan Q-K, Li J-Q, Wang P, Han Y-Y, Gao K-Z, Duan P (2019) Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion. Swarm Evol Comput 44:64\u201373. https:\/\/doi.org\/10.1016\/j.swevo.2018.12.001","journal-title":"Swarm Evol Comput"},{"key":"8561_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","volume":"137","author":"W Shao","year":"2017","unstructured":"Shao W, Pi D, Shao Z (2017) Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. Knowl-Based Syst 137:163\u2013181. https:\/\/doi.org\/10.1016\/j.knosys.2017.09.026","journal-title":"Knowl-Based Syst"},{"key":"8561_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"8561_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2019.03.004","volume":"48","author":"FS Gharehchopogh","year":"2019","unstructured":"Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: whale optimization algorithm and its applications. Swarm Evol Comput 48:1\u201324. https:\/\/doi.org\/10.1016\/j.swevo.2019.03.004","journal-title":"Swarm Evol Comput"},{"key":"8561_CR16","doi-asserted-by":"publisher","first-page":"651","DOI":"10.2991\/ijcis.d.210112.002","volume":"14","author":"J Li","year":"2021","unstructured":"Li J, Guo L, Li Y, Liu C, Wang L, Hu H (2021) Enhancing whale optimization algorithm with chaotic theory for permutation flow shop scheduling problem: IJCIS 14:651. https:\/\/doi.org\/10.2991\/ijcis.d.210112.002","journal-title":"IJCIS"},{"key":"8561_CR17","doi-asserted-by":"publisher","first-page":"13181","DOI":"10.1007\/s00500-021-06099-0","volume":"25","author":"Q Li","year":"2021","unstructured":"Li Q, Li J, Zhang X, Zhang B (2021) A wale optimization algorithm for distributed flow shop with batch delivery. Soft Comput 25:13181\u201313194. https:\/\/doi.org\/10.1007\/s00500-021-06099-0","journal-title":"Soft Comput"},{"key":"8561_CR18","doi-asserted-by":"publisher","first-page":"100716","DOI":"10.1016\/j.swevo.2020.100716","volume":"57","author":"G Wang","year":"2020","unstructured":"Wang G, Gao L, Li X, Li P, Tasgetiren MF (2020) Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evol Comput 57:100716. https:\/\/doi.org\/10.1016\/j.swevo.2020.100716","journal-title":"Swarm Evol Comput"},{"key":"8561_CR19","doi-asserted-by":"publisher","first-page":"109082","DOI":"10.1016\/j.cie.2023.109082","volume":"178","author":"F Zhao","year":"2023","unstructured":"Zhao F, Xu Z, Bao H, Xu T, Zhu N (2023) Jonrinaldi, A cooperative whale optimization algorithm for energy-efficient scheduling of the distributed blocking flow-shop with sequence-dependent setup time. Comput Ind Eng 178:109082. https:\/\/doi.org\/10.1016\/j.cie.2023.109082","journal-title":"Comput Ind Eng"},{"key":"8561_CR20","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1177\/00202940231180622","volume":"56","author":"S Zhang","year":"2023","unstructured":"Zhang S, Gu X (2023) A discrete whale optimization algorithm for the no-wait flow shop scheduling problem. Meas Control 56:1764\u20131779. https:\/\/doi.org\/10.1177\/00202940231180622","journal-title":"Meas Control"},{"key":"8561_CR21","doi-asserted-by":"publisher","first-page":"105954","DOI":"10.1016\/j.asoc.2019.105954","volume":"87","author":"M Liu","year":"2020","unstructured":"Liu M, Yao X, Li Y (2020) Hybrid whale optimization algorithm enhanced with L\u00e9vy flight and differential evolution for job shop scheduling problems. Appl Soft Comput 87:105954. https:\/\/doi.org\/10.1016\/j.asoc.2019.105954","journal-title":"Appl Soft Comput"},{"key":"8561_CR22","doi-asserted-by":"publisher","first-page":"113436","DOI":"10.1016\/j.asoc.2025.113436","volume":"180","author":"E Manafi","year":"2025","unstructured":"Manafi E, Domenech B, Tavakkoli-Moghaddam R, Ranaboldo M (2025) A self-learning whale optimization algorithm based on reinforcement learning for a dual-resource flexible job shop scheduling problem. Appl Soft Comput 180:113436. https:\/\/doi.org\/10.1016\/j.asoc.2025.113436","journal-title":"Appl Soft Comput"},{"key":"8561_CR23","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1108\/03684921111142421","volume":"40","author":"J Zhu","year":"2011","unstructured":"Zhu J, Gu X, Gu W (2011) Optimal multiperiod scheduling of multiproduct batch plants under demand uncertainty. Kybernetes 40:871\u2013882. https:\/\/doi.org\/10.1108\/03684921111142421","journal-title":"Kybernetes"},{"key":"8561_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.compchemeng.2018.08.040","volume":"124","author":"T Escobet","year":"2019","unstructured":"Escobet T, Puig V, Quevedo J, Pal\u00e1-Sch\u00f6nw\u00e4lder P, Romera J, Adelman W (2019) Optimal batch scheduling of a multiproduct dairy process using a combined optimization\/constraint programming approach. Comput Chem Eng 124:228\u2013237. https:\/\/doi.org\/10.1016\/j.compchemeng.2018.08.040","journal-title":"Comput Chem Eng"},{"key":"8561_CR25","doi-asserted-by":"publisher","first-page":"107564","DOI":"10.1016\/j.compchemeng.2021.107564","volume":"156","author":"S Ackermann","year":"2022","unstructured":"Ackermann S, Fumero Y, Montagna JM (2022) Taking advantage of order consolidation in simultaneous batching and scheduling of multiproduct batch plants. Comput Chem Eng 156:107564. https:\/\/doi.org\/10.1016\/j.compchemeng.2021.107564","journal-title":"Comput Chem Eng"},{"key":"8561_CR26","doi-asserted-by":"publisher","first-page":"107321","DOI":"10.1016\/j.engappai.2023.107321","volume":"127","author":"Z Liu","year":"2024","unstructured":"Liu Z, Zha J, Yan J, Zhang Y, Zhao T, Cheng Q, Cheng C (2024) An improved genetic algorithm with an overlapping strategy for solving a combination of order batching and flexible job shop scheduling problem. Eng Appl Artif Intell 127:107321. https:\/\/doi.org\/10.1016\/j.engappai.2023.107321","journal-title":"Eng Appl Artif Intell"},{"key":"8561_CR27","doi-asserted-by":"publisher","first-page":"111198","DOI":"10.1016\/j.cie.2025.111198","volume":"205","author":"S Guo","year":"2025","unstructured":"Guo S, Huang Y, Guo J, Peng Z, Du B (2025) Modeling and optimization of batch scheduling problem considering the process granularity in shared manufacturing. Comput Ind Eng 205:111198. https:\/\/doi.org\/10.1016\/j.cie.2025.111198","journal-title":"Comput Ind Eng"},{"key":"8561_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91\u201395. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"key":"8561_CR29","doi-asserted-by":"publisher","first-page":"113776","DOI":"10.1016\/j.eswa.2020.113776","volume":"162","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Gu X (2020) Biogeography-based optimization algorithm for large-scale multistage batch plant scheduling. Expert Syst Appl 162:113776. https:\/\/doi.org\/10.1016\/j.eswa.2020.113776","journal-title":"Expert Syst Appl"},{"key":"8561_CR30","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.neucom.2020.07.094","volume":"419","author":"Y Han","year":"2021","unstructured":"Han Y, Gu X (2021) Cooperative hybrid evolutionary algorithm for large scale multi-stage multi-product batch plants scheduling problem. Neurocomputing 419:80\u201396. https:\/\/doi.org\/10.1016\/j.neucom.2020.07.094","journal-title":"Neurocomputing"},{"key":"8561_CR31","doi-asserted-by":"publisher","first-page":"108467","DOI":"10.1016\/j.compchemeng.2023.108467","volume":"180","author":"N Ji","year":"2024","unstructured":"Ji N, Gu X (2024) Integration of planning, scheduling, and control of no-wait batch plant. Comput Chem Eng 180:108467. https:\/\/doi.org\/10.1016\/j.compchemeng.2023.108467","journal-title":"Comput Chem Eng"},{"key":"8561_CR32","doi-asserted-by":"publisher","first-page":"108262","DOI":"10.1016\/j.asoc.2021.108262","volume":"115","author":"Y Han","year":"2022","unstructured":"Han Y, Yan X, Gu X (2022) Novel hybrid discrete differential evolution algorithm for the multi-stage multi-purpose batch plant scheduling problem. Appl Soft Comput 115:108262. https:\/\/doi.org\/10.1016\/j.asoc.2021.108262","journal-title":"Appl Soft Comput"},{"key":"8561_CR33","doi-asserted-by":"publisher","first-page":"110983","DOI":"10.1016\/j.cie.2025.110983","volume":"203","author":"P He","year":"2025","unstructured":"He P, Jiang X, Wang Q, Zhang B (2025) Multi-objective human-robot collaborative batch scheduling in distributed hybrid flowshop via automatic design of local search-reconstruction-feedback algorithm. Comput Ind Eng 203:110983. https:\/\/doi.org\/10.1016\/j.cie.2025.110983","journal-title":"Comput Ind Eng"},{"key":"8561_CR34","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1007\/s11081-024-09886-4","volume":"25","author":"J Gao","year":"2024","unstructured":"Gao J, Guo Z, Liu L, Dong Y, Du J (2024) Integrated batch production planning and scheduling optimization considering processing time uncertainty. Optim Eng 25:2369\u20132400. https:\/\/doi.org\/10.1007\/s11081-024-09886-4","journal-title":"Optim Eng"},{"key":"8561_CR35","doi-asserted-by":"publisher","first-page":"100180","DOI":"10.1016\/j.jpse.2024.100180","volume":"4","author":"R Tu","year":"2024","unstructured":"Tu R, Zhang H, Xu B, Huang X, Che Y, Du J, Wang C, Qiu R, Liang Y (2024) Machine learning application in batch scheduling for multi-product pipelines: a review. J Pipeline Sci Eng 4:100180. https:\/\/doi.org\/10.1016\/j.jpse.2024.100180","journal-title":"J Pipeline Sci Eng"},{"key":"8561_CR36","doi-asserted-by":"publisher","first-page":"126526","DOI":"10.1016\/j.eswa.2025.126526","volume":"271","author":"Z-Q Zhang","year":"2025","unstructured":"Zhang Z-Q, Zhu X-P, Xu Y-X, Qian B, Yang B, Hu R (2025) MEDHEA: multidimensional estimation of distribution based hyper-heuristic evolutionary algorithm for energy-efficient distributed assembly no-wait flow-shop scheduling problem. Expert Syst Appl 271:126526. https:\/\/doi.org\/10.1016\/j.eswa.2025.126526","journal-title":"Expert Syst Appl"},{"key":"8561_CR37","doi-asserted-by":"publisher","first-page":"120571","DOI":"10.1016\/j.eswa.2023.120571","volume":"230","author":"F Zhao","year":"2023","unstructured":"Zhao F, Zhou G, Xu T, Zhu N (2023) Jonrinaldi, A knowledge-driven cooperative scatter search algorithm with reinforcement learning for the distributed blocking flow shop scheduling problem. Expert Syst Appl 230:120571. https:\/\/doi.org\/10.1016\/j.eswa.2023.120571","journal-title":"Expert Syst Appl"},{"key":"8561_CR38","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.jmsy.2023.09.017","volume":"71","author":"X Sun","year":"2023","unstructured":"Sun X, Shen W, Vogel-Heuser B (2023) A hybrid genetic algorithm for distributed hybrid blocking flowshop scheduling problem. J Manuf Syst 71:390\u2013405. https:\/\/doi.org\/10.1016\/j.jmsy.2023.09.017","journal-title":"J Manuf Syst"},{"key":"8561_CR39","doi-asserted-by":"publisher","first-page":"112247","DOI":"10.1016\/j.asoc.2024.112247","volume":"166","author":"H Yu","year":"2024","unstructured":"Yu H, Gao K, Li Z, Suganthan PN (2024) Energy-efficient multi-objective distributed assembly permutation flowshop scheduling by Q-learning based meta-heuristics. Appl Soft Comput 166:112247. https:\/\/doi.org\/10.1016\/j.asoc.2024.112247","journal-title":"Appl Soft Comput"},{"key":"8561_CR40","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.jmsy.2024.10.014","volume":"77","author":"L Huang","year":"2024","unstructured":"Huang L, Tang D, Zhang Z, Zhu H, Cai Q, Zhao S (2024) An iterated greedy algorithm integrating job insertion strategy for distributed job shop scheduling problems. J Manuf Syst 77:746\u2013763. https:\/\/doi.org\/10.1016\/j.jmsy.2024.10.014","journal-title":"J Manuf Syst"},{"key":"8561_CR41","doi-asserted-by":"publisher","first-page":"119840","DOI":"10.1016\/j.eswa.2023.119840","volume":"224","author":"K Zhu","year":"2023","unstructured":"Zhu K, Gong G, Peng N, Zhang L, Huang D, Luo Q, Li X (2023) Dynamic distributed flexible job-shop scheduling problem considering operation inspection. Expert Syst Appl 224:119840. https:\/\/doi.org\/10.1016\/j.eswa.2023.119840","journal-title":"Expert Syst Appl"},{"key":"8561_CR42","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:2807\u20132839. https:\/\/doi.org\/10.1016\/j.cor.2006.12.030","journal-title":"Comput Oper Res"},{"key":"8561_CR43","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"J-Y Ding","year":"2015","unstructured":"Ding J-Y, Song S, Gupta JND, Zhang R, Chiong R, Wu C (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput 30:604\u2013613. https:\/\/doi.org\/10.1016\/j.asoc.2015.02.006","journal-title":"Appl Soft Comput"},{"key":"8561_CR44","doi-asserted-by":"publisher","first-page":"99380","DOI":"10.1109\/ACCESS.2020.2997379","volume":"8","author":"S Zhang","year":"2020","unstructured":"Zhang S, Gu X, Zhou F (2020) An improved discrete migrating birds optimization algorithm for the no-wait flow shop scheduling problem. IEEE Access 8:99380\u201399392. https:\/\/doi.org\/10.1109\/ACCESS.2020.2997379","journal-title":"IEEE Access"},{"key":"8561_CR45","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45:42\u201356. https:\/\/doi.org\/10.1016\/j.omega.2013.12.004","journal-title":"Omega"},{"key":"8561_CR46","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Oper Res"},{"key":"8561_CR47","doi-asserted-by":"publisher","first-page":"105443","DOI":"10.1016\/j.engappai.2022.105443","volume":"116","author":"F Zhao","year":"2022","unstructured":"Zhao F, Bao H, Wang L, Xu T, Zhu N (2022) Jonrinaldi, A heuristic and meta-heuristic based on problem-specific knowledge for distributed blocking flow-shop scheduling problem with sequence-dependent setup times. Eng Appl Artif Intell 116:105443. https:\/\/doi.org\/10.1016\/j.engappai.2022.105443","journal-title":"Eng Appl Artif Intell"},{"key":"8561_CR48","doi-asserted-by":"publisher","first-page":"113147","DOI":"10.1016\/j.eswa.2019.113147","volume":"145","author":"Z Shao","year":"2020","unstructured":"Shao Z, Pi D, Shao W (2020) Hybrid enhanced discrete Fruit Fly Optimization algorithm for scheduling blocking flow-shop in distributed environment. Expert Syst Appl 145:113147. https:\/\/doi.org\/10.1016\/j.eswa.2019.113147","journal-title":"Expert Syst Appl"},{"key":"8561_CR49","doi-asserted-by":"publisher","first-page":"106946","DOI":"10.1016\/j.asoc.2020.106946","volume":"100","author":"H Li","year":"2021","unstructured":"Li H, Li X, Gao L (2021) A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Appl Soft Comput 100:106946. https:\/\/doi.org\/10.1016\/j.asoc.2020.106946","journal-title":"Appl Soft Comput"},{"key":"8561_CR50","doi-asserted-by":"publisher","first-page":"101681","DOI":"10.1016\/j.swevo.2024.101681","volume":"90","author":"P He","year":"2024","unstructured":"He P, Zhang B, Lu C, Meng L, Zou W (2024) Optimizing distributed reentrant heterogeneous hybrid flowshop batch scheduling problem: iterative construction-local search-reconstruction algorithm. Swarm Evol Comput 90:101681. https:\/\/doi.org\/10.1016\/j.swevo.2024.101681","journal-title":"Swarm Evol Comput"},{"key":"8561_CR51","doi-asserted-by":"publisher","first-page":"109915","DOI":"10.1016\/j.engappai.2024.109915","volume":"142","author":"Y Zuo","year":"2025","unstructured":"Zuo Y, Zhao F, Zhang J (2025) A knowledge-driven scatter search algorithm for the distributed hybrid flow shop scheduling problem. Eng Appl Artif Intell 142:109915. https:\/\/doi.org\/10.1016\/j.engappai.2024.109915","journal-title":"Eng Appl Artif Intell"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08561-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08561-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08561-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T09:21:19Z","timestamp":1778750479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08561-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,14]]},"references-count":51,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["8561"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08561-y","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,14]]},"assertion":[{"value":"10 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2026","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"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"415"}}