{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T17:14:30Z","timestamp":1779124470660,"version":"3.51.4"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62403367"],"award-info":[{"award-number":["62403367"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202434"],"award-info":[{"award-number":["62202434"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"outh Backbone Teachers of Undergraduate Universities in Henan Province","award":["2023GGJS111"],"award-info":[{"award-number":["2023GGJS111"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s40314-026-03781-7","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T15:29:39Z","timestamp":1779118179000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-population multi-objective whale optimization algorithm for energy-efficient job-shop scheduling: incorporating the coupling effect of sequence-dependent setup and start-time-dependent deterioration"],"prefix":"10.1007","volume":"45","author":[{"given":"Lei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3428-9493","authenticated-orcid":false,"given":"Lijun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"3781_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106349","volume":"93","author":"M Abdel-Bassset","year":"2020","unstructured":"Abdel-Bassset M, El-Shahat D, Deb K et al (2020) Energy-aware whale optimization algorithm for real-time task scheduling in multiprocessor systems. Appl Soft Comput 93:106349","journal-title":"Appl Soft Comput"},{"key":"3781_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113348","volume":"157","author":"M Abedi","year":"2020","unstructured":"Abedi M, Chiong R, Noman N, Zhang R (2020) A multi-population, multi-objective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines. Expert Syst Appl 157:113348","journal-title":"Expert Syst Appl"},{"key":"3781_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109454","volume":"183","author":"S Afsar","year":"2023","unstructured":"Afsar S, Vela CR, Palacios JJ et al (2023) Mathematical models and benchmarking for the\u00a0fuzzy job shop\u00a0scheduling problem. Comput Ind Eng 183:109454","journal-title":"Comput Ind Eng"},{"issue":"2","key":"3781_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2021.03.026","volume":"295","author":"MM Ahmadian","year":"2021","unstructured":"Ahmadian MM, Khatami M, Salehipour A et al (2021) Four decades of research on the open-shop scheduling problem to minimize the makespan. Eur J Oper Res 295(2):399\u2013426","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3781_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378","journal-title":"Eur J Oper Res"},{"key":"3781_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.cie.2016.06.025","volume":"102","author":"L Asadzadeh","year":"2016","unstructured":"Asadzadeh L (2016) A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput Ind Eng 102:359\u2013367","journal-title":"Comput Ind Eng"},{"issue":"11","key":"3781_CR7","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"4","key":"3781_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10951-017-0532-2","volume":"20","author":"R B\u00fcrgy","year":"2017","unstructured":"B\u00fcrgy R (2017) A neighborhood for complex job shop scheduling problems with regular objectives. J Scheduling 20(4):391\u2013422","journal-title":"J Scheduling"},{"key":"3781_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.procs.2017.08.267","volume":"112","author":"I Chaouch","year":"2017","unstructured":"Chaouch I, Driss OB, Ghedira K (2017) A modified ant colony optimization algorithm for the distributed job shop scheduling problem. Procedia Comput Sci 112:296\u2013305","journal-title":"Procedia Comput Sci"},{"key":"3781_CR10","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-319-09339-0_69","volume":"8589","author":"S Chen","year":"2014","unstructured":"Chen S, Qian B, Liu B et al (2014) A Bayesian statistical inference-based estimation of distribution algorithm for the re-entrant job-shop scheduling problem with sequence-dependent setup times. Lecture Notes Comput Sci 8589:686\u2013696","journal-title":"Lecture Notes Comput Sci"},{"key":"3781_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ejor.2012.12.031","volume":"227","author":"M Ciavotta","year":"2013","unstructured":"Ciavotta M, Minella G, Ruiz R (2013) Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study. Eur J Oper Res 227:301\u2013313","journal-title":"Eur J Oper Res"},{"key":"3781_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.neucom.2020.07.004","volume":"414","author":"H Ding","year":"2020","unstructured":"Ding H, Gu X (2020) Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem. Neurocomputing 414:313\u2013332","journal-title":"Neurocomputing"},{"key":"3781_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"key":"3781_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.011","volume":"182","author":"GL Gong","year":"2019","unstructured":"Gong GL, Deng QW, Chiong R et al (2019) An effective memetic algorithm for multi-objective job-shop scheduling. Knowl Based Syst 182:104840","journal-title":"Knowl Based Syst"},{"key":"3781_CR15","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s10845-011-0622-5","volume":"24","author":"MA Gonz\u00e1lez","year":"2013","unstructured":"Gonz\u00e1lez MA, Vela CR, Gonz\u00e1lez-Rodr\u00edguez I et al (2013) Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times. J Intell Manuf 24:741\u2013754","journal-title":"J Intell Manuf"},{"key":"3781_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2022.101756","volume":"54","author":"H Guo","year":"2022","unstructured":"Guo H, Liu J, Zhuang C (2022) Automatic design for shop scheduling strategies based on hyper-heuristics: a systematic review. Adv Eng Inform 54:101756","journal-title":"Adv Eng Inform"},{"issue":"4","key":"3781_CR17","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1080\/00207543.2019.1613581","volume":"58","author":"X He","year":"2020","unstructured":"He X, Dong S, Zhao N (2020) Research on rush order insertion rescheduling problem under hybrid flow shop based on NSGA-III. Int J Prod Res 58(4):1161\u20131177","journal-title":"Int J Prod Res"},{"issue":"1","key":"3781_CR18","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TII.2021.3056425","volume":"18","author":"L He","year":"2022","unstructured":"He L, Chiong R, Li W et al (2022) Multiobjective optimization of energy-efficient job-shop scheduling with dynamic reference point-based fuzzy relative entropy. IEEE Trans Ind Inform 18(1):600\u2013610","journal-title":"IEEE Trans Ind Inform"},{"key":"3781_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2025.114253","volume":"186","author":"TY Hong","year":"2026","unstructured":"Hong TY, Li KH (2026) Large language model driven adaptive deep reinforcement learning with dynamic definition refinement for flexible job shop scheduling problem. Appl Soft Comput 186:114253","journal-title":"Appl Soft Comput"},{"key":"3781_CR20","volume":"35","author":"TH Jiang","year":"2022","unstructured":"Jiang TH, Zhu HQ, Liu L et al (2022) Energy-conscious flexible job shop scheduling problem considering transportation time and deterioration effect simultaneously. Sustainable Comput: Informa Syst 35:100680","journal-title":"Sustainable Comput: Informa Syst"},{"issue":"4","key":"3781_CR21","first-page":"243","volume":"2","author":"M Khalili","year":"2014","unstructured":"Khalili M, Naderi B (2014) Multi-objective job shop scheduling problem with sequence dependent setup times using a novel metaheuristic. Int J Intell Eng Inform 2(4):243\u2013258","journal-title":"Int J Intell Eng Inform"},{"issue":"10","key":"3781_CR22","doi-asserted-by":"publisher","first-page":"8523","DOI":"10.1016\/j.jksuci.2021.08.029","volume":"34","author":"V Kumar","year":"2022","unstructured":"Kumar V, Aydav PSS, Minz S (2022) Multi-view ensemble learning using multi-objective particle swarm optimization for high dimensional data classification. J King Saud Univ Comp Inf Sci 34(10):8523\u20138537","journal-title":"J King Saud Univ Comp Inf Sci"},{"key":"3781_CR23","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.cor.2015.10.005","volume":"67","author":"M Kurdi","year":"2016","unstructured":"Kurdi M (2016) An effective new island model genetic algorithm for job shop scheduling problem. Comput Oper Res 67:132\u2013142","journal-title":"Comput Oper Res"},{"key":"3781_CR24","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.jclepro.2018.02.004","volume":"181","author":"JQ Li","year":"2018","unstructured":"Li JQ, Sang HY, Han YY et al (2018) Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. J Clean Prod 181:584\u2013598","journal-title":"J Clean Prod"},{"issue":"C","key":"3781_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.knosys.2019.02.027","volume":"173","author":"ZC Li","year":"2019","unstructured":"Li ZC, Qian B, Hu R et al (2019) An elitist nondominated sorting hybrid algorithm for multi-objective\u00a0flexible job-shop\u00a0scheduling problem with\u00a0sequence-dependent\u00a0setups. Knowl-Based Syst 173(C):83\u2013112","journal-title":"Knowl-Based Syst"},{"issue":"9","key":"3781_CR26","doi-asserted-by":"publisher","first-page":"102205","DOI":"10.1016\/j.jksuci.2024.102205","volume":"36","author":"J Li","year":"2024","unstructured":"Li J, Luo T, Zhang B et al (2024) IMOABC: An efficient multi-objective filter\u2013wrapper hybrid approach for high-dimensional feature selection. J King Saud Univ Comp Inf Sci 36(9):102205","journal-title":"J King Saud Univ Comp Inf Sci"},{"issue":"3","key":"3781_CR27","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"TL Lin","year":"2010","unstructured":"Lin TL, Horng SJ, Kao TW et al (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37(3):2629\u20132636","journal-title":"Expert Syst Appl"},{"issue":"C","key":"3781_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105954","volume":"87","author":"M Liu","year":"2020","unstructured":"Liu M, Yao XF, Li YX (2020) Hybrid whale optimization algorithm enhanced with L\u00e9vy flight and differential evolution for job shop scheduling problems. Appl Soft Comput 87(C):105954","journal-title":"Appl Soft Comput"},{"key":"3781_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2024.01.002","volume":"73","author":"Z Liu","year":"2024","unstructured":"Liu Z, Mao H, Sa G et al (2024) Dynamic job-shop scheduling using graph reinforcement learning with auxiliary strategy. J Manuf Syst 73:1\u201318","journal-title":"J Manuf Syst"},{"key":"3781_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107600","volume":"235","author":"FQ Lu","year":"2022","unstructured":"Lu FQ, Yan TR, Bi HL et al (2022) A bilevel whale optimization algorithm for risk management scheduling of information technology projects considering outsourcing. Knowl-BaSed Syst 235:107600","journal-title":"Knowl-BaSed Syst"},{"key":"3781_CR31","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","journal-title":"Adv Eng Softw"},{"key":"3781_CR32","first-page":"329","volume":"30","author":"S Mousavipour","year":"2019","unstructured":"Mousavipour S, Farughi H, Ahmadizar F (2019) A job shop scheduling problem with sequence-dependent setup times considering position-based learning effects and availability constraints. Int J Ind Eng Prod Res 30:329\u2013340","journal-title":"Int J Ind Eng Prod Res"},{"issue":"21","key":"3781_CR33","doi-asserted-by":"publisher","first-page":"5959","DOI":"10.1080\/00207540802165817","volume":"47","author":"B Naderi","year":"2009","unstructured":"Naderi B, Zandieh M, Fatemi Ghomi SMT (2009) Scheduling job shop problems with sequence-dependent setup times. Int J Prod Res 47(21):5959\u20135976","journal-title":"Int J Prod Res"},{"issue":"1","key":"3781_CR34","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","journal-title":"IFAC-PapersOnLine"},{"key":"3781_CR35","first-page":"1701","volume":"20","author":"A Ozolins","year":"2020","unstructured":"Ozolins A (2020) Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times. Ope Res 20:1701\u20131728","journal-title":"Ope Res"},{"issue":"7","key":"3781_CR36","doi-asserted-by":"publisher","first-page":"2151","DOI":"10.1080\/00207543.2021.1884309","volume":"60","author":"KT Park","year":"2022","unstructured":"Park KT, Jeon S, Noh SD (2022) Digital twin application with horizontal coordination for reinforcement-learning-based production control in a re-entrant job shop. Int J Prod Res 60(7):2151\u20132167","journal-title":"Int J Prod Res"},{"key":"3781_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer, New York"},{"issue":"C","key":"3781_CR38","doi-asserted-by":"publisher","first-page":"106473","DOI":"10.1016\/j.cor.2023.106473","volume":"162","author":"R Puka","year":"2024","unstructured":"Puka R, Skalna I, Duda J et al (2024) Deterministic constructive vN-NEH + algorithm to solve permutation\u00a0flow shop scheduling problem\u00a0with makespan criterion. Comput Oper Res 162(C):106473","journal-title":"Comput Oper Res"},{"issue":"9","key":"3781_CR39","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1080\/0951192X.2014.928747","volume":"28","author":"P Renna","year":"2015","unstructured":"Renna P (2015) Deteriorating job scheduling problem in a job-shop manufacturing system by multi-agent system. Int J Comput Integ Manuf 28(9):936\u2013945","journal-title":"Int J Comput Integ Manuf"},{"issue":"C","key":"3781_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115339","volume":"183","author":"AP Rifai","year":"2021","unstructured":"Rifai AP, Mara STW, Sudiarso A (2021) Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time. Expert Syst Appl 183(C):115339","journal-title":"Expert Syst Appl"},{"issue":"6","key":"3781_CR41","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-016-0497-6","volume":"20","author":"K Rustogi","year":"2017","unstructured":"Rustogi K, Strusevich VA (2017) Single machine scheduling with a generalized job-dependent cumulative effect. J Scheduling 20(6):583\u2013592","journal-title":"J Scheduling"},{"key":"3781_CR42","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-031-37108-0_32","volume":"14105","author":"F Santos","year":"2023","unstructured":"Santos F, Costa L, Varela L (2023) Multi-objective optimization of the job shop scheduling problem on unrelated parallel machines with sequence-dependent setup times. Lecture Notes Comput Sci 14105:495\u2013507","journal-title":"Lecture Notes Comput Sci"},{"key":"3781_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105732","volume":"144","author":"VA Strusevich","year":"2022","unstructured":"Strusevich VA (2022) Complexity and approximation of open shop scheduling to minimizethe makespan: a review of models and approaches. Comput Oper Res 144:105732","journal-title":"Comput Oper Res"},{"key":"3781_CR44","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s00170-010-2847-4","volume":"53","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"Tavakkoli-Moghaddam R, Azarkish M, Sadeghnejad-Barkousaraie A (2011) Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS. Int J Adv Manuf Tech 53:733\u2013750","journal-title":"Int J Adv Manuf Tech"},{"key":"3781_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106456","volume":"162","author":"S Usman","year":"2024","unstructured":"Usman S, Lu C (2024) Job-shop scheduling with limited flexible workers considering ergonomic factors using an improved multi-objective discrete Jaya algorithm. Comput Oper Res 162:106456","journal-title":"Comput Oper Res"},{"key":"3781_CR46","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10732-008-9094-y","volume":"16","author":"CR Vela","year":"2010","unstructured":"Vela CR, Varela R, Gonz\u00e1le MA (2010) Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J Heuristics 16:139\u2013165","journal-title":"J Heuristics"},{"issue":"2","key":"3781_CR47","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S021759590700122X","volume":"24","author":"JB Wang","year":"2007","unstructured":"Wang JB, Cheng TE (2007) Scheduling problems with the effects of deterioration and learning. Asia-Pac J Oper Res 24(2):245\u2013261","journal-title":"Asia-Pac J Oper Res"},{"key":"3781_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114793","volume":"174","author":"YK Wang","year":"2021","unstructured":"Wang YK, Wang SL, Li D et al (2021) An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Syst Appl 174:114793","journal-title":"Expert Syst Appl"},{"issue":"12","key":"3781_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TII.2022.3165636","volume":"18","author":"G Wang","year":"2024","unstructured":"Wang G, Gao D, Pedrycz W (2024a) Solving multi-objective fuzzy job-shop scheduling problem by a hybrid adaptive differential evolution algorithm. IEEE Trans Ind Inform 18(12):1. https:\/\/doi.org\/10.1109\/TII.2022.3165636","journal-title":"IEEE Trans Ind Inform"},{"issue":"1","key":"3781_CR50","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TSMC.2023.3305089","volume":"54","author":"X Wang","year":"2024","unstructured":"Wang X, Ren T, Bai D et al (2024b) Hybrid flow shop scheduling with learning effects and release dates to minimize the makespan. IEEE Trans Syst Man Cybern Syst 54(1):365\u2013378","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"3781_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2025.103527","volume":"67","author":"AL Wang","year":"2025","unstructured":"Wang AL, Wan CH, Liu J et al (2025) MASC: large language model-based multi-agent scheduling chain for flexible job shop scheduling problem. Adv Eng Inform 67:103527","journal-title":"Adv Eng Inform"},{"key":"3781_CR52","doi-asserted-by":"publisher","first-page":"3249","DOI":"10.1016\/j.jclepro.2017.10.342","volume":"172","author":"X Wu","year":"2018","unstructured":"Wu X, Sun Y (2018) A green scheduling algorithm for flexible job shop with energy-saving measures. J Clean Prod 172:3249\u20133264","journal-title":"J Clean Prod"},{"key":"3781_CR53","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.cie.2019.06.048","volume":"135","author":"XL Wu","year":"2019","unstructured":"Wu XL, Shen XL, Li CB (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004\u20131024","journal-title":"Comput Ind Eng"},{"issue":"2","key":"3781_CR55","first-page":"473","volume":"15","author":"H Xue","year":"2024","unstructured":"Xue H, Meng L, Duan P et al (2024) Modeling and optimization of the hybrid flow shop scheduling problem with sequence-dependent setup times. Int J Ind Eng Comput 15(2):473\u2013490","journal-title":"Int J Ind Eng Comput"},{"key":"3781_CR56","first-page":"1","volume":"22","author":"X Yan","year":"2024","unstructured":"Yan X, Zuo H, Hu C et al (2024) Distributed\u00a0heterogeneous\u00a0flow shop scheduling\u00a0method for dual-carbon goals. IEEE Trans Autom Sci Eng 22:1\u201312","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"3781_CR57","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang R, Chiong R (2016) Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J Clean Prod 112:3361\u20133375","journal-title":"J Clean Prod"},{"key":"3781_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2020.102081","volume":"68","author":"C Zhang","year":"2021","unstructured":"Zhang C, Tan J, Peng K et al (2021) A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers. Robot Com-Int Manuf 68:102081","journal-title":"Robot Com-Int Manuf"},{"key":"3781_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105443","volume":"116","author":"F Zhao","year":"2022","unstructured":"Zhao F, Bao H, Wang L et al (2022) 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","journal-title":"Eng Appl Artif Intell"},{"key":"3781_CR60","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-024-03959-9","author":"JJ Zhao","year":"2025","unstructured":"Zhao JJ, Li Y, Li Y et al (2025) Multi-objective optimization of tribological properties of diesel engine camshaft bearings. Struct Multidiscipl Opt. https:\/\/doi.org\/10.1007\/s00158-024-03959-9","journal-title":"Struct Multidiscipl Opt"},{"issue":"1","key":"3781_CR61","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s40747-023-01147-8","volume":"10","author":"QQ Zheng","year":"2023","unstructured":"Zheng QQ, Zhang Y, Tian H, He LJ (2023) A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers. Complex Intell Syst 10(1):781\u2013809","journal-title":"Complex Intell Syst"},{"key":"3781_CR62","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.ejor.2017.08.022","volume":"265","author":"GY Zhu","year":"2018","unstructured":"Zhu GY, He LJ, Ju XW et al (2018) A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA. Eur J Oper Res 265:813\u2013828","journal-title":"Eur J Oper Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03781-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03781-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03781-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T17:01:58Z","timestamp":1779123718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03781-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":61,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["3781"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03781-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]},"assertion":[{"value":"25 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":4,"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 (beyond the disclosed funding) 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":"This study did not involve human or animal subjects, and thus, no ethical approval was required. The study protocol adhered to the guidelines established by the journal.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}}],"article-number":"400"}}