{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:45:45Z","timestamp":1765370745221,"version":"3.46.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-08081-1","type":"journal-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:18:53Z","timestamp":1765354733000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic three-stage decomposition-based multi-objective approach for solving hybrid flow shop scheduling problem with consistent sublots"],"prefix":"10.1007","volume":"81","author":[{"given":"Junjie","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miaocong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuguo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiongbing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"key":"8081_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1\u201318. https:\/\/doi.org\/10.1016\/j.ejor.2009.09.024","journal-title":"Eur J Oper Res"},{"key":"8081_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cor.2019.06.009","volume":"111","author":"H \u00d6ztop","year":"2019","unstructured":"\u00d6ztop H, Fatih Tasgetiren M, Eliiyi DT, Pan Q-K (2019) Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput Oper Res 111:177\u2013196. https:\/\/doi.org\/10.1016\/j.cor.2019.06.009","journal-title":"Comput Oper Res"},{"key":"8081_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.amc.2017.01.004","volume":"303","author":"Q-K Pan","year":"2017","unstructured":"Pan Q-K, Gao L, Li X-Y, Gao K-Z (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112. https:\/\/doi.org\/10.1016\/j.amc.2017.01.004","journal-title":"Appl Math Comput"},{"key":"8081_CR4","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ejor.2019.10.004","volume":"282","author":"P Alfaro-Fern\u00e1ndez","year":"2020","unstructured":"Alfaro-Fern\u00e1ndez P, Ruiz R, Pagnozzi F, St\u00fctzle T (2020) Automatic algorithm design for hybrid flowshop scheduling problems. Eur J Oper Res 282:835\u2013845. https:\/\/doi.org\/10.1016\/j.ejor.2019.10.004","journal-title":"Eur J Oper Res"},{"key":"8081_CR5","doi-asserted-by":"publisher","first-page":"3905","DOI":"10.1080\/00207543.2019.1636324","volume":"58","author":"L Meng","year":"2020","unstructured":"Meng L, Zhang C, Shao X et al (2020) More MILP models for hybrid flow shop scheduling problem and its extended problems. Int J Prod Res 58:3905\u20133930. https:\/\/doi.org\/10.1080\/00207543.2019.1636324","journal-title":"Int J Prod Res"},{"key":"8081_CR6","doi-asserted-by":"publisher","first-page":"105527","DOI":"10.1016\/j.knosys.2020.105527","volume":"194","author":"W Shao","year":"2020","unstructured":"Shao W, Shao Z, Pi D (2020) Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowl-Based Syst 194:105527. https:\/\/doi.org\/10.1016\/j.knosys.2020.105527","journal-title":"Knowl-Based Syst"},{"key":"8081_CR7","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1086\/294867","volume":"39","author":"S Reiter","year":"1966","unstructured":"Reiter S (1966) A system for managing job-shop production. J Bus 39:371. https:\/\/doi.org\/10.1086\/294867","journal-title":"J Bus"},{"key":"8081_CR8","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.cie.2019.07.011","volume":"136","author":"JM Novas","year":"2019","unstructured":"Novas JM (2019) Production scheduling and lot streaming at flexible job-shops environments using constraint programming. Comput Ind Eng 136:252\u2013264. https:\/\/doi.org\/10.1016\/j.cie.2019.07.011","journal-title":"Comput Ind Eng"},{"key":"8081_CR9","doi-asserted-by":"publisher","first-page":"107305","DOI":"10.1016\/j.asoc.2021.107305","volume":"106","author":"B Zhang","year":"2021","unstructured":"Zhang B, Pan Q-K, Meng L-L et al (2021) A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Appl Soft Comput 106:107305. https:\/\/doi.org\/10.1016\/j.asoc.2021.107305","journal-title":"Appl Soft Comput"},{"key":"8081_CR10","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"8081_CR11","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 et al (2020) A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem. IEEE Trans Syst Man Cybern Syst 50:4984\u20134999. https:\/\/doi.org\/10.1109\/TSMC.2019.2916088","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"8081_CR12","doi-asserted-by":"publisher","first-page":"107819","DOI":"10.1016\/j.knosys.2021.107819","volume":"238","author":"B Zhang","year":"2022","unstructured":"Zhang B, Pan Q, Meng L et al (2022) An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowl-Based Syst 238:107819. https:\/\/doi.org\/10.1016\/j.knosys.2021.107819","journal-title":"Knowl-Based Syst"},{"key":"8081_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ins.2020.08.070","volume":"556","author":"Y Xie","year":"2021","unstructured":"Xie Y, Qiao J, Wang D, Yin B (2021) A novel decomposition-based multiobjective evolutionary algorithm using improved multiple adaptive dynamic selection strategies. Inf Sci 556:472\u2013494. https:\/\/doi.org\/10.1016\/j.ins.2020.08.070","journal-title":"Inf Sci"},{"key":"8081_CR14","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.066","volume":"187","author":"J Liu","year":"2008","unstructured":"Liu J (2008) Single-job lot streaming in m \u2212 1 two-stage hybrid flowshops. Eur J Oper Res 187:1171\u20131183. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.066","journal-title":"Eur J Oper Res"},{"key":"8081_CR15","doi-asserted-by":"publisher","first-page":"100600","DOI":"10.1016\/j.swevo.2019.100600","volume":"52","author":"J Li","year":"2020","unstructured":"Li J, Tao X, Jia B et al (2020) Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots. Swarm Evol Comput 52:100600. https:\/\/doi.org\/10.1016\/j.swevo.2019.100600","journal-title":"Swarm Evol Comput"},{"key":"8081_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.ijpe.2004.04.005","volume":"96","author":"W Zhang","year":"2005","unstructured":"Zhang W, Yin C, Liu J, Linn RJ (2005) Multi-job lot streaming to minimize the mean completion time in m\u2009\u2212\u20091 hybrid flowshops. Int J Prod Econ 96:189\u2013200. https:\/\/doi.org\/10.1016\/j.ijpe.2004.04.005","journal-title":"Int J Prod Econ"},{"key":"8081_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.jmsy.2014.06.002","volume":"33","author":"B Naderi","year":"2014","unstructured":"Naderi B, Yazdani M (2014) A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times. J Manuf Syst 33:647\u2013653. https:\/\/doi.org\/10.1016\/j.jmsy.2014.06.002","journal-title":"J Manuf Syst"},{"key":"8081_CR18","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1080\/21681015.2015.1126653","volume":"33","author":"M Nejati","year":"2016","unstructured":"Nejati M, Mahdavi I, Hassanzadeh R, Mahdavi-Amiri N (2016) Lot streaming in a two-stage assembly hybrid flow shop scheduling problem with a work shift constraint. J Ind Prod Eng 33:459\u2013471. https:\/\/doi.org\/10.1080\/21681015.2015.1126653","journal-title":"J Ind Prod Eng"},{"key":"8081_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jmsy.2017.04.018","volume":"44","author":"JL Lalitha","year":"2017","unstructured":"Lalitha JL, Mohan N, Pillai VM (2017) Lot streaming in [N-1](1)+N(m) hybrid flow shop. J Manuf Syst 44:12\u201321. https:\/\/doi.org\/10.1016\/j.jmsy.2017.04.018","journal-title":"J Manuf Syst"},{"key":"8081_CR20","doi-asserted-by":"publisher","first-page":"121309","DOI":"10.1016\/j.eswa.2023.121309","volume":"237","author":"G Tian","year":"2024","unstructured":"Tian G, Wang W, Zhang H et al (2024) Multi-objective optimization of energy-efficient remanufacturing system scheduling problem with lot-streaming production mode. Expert Syst Appl 237:121309. https:\/\/doi.org\/10.1016\/j.eswa.2023.121309","journal-title":"Expert Syst Appl"},{"key":"8081_CR21","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2024.2373426","author":"H Tang","year":"2025","unstructured":"Tang H, Huang J, Ren C et al (2025) Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV based on deep reinforcement learning. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2024.2373426","journal-title":"Int J Prod Res"},{"key":"8081_CR22","doi-asserted-by":"publisher","first-page":"4076","DOI":"10.1080\/00207543.2023.2253925","volume":"62","author":"C Li","year":"2024","unstructured":"Li C, Han Y, Zhang B et al (2024) A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots. Int J Prod Res 62:4076\u20134096. https:\/\/doi.org\/10.1080\/00207543.2023.2253925","journal-title":"Int J Prod Res"},{"key":"8081_CR23","doi-asserted-by":"publisher","first-page":"121594","DOI":"10.1016\/j.eswa.2023.121594","volume":"237","author":"Y Zhang","year":"2024","unstructured":"Zhang Y, Li J, Xu Y, Duan P (2024) Multi-population cooperative multi-objective evolutionary algorithm for sequence-dependent group flow shop with consistent sublots. Expert Syst Appl 237:121594. https:\/\/doi.org\/10.1016\/j.eswa.2023.121594","journal-title":"Expert Syst Appl"},{"key":"8081_CR24","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1080\/0951192X.2013.820348","volume":"27","author":"SF Attar","year":"2014","unstructured":"Attar SF, Mohammadi M, Tavakkoli-Moghaddam R, Yaghoubi S (2014) Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. Int J Comput Integr Manuf 27:450\u2013469. https:\/\/doi.org\/10.1080\/0951192X.2013.820348","journal-title":"Int J Comput Integr Manuf"},{"key":"8081_CR25","doi-asserted-by":"publisher","first-page":"1742","DOI":"10.1080\/0305215X.2022.2124406","volume":"55","author":"J-H Han","year":"2023","unstructured":"Han J-H, Lee J-Y (2023) Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing. Eng Optim 55:1742\u20131759. https:\/\/doi.org\/10.1080\/0305215X.2022.2124406","journal-title":"Eng Optim"},{"key":"8081_CR26","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.3390\/pr11061846","volume":"11","author":"S-O Shim","year":"2023","unstructured":"Shim S-O, Jeong B, Bang J-Y, Park J (2023) Scheduling jobs with a limited waiting time constraint on a hybrid flowshop. Processes 11:1846. https:\/\/doi.org\/10.3390\/pr11061846","journal-title":"Processes"},{"key":"8081_CR27","doi-asserted-by":"publisher","first-page":"108745","DOI":"10.1016\/j.cie.2022.108745","volume":"173","author":"B G\u00fcrsoy Y\u0131lmaz","year":"2022","unstructured":"G\u00fcrsoy Y\u0131lmaz B, Faruk Y\u0131lmaz \u00d6 (2022) Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint. Comput Ind Eng 173:108745. https:\/\/doi.org\/10.1016\/j.cie.2022.108745","journal-title":"Comput Ind Eng"},{"key":"8081_CR28","doi-asserted-by":"publisher","first-page":"11240","DOI":"10.3390\/app112311240","volume":"11","author":"J-H Han","year":"2021","unstructured":"Han J-H, Lee J-Y (2021) Heuristics for a two-stage assembly-type flow shop with limited waiting time constraints. Appl Sci 11:11240. https:\/\/doi.org\/10.3390\/app112311240","journal-title":"Appl Sci"},{"key":"8081_CR29","doi-asserted-by":"publisher","first-page":"323","DOI":"10.3390\/a14110323","volume":"14","author":"B Jeong","year":"2021","unstructured":"Jeong B, Han J-H, Lee J-Y (2021) Metaheuristics for a flow shop scheduling problem with urgent jobs and limited waiting times. Algorithms 14:323. https:\/\/doi.org\/10.3390\/a14110323","journal-title":"Algorithms"},{"key":"8081_CR30","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1109\/TASE.2019.2947398","volume":"18","author":"M Qin","year":"2021","unstructured":"Qin M, Wang R, Shi Z et al (2021) A genetic programming-based scheduling approach for hybrid flow shop with a batch processor and waiting time constraint. IEEE Trans Autom Sci Eng 18:94\u2013105. https:\/\/doi.org\/10.1109\/TASE.2019.2947398","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"8081_CR31","doi-asserted-by":"publisher","first-page":"4226","DOI":"10.1080\/00207543.2023.2254858","volume":"62","author":"F Zhao","year":"2024","unstructured":"Zhao F, Zhang H, Wang L et al (2024) A multi-objective discrete differential evolution algorithm for energy-efficient distributed blocking flow shop scheduling problem. Int J Prod Res 62:4226\u20134244. https:\/\/doi.org\/10.1080\/00207543.2023.2254858","journal-title":"Int J Prod Res"},{"key":"8081_CR32","doi-asserted-by":"publisher","first-page":"102647","DOI":"10.1016\/j.aei.2024.102647","volume":"62","author":"Y Yao","year":"2024","unstructured":"Yao Y, Wang Q, Wang C et al (2024) Knowledge-based multi-objective evolutionary algorithm for energy-efficient flexible job shop scheduling with mobile robot transportation. Adv Eng Inform 62:102647. https:\/\/doi.org\/10.1016\/j.aei.2024.102647","journal-title":"Adv Eng Inform"},{"key":"8081_CR33","doi-asserted-by":"publisher","first-page":"121570","DOI":"10.1016\/j.eswa.2023.121570","volume":"237","author":"W Zhang","year":"2024","unstructured":"Zhang W, Li C, Gen M et al (2024) A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem. Expert Syst Appl 237:121570. https:\/\/doi.org\/10.1016\/j.eswa.2023.121570","journal-title":"Expert Syst Appl"},{"key":"8081_CR34","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","volume":"32","author":"J Deng","year":"2017","unstructured":"Deng J, Wang L (2017) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32:121\u2013131. https:\/\/doi.org\/10.1016\/j.swevo.2016.06.002","journal-title":"Swarm Evol Comput"},{"key":"8081_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2022.08.009","volume":"309","author":"JS Neufeld","year":"2023","unstructured":"Neufeld JS, Schulz S, Buscher U (2023) A systematic review of multi-objective hybrid flow shop scheduling. Eur J Oper Res 309:1\u201323. https:\/\/doi.org\/10.1016\/j.ejor.2022.08.009","journal-title":"Eur J Oper Res"},{"key":"8081_CR36","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1162\/evco_a_00269","volume":"28","author":"M Li","year":"2020","unstructured":"Li M, Yao X (2020) What weights work for you? Adapting weights for any Pareto front shape in decomposition-based evolutionary multiobjective optimisation. Evol Comput 28:227\u2013253. https:\/\/doi.org\/10.1162\/evco_a_00269","journal-title":"Evol Comput"},{"key":"8081_CR37","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s11227-025-06935-2","volume":"81","author":"C Shao","year":"2025","unstructured":"Shao C, Yu Z, Ding H et al (2025) A random flight\u2013follow leader and reinforcement learning approach for flexible job shop scheduling problem. J Supercomput 81:478. https:\/\/doi.org\/10.1007\/s11227-025-06935-2","journal-title":"J Supercomput"},{"key":"8081_CR38","doi-asserted-by":"publisher","first-page":"4799","DOI":"10.1007\/s11227-021-04050-6","volume":"78","author":"F Alkhateeb","year":"2022","unstructured":"Alkhateeb F, Abed-alguni BH, Al-rousan MH (2022) Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem. J Supercomput 78:4799\u20134826. https:\/\/doi.org\/10.1007\/s11227-021-04050-6","journal-title":"J Supercomput"},{"key":"8081_CR39","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","volume":"73","author":"Y Xu","year":"2024","unstructured":"Xu Y, Zhang M, Yang M, Wang D (2024) Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. J Manuf Syst 73:334\u2013348. https:\/\/doi.org\/10.1016\/j.jmsy.2024.02.007","journal-title":"J Manuf Syst"},{"key":"8081_CR40","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1080\/00207543.2022.2093680","volume":"61","author":"B Zhang","year":"2023","unstructured":"Zhang B, Pan Q, Meng L et al (2023) A decomposition-based multi-objective evolutionary algorithm for hybrid flowshop rescheduling problem with consistent sublots. Int J Prod Res 61:1013\u20131038. https:\/\/doi.org\/10.1080\/00207543.2022.2093680","journal-title":"Int J Prod Res"},{"key":"8081_CR41","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jmsy.2024.01.006","volume":"73","author":"Y Zhu","year":"2024","unstructured":"Zhu Y, Tang Q, Cheng L et al (2024) Solving multi-objective hybrid flowshop lot-streaming scheduling with consistent and limited sub-lots via a knowledge-based memetic algorithm. J Manuf Syst 73:106\u2013125. https:\/\/doi.org\/10.1016\/j.jmsy.2024.01.006","journal-title":"J Manuf Syst"},{"key":"8081_CR42","doi-asserted-by":"publisher","first-page":"7904","DOI":"10.1080\/00207543.2024.2333943","volume":"62","author":"W Wang","year":"2024","unstructured":"Wang W, Zhang B, Jiang X et al (2024) Decomposition-based multi-objective approach for a green hybrid flowshop rescheduling problem with consistent sublots. Int J Prod Res 62:7904\u20137932. https:\/\/doi.org\/10.1080\/00207543.2024.2333943","journal-title":"Int J Prod Res"},{"key":"8081_CR43","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s11227-025-06938-z","volume":"81","author":"Q Zhang","year":"2025","unstructured":"Zhang Q, Zhen T (2025) Improved Jaya algorithm for energy-efficient distributed heterogeneous permutation flow shop scheduling. J Supercomput 81:434. https:\/\/doi.org\/10.1007\/s11227-025-06938-z","journal-title":"J Supercomput"},{"key":"8081_CR44","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet C, Bigeon J, Cartier D et al (2021) Performance indicators in multiobjective optimization. Eur J Oper Res 292:397\u2013422. https:\/\/doi.org\/10.1016\/j.ejor.2020.11.016","journal-title":"Eur J Oper Res"},{"key":"8081_CR45","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas G (2009) Effective implementation of the \u03b5-constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455\u2013465. https:\/\/doi.org\/10.1016\/j.amc.2009.03.037","journal-title":"Appl Math Comput"},{"key":"8081_CR46","doi-asserted-by":"crossref","unstructured":"Riquelme N, Von L\u00fccken C, Baran B (2015) Performance metrics in multi-objective optimization. In: 2015 Latin American computing conference (CLEI), pp 1\u201311","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"8081_CR47","doi-asserted-by":"publisher","first-page":"120402","DOI":"10.1016\/j.eswa.2023.120402","volume":"228","author":"F Xie","year":"2023","unstructured":"Xie F, Li L, Li L et al (2023) A decomposition-based multi-objective Jaya algorithm for lot-streaming job shop scheduling with variable sublots and intermingling setting. Expert Syst Appl 228:120402. https:\/\/doi.org\/10.1016\/j.eswa.2023.120402","journal-title":"Expert Syst Appl"},{"key":"8081_CR48","doi-asserted-by":"publisher","first-page":"107654","DOI":"10.1016\/j.asoc.2021.107654","volume":"111","author":"L He","year":"2021","unstructured":"He L, Li W, Chiong R et al (2021) Optimising the job-shop scheduling problem using a multi-objective Jaya algorithm. Appl Soft Comput 111:107654. https:\/\/doi.org\/10.1016\/j.asoc.2021.107654","journal-title":"Appl Soft Comput"},{"key":"8081_CR49","doi-asserted-by":"publisher","first-page":"15217","DOI":"10.1007\/s10462-023-10526-z","volume":"56","author":"H Ma","year":"2023","unstructured":"Ma H, Zhang Y, Sun S et al (2023) A comprehensive survey on NSGA-II for multi-objective optimization and applications. Artif Intell Rev 56:15217\u201315270. https:\/\/doi.org\/10.1007\/s10462-023-10526-z","journal-title":"Artif Intell Rev"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08081-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-08081-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08081-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:18:54Z","timestamp":1765354734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-08081-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,10]]},"references-count":49,"journal-issue":{"issue":"18","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["8081"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-08081-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,10]]},"assertion":[{"value":"15 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study did not involve human participants, human data, or human tissue. Therefore, no ethics approval was required. This statement is not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"No individual person\u2019s data in any form (including any individual details, images or videos) were used in this manuscript. Hence, no specific consent for publication was obtained. This statement is not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"1641"}}