{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:03:43Z","timestamp":1752192223679,"version":"3.41.2"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100017630","name":"Humanities and Social Sciences Youth Foundation, Ministry of Education","doi-asserted-by":"publisher","award":["21YJC630087"],"award-info":[{"award-number":["21YJC630087"]}],"id":[{"id":"10.13039\/501100017630","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07581-4","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T09:08:08Z","timestamp":1751965688000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A multi-strategy adaptive cultural algorithm for scheduling high-dimensional reentrant hybrid flowshops with incompatible job families"],"prefix":"10.1007","volume":"81","author":[{"given":"Jiawei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,8]]},"reference":[{"key":"7581_CR1","doi-asserted-by":"crossref","unstructured":"Becerra RL, Coello CAC (2005) A cultural algorithm for solving the job shop scheduling problem. In: Knowledge incorporation in evolutionary computation. Springer, Berlin, pp 37\u201355","DOI":"10.1007\/978-3-540-44511-1_3"},{"issue":"3","key":"7581_CR2","doi-asserted-by":"publisher","first-page":"1924","DOI":"10.1016\/j.eswa.2007.02.027","volume":"34","author":"J-S Chen","year":"2008","unstructured":"Chen J-S, Pan JC-H, Wu C-K (2008) Hybrid tabu search for re-entrant per890 mutation flow-shop scheduling problem. Expert Syst Appl 34(3):1924\u20131930. https:\/\/doi.org\/10.1016\/j.eswa.2007.02.027","journal-title":"Expert Syst Appl"},{"issue":"5","key":"7581_CR3","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.12011\/1000-6788(2015)5-1187","volume":"35","author":"T Chen","year":"2015","unstructured":"Chen T, Qin Y, Wan J, Wang D, Liu B (2015) Re-entrant flexible scheduling: models, algorithms and applications. Syst Eng Theory Pract 35(5):1187\u20131201. https:\/\/doi.org\/10.12011\/1000-6788(2015)5-1187","journal-title":"Syst Eng Theory Pract"},{"issue":"3","key":"7581_CR4","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","volume":"61","author":"H-M Cho","year":"2011","unstructured":"Cho H-M, Bae S-J, Kim J, Jeong I-J (2011) Bi-objective scheduling for reentrant hybrid flow shop using pareto genetic algorithm. Comput Ind Eng 61(3):529\u2013541. https:\/\/doi.org\/10.1016\/j.cie.2011.04.008","journal-title":"Comput Ind Eng"},{"key":"7581_CR5","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s11227-025-07177-y","volume":"81","author":"J Cui","year":"2025","unstructured":"Cui J, Zhou H, Yan Q, Huang J, Wang M, Yang X, Li Q (2025) An improved multi-objective honey badger algorithm based on global searching strategy. J Supercomput 81:693. https:\/\/doi.org\/10.1007\/s11227-025-07177-y","journal-title":"J Supercomput"},{"issue":"4","key":"7581_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"7581_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiob jective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"7581_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106288","volume":"141","author":"V Fernandez-Viagas","year":"2020","unstructured":"Fernandez-Viagas V, Framinan JM (2020) Design of a testbed for hybrid flow shop scheduling with identical machines. Comput Ind Eng 141:106288. https:\/\/doi.org\/10.1016\/j.cie.2020.106288","journal-title":"Comput Ind Eng"},{"key":"7581_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s11227-025-07004-4","volume":"81","author":"Z Guo","year":"2025","unstructured":"Guo Z, Liu G, Jiang F (2025) Chinese pangolin optimizer: a novel bio-inspired metaheuristic for solving optimization problems. J Supercomput 81:517. https:\/\/doi.org\/10.1007\/s11227-025-07004-4","journal-title":"J Supercomput"},{"issue":"2","key":"7581_CR10","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.ejor.2025.02.009","volume":"324","author":"X He","year":"2025","unstructured":"He X, Pan Q-K, Gao L, Neufeld JS, Gupta JN (2025) Minimising makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times. Eur J Oper Res 324(2):436\u2013453. https:\/\/doi.org\/10.1016\/j.ejor.2025.02.009","journal-title":"Eur J Oper Res"},{"key":"7581_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101455","volume":"84","author":"Y Kuang","year":"2024","unstructured":"Kuang Y, Wu X, Chen Z, Li W (2024) A two-stage cross-neighborhood search algorithm bridging different solution representation spaces for solving the hybrid flow shop scheduling problem. Swarm Evol Comput 84:101455. https:\/\/doi.org\/10.1016\/j.swevo.2023.101455","journal-title":"Swarm Evol Comput"},{"key":"7581_CR12","doi-asserted-by":"publisher","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. Comput Oper 159:106360. https:\/\/doi.org\/10.1016\/j.cor.2023.106360","journal-title":"Comput Oper"},{"key":"7581_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.1219933","volume":"238","author":"X Li","year":"2024","unstructured":"Li X, Zhang Z, Sun W, Liu Y, Tang J (2024) Parallel dynamic NSGA-II with multi-population search for rescheduling of seru production considering schedule changes under different dynamic events. Expert Syst Appl 238:121993. https:\/\/doi.org\/10.1016\/j.eswa.2023.1219933","journal-title":"Expert Syst Appl"},{"key":"7581_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s11227-024-06741-2","volume":"81","author":"Y Li","year":"2025","unstructured":"Li Y, Zhong W, Wu Y (2025) Multi-objective flexible job-shop scheduling via graph attention network and reinforcement learning. J Supercomput 81:293. https:\/\/doi.org\/10.1007\/s11227-024-06741-2","journal-title":"J Supercomput"},{"key":"7581_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.109995","volume":"189","author":"C-C Lin","year":"2024","unstructured":"Lin C-C, Peng Y-C, Chang Y-S, Chang C-H (2024) Reentrant hybrid flow shop scheduling with stockers in automated material handling systems using deep reinforcement learning. Comput Ind Eng 189:109995. https:\/\/doi.org\/10.1016\/j.cie.2024.109995","journal-title":"Comput Ind Eng"},{"key":"7581_CR16","doi-asserted-by":"crossref","unstructured":"Liu ST, Yang DA, He FB (2021) An improved cultural algorithm for scheduling of precedent tasks. In: 2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID), pp 169\u2013173","DOI":"10.1109\/AIID51893.2021.9456558"},{"key":"7581_CR17","unstructured":"Lu H, Zhang X, Yang S (2020) A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (ICLR), vol 13, pp 9680\u20139694"},{"key":"7581_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100846","volume":"62","author":"A Maheri","year":"2021","unstructured":"Maheri A, Jalili S, Hosseinzadeh Y, Khani R, Miryahyavi M (2021) A comprehensive survey on cultural algorithms. Swarm Evol Comput 62:100846. https:\/\/doi.org\/10.1016\/j.swevo.2021.100846","journal-title":"Swarm Evol Comput"},{"key":"7581_CR19","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s11227-025-07030-2","volume":"81","author":"Z Maria","year":"2025","unstructured":"Maria Z, Urtzi O, Xabier B, Arkaitz A, Olaizola IG, Basilio S, Giuseppe L (2025) Exploring multi-agent reinforcement learning for unrelated parallel machine scheduling. J Supercomput 81:521. https:\/\/doi.org\/10.1007\/s11227-025-07030-2","journal-title":"J Supercomput"},{"key":"7581_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111880","volume":"296","author":"SO Oladejo","year":"2024","unstructured":"Oladejo SO, Ekwe SO, Mirjalili S (2024) The hiking optimization algorithm: a novel human-based metaheuristic approach. Knowl-Based Syst 296:111880. https:\/\/doi.org\/10.1016\/j.knosys.2024.111880","journal-title":"Knowl-Based Syst"},{"key":"7581_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110303","volume":"193","author":"W Qi","year":"2024","unstructured":"Qi W, Pei X, Zhao H (2024) A semiconductor wafer manufacturing system scheduling start-up and decision mechanism considering bottleneck drift char acteristics. Comput Ind Eng 193:110303. https:\/\/doi.org\/10.1016\/j.cie.2024.110303","journal-title":"Comput Ind Eng"},{"issue":"2","key":"7581_CR22","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398\u2013417. https:\/\/doi.org\/10.1109\/TEVC.2008.927706","journal-title":"IEEE Trans Evol Comput"},{"key":"7581_CR23","unstructured":"Reynolds RG (1994) An introduction to cultural algorithms. In: Proceedings of the Third Annual Conference on Evolutionary Programming. World Scientific, Singapore, pp 131\u2013139"},{"key":"7581_CR24","unstructured":"Sutton RS, McAllester DA, Singh SP, Mansour Y (2000) Policy gradient methods for reinforcement learning with function approximation. In: Proceedings of the 12th International Conference on Neural Information Processing Systems. MIT Press, Cambridge, pp 1057\u20131063"},{"issue":"11","key":"7581_CR25","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.13196\/j.cims.2015.11.015","volume":"21","author":"Q Tang","year":"2015","unstructured":"Tang Q, Zheng P, Zhang LZ, Zhang Q, Li C (2015) Multi-buffered steel making production scheduling with heuristic rules and memetic algorithm. Comput Integr Manuf Syst 21(11):2955\u20132963. https:\/\/doi.org\/10.13196\/j.cims.2015.11.015","journal-title":"Comput Integr Manuf Syst"},{"key":"7581_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124874","volume":"255","author":"S Wang","year":"2024","unstructured":"Wang S, Feng Y, Li X, Zhang G (2024) Memetic discrete differential evolution with domain knowledge for blocking scheduling distributed flow shop with lot streaming constraints. Expert Syst Appl 255:124874. https:\/\/doi.org\/10.1016\/j.eswa.2024.124874","journal-title":"Expert Syst Appl"},{"key":"7581_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2024.102401","volume":"60","author":"S Wang","year":"2024","unstructured":"Wang S, Li X, Gao L, Li J (2024) A multi-disjunctive-graph model-based memetic algorithm for the distributed job shop scheduling problem. Adv Eng Inf 60:102401. https:\/\/doi.org\/10.1016\/j.aei.2024.102401","journal-title":"Adv Eng Inf"},{"issue":"1","key":"7581_CR28","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, Chu F, Lu X, Weng Z, Liang J (2024) Hybrid flow shop scheduling with learning effects and release dates to minimize the makespan. IEEE Trans Syst Man Cybern 54(1):365\u2013378. https:\/\/doi.org\/10.1109\/TSMC.2023.3305089","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"1\u20132","key":"7581_CR29","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1080\/00207543.2023.2188646","volume":"62","author":"X Wang","year":"2024","unstructured":"Wang X, Ren T, Bai D, Chu F, Yu Y, Meng F, Wu C-C (2024) Scheduling a multi-agent flow shop with two scenarios and release dates. Int J Prod Res 62(1\u20132):421\u2013443. https:\/\/doi.org\/10.1080\/00207543.2023.2188646","journal-title":"Int J Prod Res"},{"key":"7581_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2024.109163","volume":"269","author":"Y Wang","year":"2024","unstructured":"Wang Y, Xia T, Xu Y, Ding Y, Zheng M, Pan E, Xi L (2024) Joint optimization of flexible job shop scheduling and preventive maintenance under high-frequency production switching. Int J Prod Econ 269:109163. https:\/\/doi.org\/10.1016\/j.ijpe.2024.109163","journal-title":"Int J Prod Econ"},{"key":"7581_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.109688","volume":"140","author":"J Wu","year":"2025","unstructured":"Wu J, Liu Y (2025) A modified multi-agent proximal policy optimization algorithm for multi-objective dynamic partial-re-entrant hybrid flow shop scheduling problem. Eng Appl Artif Intell 140:109688. https:\/\/doi.org\/10.1016\/j.engappai.2024.109688","journal-title":"Eng Appl Artif Intell"},{"key":"7581_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120893","volume":"232","author":"X Wu","year":"2023","unstructured":"Wu X, Xie Z (2023) Improved MOEA\/D with local search for solving multi stage distributed reentrant hybrid flow shop scheduling problem. Expert Syst Appl 232:120893. https:\/\/doi.org\/10.1016\/j.eswa.2023.120893","journal-title":"Expert Syst Appl"},{"key":"7581_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118278","volume":"209","author":"X Wu","year":"2022","unstructured":"Wu X, Yan X, Wang L (2022) Optimizing job release and scheduling jointly in a reentrant hybrid flow shop. Expert Syst Appl 209:118278. https:\/\/doi.org\/10.1016\/j.eswa.2022.118278","journal-title":"Expert Syst Appl"},{"key":"7581_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2025.126713","volume":"272","author":"F Xiong","year":"2025","unstructured":"Xiong F, Chen S, Xiong N, Jing L (2025) Scheduling distributed heterogeneous non-permutation flowshop to minimize the total weighted tardiness. Expert Syst Appl 272:126713. https:\/\/doi.org\/10.1016\/j.eswa.2025.126713","journal-title":"Expert Syst Appl"},{"key":"7581_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101836","volume":"93","author":"Y Xu","year":"2025","unstructured":"Xu Y, Wang D, Zhang M, Yang M, Liang C (2025) Quantum particle swarm optimization with chaotic encoding schemes for flexible job-shop scheduling problem. Swarm Evol Comput 93:101836. https:\/\/doi.org\/10.1016\/j.swevo.2024.101836","journal-title":"Swarm Evol Comput"},{"issue":"12","key":"7581_CR36","doi-asserted-by":"publisher","first-page":"2218","DOI":"10.13195\/j.kzyjc.2017.0907","volume":"33","author":"H Xuan","year":"2018","unstructured":"Xuan H, Li B, Luo S, Wang X (2018) Reentrant hybrid flowshop scheduling problem based on total weighted completion time. Control Decis 33(12):2218\u20132226. https:\/\/doi.org\/10.13195\/j.kzyjc.2017.0907","journal-title":"Control Decis"},{"key":"7581_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107800","volume":"163","author":"X Yan","year":"2022","unstructured":"Yan X, Wu X (2022) IMOEA\/D to optimize job release problem for a reentrant hybrid flow shop. Comput Ind Eng 163:107800. https:\/\/doi.org\/10.1016\/j.cie.2021.107800","journal-title":"Comput Ind Eng"},{"key":"7581_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106833","volume":"173","author":"Y Yang","year":"2025","unstructured":"Yang Y, Qian B, Li Z, Hu R, Wang L (2025) Q-learning based hyper heuristic with clustering strategy for combinatorial optimization: a case study on permutation flow-shop scheduling problem. Comput Oper 173:106833. https:\/\/doi.org\/10.1016\/j.cor.2024.106833","journal-title":"Comput Oper"},{"key":"7581_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101544","volume":"87","author":"Y Yao","year":"2024","unstructured":"Yao Y, Li X, Gao L (2024) A DQN-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited AGVs. Swarm Evol Comput 87:101544. https:\/\/doi.org\/10.1016\/j.swevo.2024.101544","journal-title":"Swarm Evol Comput"},{"issue":"8","key":"7581_CR40","doi-asserted-by":"publisher","first-page":"190","DOI":"10.12005\/orms.2019.0191","volume":"28","author":"Y Yao","year":"2019","unstructured":"Yao Y, Ye C, Yang F (2019) Solving bi-objective reentrant hybrid flow shop scheduling problems by a hybrid discrete grey wolf opti mizer. Oper Res Manag Sci 28(8):190\u2013199. https:\/\/doi.org\/10.12005\/orms.2019.0191","journal-title":"Oper Res Manag Sci"},{"key":"7581_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101479","volume":"85","author":"Z Zhang","year":"2024","unstructured":"Zhang Z, Shao Z, Shao W, Chen J, Pi D (2024) MRLM: a meta-reinforcement learning-based metaheuristic for hybrid flow-shop scheduling problem with learning and forgetting effects. Swarm Evol Comput 85:101479. https:\/\/doi.org\/10.1016\/j.swevo.2024.101479","journal-title":"Swarm Evol Comput"},{"key":"7581_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.112436","volume":"167","author":"C Zhao","year":"2024","unstructured":"Zhao C, Wu L (2024) A multi-strategy fruit fly optimization algorithm for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Appl Soft Comput 167:112436. https:\/\/doi.org\/10.1016\/j.asoc.2024.112436","journal-title":"Appl Soft Comput"},{"issue":"5","key":"7581_CR43","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1109\/TSMC.2024.3358383","volume":"54","author":"F Zhao","year":"2024","unstructured":"Zhao F, Zhuang C, Wang L, Dong C (2024) An iterative greedy algorithm with Q-learning mechanism for the multiobjective distributed no-idle permutation flowshop scheduling. IEEE Trans Syst Man Cybern Syst 54(5):3207\u20133219. https:\/\/doi.org\/10.1109\/TSMC.2024.3358383","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"7581_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109802","volume":"187","author":"Y Zhao","year":"2024","unstructured":"Zhao Y, Luo X, Zhang Y (2024) The application of heterogeneous graph neural network and deep reinforcement learning in hybrid flow shop scheduling problem. Comput Ind Eng 187:109802. https:\/\/doi.org\/10.1016\/j.cie.2023.109802","journal-title":"Comput Ind Eng"},{"issue":"3","key":"7581_CR45","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1109\/TASE.2021.3062994","volume":"19","author":"Z Zhao","year":"2022","unstructured":"Zhao Z, Zhou M, Liu S (2022) Iterated greedy algorithms for flow-shop scheduling problems: a tutorial. IEEE Trans Autom Sci Eng 19(3):1941\u20131959. https:\/\/doi.org\/10.1109\/TASE.2021.3062994","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"7581_CR46","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s40747-023-01147-8","volume":"10","author":"Q Zheng","year":"2024","unstructured":"Zheng Q, Zhang Y, Tian H, He L (2024) A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers. Complex Intell Syst 10:781\u2013809. https:\/\/doi.org\/10.1007\/s40747-023-01147-8","journal-title":"Complex Intell Syst"},{"key":"7581_CR47","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1007\/s11227-024-05915-2","volume":"80","author":"K Zhou","year":"2024","unstructured":"Zhou K, Tan C, Wu Y, Yang B, Long X (2024) Research on low-carbon flexible job shop scheduling problem based on improved Grey Wolf Algorithm. J Supercomput 80:12123\u201312153. https:\/\/doi.org\/10.1007\/s11227-024-05915-2","journal-title":"J Supercomput"},{"issue":"2","key":"7581_CR48","doi-asserted-by":"publisher","first-page":"122","DOI":"10.13245\/j.hust.230213","volume":"51","author":"G Zhu","year":"2023","unstructured":"Zhu G, Jia H (2023) Multi-objective reentrant scheduling problem for semiconductor workshop. J Huazhong Univ Sci Technol Nat Sci Ed 51(2):122\u2013130. https:\/\/doi.org\/10.13245\/j.hust.230213","journal-title":"J Huazhong Univ Sci Technol Nat Sci Ed"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07581-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07581-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07581-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:17:50Z","timestamp":1752139070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07581-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,8]]},"references-count":48,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["7581"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07581-4","relation":{},"ISSN":["1573-0484"],"issn-type":[{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2025,7,8]]},"assertion":[{"value":"14 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1122"}}