{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:55:39Z","timestamp":1780959339723,"version":"3.54.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"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":["72301026"],"award-info":[{"award-number":["72301026"]}],"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":["71701016"],"award-info":[{"award-number":["71701016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of China","doi-asserted-by":"publisher","award":["23YJA630090"],"award-info":[{"award-number":["23YJA630090"]}],"id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["FRF-TP-24-026A"],"award-info":[{"award-number":["FRF-TP-24-026A"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10479-026-07195-w","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T16:03:49Z","timestamp":1776096229000},"page":"923-955","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A multi-objective memetic algorithm for energy-efficient flow shop group scheduling problem with a dynamic speed-scaling mechanism"],"prefix":"10.1007","volume":"361","author":[{"given":"Shuaipeng","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3579-298X","authenticated-orcid":false,"given":"Bailin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sihan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yihan","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tieke","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,13]]},"reference":[{"key":"7195_CR1","doi-asserted-by":"publisher","first-page":"113348","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 Systems with Applications, 157, 113348. https:\/\/doi.org\/10.1016\/j.eswa.2020.113348","journal-title":"Expert Systems with Applications"},{"key":"7195_CR2","doi-asserted-by":"publisher","first-page":"101016","DOI":"10.1016\/j.swevo.2021.101016","volume":"68","author":"S Afsar","year":"2022","unstructured":"Afsar, S., Palacios, J. J., Puente, J., Vela, C. R., & Gonz\u00e1lez-Rodr\u00edguez, I. (2022). Multi-objective enhanced memetic algorithm for green job shop scheduling with uncertain times. Swarm and Evolutionary Computation, 68, 101016. https:\/\/doi.org\/10.1016\/j.swevo.2021.101016","journal-title":"Swarm and Evolutionary Computation"},{"issue":"21\u201322","key":"7195_CR3","doi-asserted-by":"publisher","first-page":"5080","DOI":"10.1016\/j.apm.2014.03.035","volume":"38","author":"F Ahmadizar","year":"2014","unstructured":"Ahmadizar, F., & Shahmaleki, P. (2014). Group-shop scheduling with sequence-dependent set-up and transportation times. Applied Mathematical Modelling, 38(21\u201322), 5080\u20135091. https:\/\/doi.org\/10.1016\/j.apm.2014.03.035","journal-title":"Applied Mathematical Modelling"},{"issue":"3","key":"7195_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(90)90368-W","volume":"13","author":"KR Baker","year":"1990","unstructured":"Baker, K. R. (1990). Scheduling groups of jobs in the two-machine flow shop. Mathematical and Computer Modelling, 13(3), 29\u201336. https:\/\/doi.org\/10.1016\/0895-7177(90)90368-W","journal-title":"Mathematical and Computer Modelling"},{"issue":"2","key":"7195_CR5","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10479-024-06156-5","volume":"346","author":"Z Chang","year":"2025","unstructured":"Chang, Z., & Zhou, Z. (2025). Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites. Annals of Operations Research, 346(2), 861\u2013893. https:\/\/doi.org\/10.1007\/s10479-024-06156-5","journal-title":"Annals of Operations Research"},{"key":"7195_CR6","doi-asserted-by":"publisher","first-page":"129248","DOI":"10.1016\/j.jclepro.2021.129248","volume":"326","author":"L Cheng","year":"2021","unstructured":"Cheng, L., Tang, Q., Zhang, L., & Meng, K. (2021). Mathematical model and enhanced cooperative co-evolutionary algorithm for scheduling energy-efficient manufacturing cell. Journal of Cleaner Production, 326, 129248. https:\/\/doi.org\/10.1016\/j.jclepro.2021.129248","journal-title":"Journal of Cleaner Production"},{"key":"7195_CR7","doi-asserted-by":"publisher","first-page":"103413","DOI":"10.1016\/j.engappai.2019.103413","volume":"89","author":"A Costa","year":"2020","unstructured":"Costa, A., Cappadonna, F. V., & Fichera, S. (2020). Minimizing makespan in a flow shop sequence dependent group scheduling problem with blocking constraint. Engineering Applications of Artificial Intelligence, 89, 103413. https:\/\/doi.org\/10.1016\/j.engappai.2019.103413","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"7195_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-025-06720-7","author":"X Gong","year":"2025","unstructured":"Gong, X., & Wang, J.-J. (2025). An environmentally friendly elective patient scheduling under the predict-then-optimize framework. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-025-06720-7","journal-title":"Annals of Operations Research"},{"key":"7195_CR9","doi-asserted-by":"publisher","first-page":"102997","DOI":"10.1016\/j.omega.2023.102997","volume":"123","author":"X He","year":"2024","unstructured":"He, X., Pan, Q.-K., Gao, L., Neufeld, J. S., & Gupta, J. N. D. (2024). Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times. Omega, 123, 102997. https:\/\/doi.org\/10.1016\/j.omega.2023.102997","journal-title":"Omega"},{"issue":"27","key":"7195_CR10","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1109\/TEVC.2021.3115795","volume":"3","author":"X He","year":"2021","unstructured":"He, X., Pan, Q., Gao, L., Wang, L., & Suganthan, P. N. (2021). A greedy cooperative co-evolution ary algorithm with problem-specific knowledge for multi-objective flowshop group scheduling problems. IEEE Transactions on Evolutionary Computation, 3(27), 430\u2013444. https:\/\/doi.org\/10.1109\/TEVC.2021.3115795","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"7195_CR11","doi-asserted-by":"publisher","first-page":"121971","DOI":"10.1016\/j.ins.2025.121971","volume":"705","author":"Q Ji","year":"2025","unstructured":"Ji, Q., Han, Y., Wang, Y., Gong, D., & Gao, K. (2025). A Q-learning-driven genetic algorithm for the distributed hybrid flow shop group scheduling problem with delivery time windows. Information Sciences, 705, 121971. https:\/\/doi.org\/10.1016\/j.ins.2025.121971","journal-title":"Information Sciences"},{"key":"7195_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2025.07.055","author":"Z Jia","year":"2025","unstructured":"Jia, Z., Wu, T., Zhang, H., Liu, C., & Li, K. (2025). An energy-efficient scheduling approach for a two-stage hybrid flow shop with parallel batch machines. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2025.07.055","journal-title":"European Journal of Operational Research"},{"key":"7195_CR13","doi-asserted-by":"publisher","first-page":"106360","DOI":"10.1016\/j.cor.2023.106360","volume":"159","author":"P Li","year":"2023","unstructured":"Li, P., Xue, Q., Zhang, Z., Chen, J., & Zhou, D. (2023). Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II. Computers and Operations Research, 159, 106360. https:\/\/doi.org\/10.1016\/j.cor.2023.106360","journal-title":"Computers and Operations Research"},{"key":"7195_CR14","doi-asserted-by":"publisher","first-page":"107683","DOI":"10.1016\/j.cie.2021.107683","volume":"162","author":"X Lian","year":"2021","unstructured":"Lian, X., Zheng, Z., Wang, C., & Gao, X. (2021). An energy-efficient hybrid flow shop scheduling problem in steelmaking plants. Computers and Industrial Engineering, 162, 107683. https:\/\/doi.org\/10.1016\/j.cie.2021.107683","journal-title":"Computers and Industrial Engineering"},{"key":"7195_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.12.025","volume":"128","author":"S-W Lin","year":"2019","unstructured":"Lin, S.-W., & Ying, K.-C. (2019). Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Computers and Industrial Engineering, 128, 1\u20137. https:\/\/doi.org\/10.1016\/j.cie.2018.12.025","journal-title":"Computers and Industrial Engineering"},{"key":"7195_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","volume":"170","author":"C-D Liou","year":"2015","unstructured":"Liou, C.-D., & Hsieh, Y.-C. (2015). A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. International Journal of Production Economics, 170, 258\u2013267. https:\/\/doi.org\/10.1016\/j.ijpe.2015.10.002","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"7195_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/0377-2217(93)90029-M","volume":"69","author":"R Logendran","year":"1993","unstructured":"Logendran, R., & Sriskandarajah, C. (1993). Two-machine group scheduling problem with blocking and anticipatory setups. European Journal of Operational Research, 69(3), 467\u2013481. https:\/\/doi.org\/10.1016\/0377-2217(93)90029-M","journal-title":"European Journal of Operational Research"},{"key":"7195_CR18","doi-asserted-by":"publisher","first-page":"121149","DOI":"10.1016\/j.eswa.2023.121149","volume":"235","author":"C Luo","year":"2024","unstructured":"Luo, C., Gong, W., & Lu, C. (2024). Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns. Expert Systems with Applications, 235, 121149. https:\/\/doi.org\/10.1016\/j.eswa.2023.121149","journal-title":"Expert Systems with Applications"},{"key":"7195_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld, J. S., Gupta, J. N. D., & Buscher, U. (2016). A comprehensive review of flowshop group scheduling literature. Computers and Operations Research, 70, 56\u201374. https:\/\/doi.org\/10.1016\/j.cor.2015.12.006","journal-title":"Computers and Operations Research"},{"issue":"6","key":"7195_CR20","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TCYB.2020.3026571","volume":"52","author":"Z Pan","year":"2022","unstructured":"Pan, Z., Lei, D., & Wang, L. (2022). A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling. IEEE Transactions on Cybernetics, 52(6), 5051\u20135063. https:\/\/doi.org\/10.1109\/TCYB.2020.3026571","journal-title":"IEEE Transactions on Cybernetics"},{"key":"7195_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2015.12.001","volume":"92","author":"H Qin","year":"2016","unstructured":"Qin, H., Zhang, Z.-H., & Bai, D. (2016). Permutation flowshop group scheduling with position-based learning effect. Computers and Industrial Engineering, 92, 1\u201315. https:\/\/doi.org\/10.1016\/j.cie.2015.12.001","journal-title":"Computers and Industrial Engineering"},{"key":"7195_CR22","doi-asserted-by":"publisher","first-page":"106127","DOI":"10.1016\/j.cor.2022.106127","volume":"152","author":"F Qiu","year":"2023","unstructured":"Qiu, F., Geng, N., & Wang, H. (2023). An improved memetic algorithm for integrated production scheduling and vehicle routing decisions. Computers and Operations Research, 152, 106127. https:\/\/doi.org\/10.1016\/j.cor.2022.106127","journal-title":"Computers and Operations Research"},{"issue":"10","key":"7195_CR23","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., & St\u00fctzle, T. (2007). A review of metrics on permutations for search landscape analysis. Computers and Operations Research, 34(10), 3143\u20133153. https:\/\/doi.org\/10.1016\/j.cor.2005.11.022","journal-title":"Computers and Operations Research"},{"key":"7195_CR24","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.asoc.2017.01.017","volume":"54","author":"W Shao","year":"2017","unstructured":"Shao, W., Pi, D., & Shao, Z. (2017). Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Applied Soft Computing, 54, 164\u2013182. https:\/\/doi.org\/10.1016\/j.asoc.2017.01.017","journal-title":"Applied Soft Computing"},{"issue":"3","key":"7195_CR25","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.ejor.2023.03.041","volume":"310","author":"L Shen","year":"2023","unstructured":"Shen, L., Dauz\u00e8re-P\u00e9r\u00e8s, S., & Maecker, S. (2023). Energy cost efficient scheduling in flexible job-shop manufacturing systems. European Journal of Operational Research, 310(3), 992\u20131016. https:\/\/doi.org\/10.1016\/j.ejor.2023.03.041","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7195_CR26","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0925-5273(03)00196-8","volume":"88","author":"M Solimanpur","year":"2004","unstructured":"Solimanpur, M., Vrat, P., & Shankar, R. (2004). A heuristic to minimize makespan of cell scheduling problem. International Journal of Production Economics, 88(3), 231\u2013241. https:\/\/doi.org\/10.1016\/S0925-5273(03)00196-8","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"7195_CR27","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.ejor.2023.07.012","volume":"312","author":"Z Tian","year":"2024","unstructured":"Tian, Z., & Zheng, L. (2024). Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches. European Journal of Operational Research, 312(2), 512\u2013524. https:\/\/doi.org\/10.1016\/j.ejor.2023.07.012","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"7195_CR28","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","volume":"50","author":"J-J Wang","year":"2020","unstructured":"Wang, J.-J., & Wang, L. (2020). A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flowshop. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(5), 1805\u20131819. https:\/\/doi.org\/10.1109\/TSMC.2017.2788879","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"7195_CR29","doi-asserted-by":"publisher","first-page":"108126","DOI":"10.1016\/j.cie.2022.108126","volume":"168","author":"J Wang","year":"2022","unstructured":"Wang, J., & Wang, L. (2022). A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling. Computers and Industrial Engineering, 168, 108126. https:\/\/doi.org\/10.1016\/j.cie.2022.108126","journal-title":"Computers and Industrial Engineering"},{"issue":"17","key":"7195_CR30","doi-asserted-by":"publisher","first-page":"5886","DOI":"10.1080\/00207543.2022.2118887","volume":"61","author":"Y Wang","year":"2023","unstructured":"Wang, Y., Che, A., & Feng, J. (2023). Energy-efficient unrelated parallel machine scheduling with general position-based deterioration. International Journal of Production Research, 61(17), 5886\u20135900. https:\/\/doi.org\/10.1080\/00207543.2022.2118887","journal-title":"International Journal of Production Research"},{"key":"7195_CR31","doi-asserted-by":"publisher","first-page":"102066","DOI":"10.1016\/j.swevo.2025.102066","volume":"97","author":"Y Wang","year":"2025","unstructured":"Wang, Y., Han, Y., Wang, Y., Sang, H., & Wang, Y. (2025a). A reinforcement learning-enhanced multi-objective co-evolutionary algorithm for distributed group scheduling with preventive maintenance. Swarm and Evolutionary Computation, 97, 102066. https:\/\/doi.org\/10.1016\/j.swevo.2025.102066","journal-title":"Swarm and Evolutionary Computation"},{"key":"7195_CR32","doi-asserted-by":"publisher","first-page":"126600","DOI":"10.1016\/j.eswa.2025.126600","volume":"271","author":"Y Wang","year":"2025","unstructured":"Wang, Y., Wang, Y., Han, Y., Gao, K., Li, J., & Wang, Y. (2025b). Enhancing distributed blocking flowshop group scheduling: Theoretical insight and application of an iterated greedy algorithm with idle time insertion and rapid evaluation mechanisms. Expert Systems with Applications, 271, 126600. https:\/\/doi.org\/10.1016\/j.eswa.2025.126600","journal-title":"Expert Systems with Applications"},{"key":"7195_CR33","doi-asserted-by":"publisher","first-page":"101143","DOI":"10.1016\/j.swevo.2022.101143","volume":"74","author":"Z-Y Wang","year":"2022","unstructured":"Wang, Z.-Y., Pan, Q.-K., Gao, L., & Wang, Y.-L. (2022). An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem. Swarm and Evolutionary Computation, 74, 101143. https:\/\/doi.org\/10.1016\/j.swevo.2022.101143","journal-title":"Swarm and Evolutionary Computation"},{"key":"7195_CR34","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","volume":"82","author":"X Wu","year":"2019","unstructured":"Wu, X., & Che, A. (2019). A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega, 82, 155\u2013165. https:\/\/doi.org\/10.1016\/j.omega.2018.01.001","journal-title":"Omega"},{"key":"7195_CR35","doi-asserted-by":"publisher","first-page":"102117","DOI":"10.1016\/j.omega.2019.102117","volume":"94","author":"X Wu","year":"2020","unstructured":"Wu, X., & Che, A. (2020). Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega, 94, 102117. https:\/\/doi.org\/10.1016\/j.omega.2019.102117","journal-title":"Omega"},{"key":"7195_CR36","doi-asserted-by":"publisher","first-page":"110663","DOI":"10.1016\/j.knosys.2023.110663","volume":"274","author":"Y Wu","year":"2023","unstructured":"Wu, Y., Wang, L., Zhuang, X., Wang, J., Chen, J., & Zheng, J. (2023). A cooperative coevolutionary algorithm with problem-specific knowledge for energy-efficient scheduling in seru system. Knowledge-Based Systems, 274, 110663. https:\/\/doi.org\/10.1016\/j.knosys.2023.110663","journal-title":"Knowledge-Based Systems"},{"key":"7195_CR37","doi-asserted-by":"publisher","first-page":"126121","DOI":"10.1016\/j.jclepro.2021.126121","volume":"293","author":"X Xin","year":"2021","unstructured":"Xin, X., Jiang, Q., Li, S., Gong, S., & Chen, K. (2021). Energy-efficient scheduling for a permutation flow shop with variable transportation time using an improved discrete whale swarm optimization. Journal of Cleaner Production, 293, 126121. https:\/\/doi.org\/10.1016\/j.jclepro.2021.126121","journal-title":"Journal of Cleaner Production"},{"key":"7195_CR38","doi-asserted-by":"publisher","first-page":"109513","DOI":"10.1016\/j.cie.2023.109513","volume":"183","author":"J Yang","year":"2023","unstructured":"Yang, J., Xu, H., Cheng, J., Li, R., & Gu, Y. (2023). A decomposition-based memetic algorithm to solve the biobjective green flexible job shop scheduling problem with interval type-2 fuzzy processing time. Computers and Industrial Engineering, 183, 109513. https:\/\/doi.org\/10.1016\/j.cie.2023.109513","journal-title":"Computers and Industrial Engineering"},{"key":"7195_CR39","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cie.2018.05.033","volume":"122","author":"MT YazdaniSabouni","year":"2018","unstructured":"YazdaniSabouni, M. T., & Logendran, R. (2018). Lower bound development in a flow shop electronic assembly problem with carryover sequence-dependent setup time. Computers and Industrial Engineering, 122, 149\u2013160. https:\/\/doi.org\/10.1016\/j.cie.2018.05.033","journal-title":"Computers and Industrial Engineering"},{"key":"7195_CR40","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. Computers and Operations Research, 100, 211\u2013229. https:\/\/doi.org\/10.1016\/j.cor.2018.07.025","journal-title":"Computers and Operations Research"},{"issue":"2","key":"7195_CR41","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10845-020-01580-3","volume":"32","author":"S Yuan","year":"2020","unstructured":"Yuan, S., Li, T., & Wang, B. (2020). A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times. Journal of Intelligent Manufacturing, 32(2), 427\u2013439. https:\/\/doi.org\/10.1007\/s10845-020-01580-3","journal-title":"Journal of Intelligent Manufacturing"},{"key":"7195_CR42","doi-asserted-by":"publisher","first-page":"116254","DOI":"10.1016\/j.cam.2024.116254","volume":"457","author":"Y Zakharova","year":"2025","unstructured":"Zakharova, Y., & Sakhno, M. (2025). Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint. Journal of Computational and Applied Mathematics, 457, 116254. https:\/\/doi.org\/10.1016\/j.cam.2024.116254","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"6","key":"7195_CR43","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s10845-009-0374-7","volume":"22","author":"M Zandieh","year":"2011","unstructured":"Zandieh, M., & Karimi, N. (2011). An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22(6), 979\u2013989. https:\/\/doi.org\/10.1007\/s10845-009-0374-7","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"12","key":"7195_CR44","doi-asserted-by":"publisher","first-page":"4984","DOI":"10.1109\/TSMC.2019.2916088","volume":"50","author":"B Zhang","year":"2020","unstructured":"Zhang, B., Pan, Q.-K., Gao, L., Meng, L.-L., Li, X.-Y., & Peng, K.-K. (2020). A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(12), 4984\u20134999. https:\/\/doi.org\/10.1109\/TSMC.2019.2916088","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"7195_CR45","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.cie.2018.09.007","volume":"125","author":"G Zhang","year":"2018","unstructured":"Zhang, G., & Xing, K. (2018). Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment. Computers & Industrial Engineering, 125, 423\u2013433. https:\/\/doi.org\/10.1016\/j.cie.2018.09.007","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"7195_CR46","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/JAS.2020.1003539","volume":"8","author":"Z Zhao","year":"2021","unstructured":"Zhao, Z., Liu, S., Zhou, M., & Abusorrah, A. (2021). Dual-objective mixed integer linear program and memetic algorithm for an industrial group scheduling problem. IEEE\/CAA Journal of Automatica Sinica, 8(6), 1199\u20131209. https:\/\/doi.org\/10.1109\/JAS.2020.1003539","journal-title":"IEEE\/CAA Journal of Automatica Sinica"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-026-07195-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-026-07195-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-026-07195-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T08:54:03Z","timestamp":1780044843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-026-07195-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,13]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["7195"],"URL":"https:\/\/doi.org\/10.1007\/s10479-026-07195-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,13]]},"assertion":[{"value":"9 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}