{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:40:23Z","timestamp":1780674023514,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB4701300"],"award-info":[{"award-number":["2022YFB4701300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U22A2065"],"award-info":[{"award-number":["U22A2065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2021B1515120058"],"award-info":[{"award-number":["2021B1515120058"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06741-2","type":"journal-article","created":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T09:29:19Z","timestamp":1734254959000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Multi-objective flexible job-shop scheduling via graph attention network and reinforcement learning"],"prefix":"10.1007","volume":"81","author":[{"given":"Yuanhe","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjian","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanqing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,15]]},"reference":[{"key":"6741_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105731","volume":"142","author":"H Xiong","year":"2022","unstructured":"Xiong H, Shi S, Ren D et al (2022) A survey of job shop scheduling problem: the types and models. Comput Op Res 142:105731. https:\/\/doi.org\/10.1016\/j.cor.2022.105731","journal-title":"Comput Op Res"},{"issue":"10","key":"6741_CR2","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Op Res 35(10):3202\u20133212. https:\/\/doi.org\/10.1016\/j.cor.2007.02.014","journal-title":"Comput Op Res"},{"key":"6741_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","volume":"47","author":"S Jia","year":"2014","unstructured":"Jia S, Hu ZH (2014) Path-relinking tabu search for the multi-objective flexible job shop scheduling problem. Comput Op Res 47:11\u201326. https:\/\/doi.org\/10.1016\/j.cor.2014.01.010","journal-title":"Comput Op Res"},{"issue":"10","key":"6741_CR4","doi-asserted-by":"publisher","first-page":"3127","DOI":"10.1007\/s12555-023-0578-1","volume":"21","author":"B Jiang","year":"2023","unstructured":"Jiang B, Ma Y, Chen L et al (2023) A review on intelligent scheduling and optimization for flexible job shop. Int J Control, Autom Syst 21(10):3127\u20133150. https:\/\/doi.org\/10.1007\/s12555-023-0578-1","journal-title":"Int J Control, Autom Syst"},{"key":"6741_CR5","unstructured":"Li X, Tang F, Liu J et\u00a0al (2021) Auto: Adaptive congestion control based on multi-objective reinforcement learning for the satellite-ground integrated network. In: USENIX Annual Technical Conference, doi.org\/api.semanticscholar.org\/CorpusID:236992553"},{"issue":"4","key":"6741_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.23919\/CSMS.2021.0027","volume":"1","author":"L Wang","year":"2021","unstructured":"Wang L, Pan Z, Wang J (2021) A review of reinforcement learning based intelligent optimization for manufacturing scheduling. Complex Syst Model Simul 1(4):257\u2013270. https:\/\/doi.org\/10.23919\/CSMS.2021.0027","journal-title":"Complex Syst Model Simul"},{"issue":"2","key":"6741_CR7","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2023","unstructured":"Song W, Chen X, Li Q et al (2023) Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans Ind Inform 19(2):1600\u20131610. https:\/\/doi.org\/10.1109\/TII.2022.3189725","journal-title":"IEEE Trans Ind Inform"},{"key":"6741_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W et al (2022) A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Systems Appl 205:117796. https:\/\/doi.org\/10.1016\/j.eswa.2022.117796","journal-title":"Expert Systems Appl"},{"issue":"3","key":"6741_CR9","doi-asserted-by":"publisher","first-page":"3091","DOI":"10.1109\/TNNLS.2023.3306421","volume":"35","author":"R Wang","year":"2024","unstructured":"Wang R, Wang G, Sun J et al (2024) Flexible job shop scheduling via dual attention network-based reinforcement learning. IEEE Trans Neural Netw Learning Syst 35(3):3091\u20133102. https:\/\/doi.org\/10.1109\/TNNLS.2023.3306421","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"key":"6741_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101605","volume":"88","author":"C Su","year":"2024","unstructured":"Su C, Zhang C, Wang C et al (2024) Fast pareto set approximation for multi-objective flexible job shop scheduling via parallel preference-conditioned graph reinforcement learning. Swarm Evolut Computation 88:101605. https:\/\/doi.org\/10.1016\/j.swevo.2024.101605","journal-title":"Swarm Evolut Computation"},{"issue":"1","key":"6741_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.3390\/pr9010062","volume":"9","author":"X Sun","year":"2021","unstructured":"Sun X, Wang Y, Kang H et al (2021) Modified multi-crossover operator nsga-iii for solving low carbon flexible job shop scheduling problem. Processes 9(1):62. https:\/\/doi.org\/10.3390\/pr9010062","journal-title":"Processes"},{"key":"6741_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ijpe.2019.05.017","volume":"219","author":"S Mohammadi","year":"2020","unstructured":"Mohammadi S, Al-e-Hashem SM, Rekik Y (2020) An integrated production scheduling and delivery route planning with multi-purpose machines: a case study from a furniture manufacturing company. Int J Prod Econ 219:347\u2013359. https:\/\/doi.org\/10.1016\/j.ijpe.2019.05.017","journal-title":"Int J Prod Econ"},{"key":"6741_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105694","volume":"141","author":"A T\u00fcrky\u0131lmaz","year":"2022","unstructured":"T\u00fcrky\u0131lmaz A, Senvar O, \u00dcnal \u0130rem et al (2022) A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem. Comput Op Res 141:105694. https:\/\/doi.org\/10.1016\/j.cor.2021.105694","journal-title":"Comput Op Res"},{"key":"6741_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119375","volume":"215","author":"Y Wang","year":"2023","unstructured":"Wang Y, Ge J, Miao S et al (2023) Application of hybrid artificial bee colony algorithm based on load balancing in aerospace composite material manufacturing. Expert Syst Appl 215:119375. https:\/\/doi.org\/10.1016\/j.eswa.2022.119375","journal-title":"Expert Syst Appl"},{"key":"6741_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2024.05.018","volume":"75","author":"EH Haro","year":"2024","unstructured":"Haro EH, Avalos O, G\u00e1lvez J et al (2024) An integrated process planning and scheduling problem solved from an adaptive multi-objective perspective. J Manuf Syst 75:1\u201323. https:\/\/doi.org\/10.1016\/j.jmsy.2024.05.018","journal-title":"J Manuf Syst"},{"issue":"19","key":"6741_CR16","doi-asserted-by":"publisher","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","volume":"59","author":"H Wang","year":"2021","unstructured":"Wang H, Sarker BR, Li J, Li J (2021) Adaptive scheduling for assembly job shop with uncertain assembly times based on dual q-learning. Int J Prod Res 59(19):5867\u20135883. https:\/\/doi.org\/10.1080\/00207543.2020.1794075","journal-title":"Int J Prod Res"},{"key":"6741_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109717","volume":"131","author":"H Wang","year":"2022","unstructured":"Wang H, Cheng J, Liu C et al (2022) Multi-objective reinforcement learning framework for dynamic flexible job shop scheduling problem with uncertain events. Appl Soft Computing 131:109717. https:\/\/doi.org\/10.1016\/j.asoc.2022.109717","journal-title":"Appl Soft Computing"},{"issue":"7","key":"6741_CR18","doi-asserted-by":"publisher","first-page":"2018","DOI":"10.3390\/pr11072018","volume":"11","author":"Z Wu","year":"2023","unstructured":"Wu Z, Fan H, Sun Y et al (2023) Efficient multi-objective optimization on dynamic flexible job shop scheduling using deep reinforcement learning approach. Processes 11(7):2018. https:\/\/doi.org\/10.3390\/pr11072018","journal-title":"Processes"},{"key":"6741_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100632","volume":"53","author":"C Soto","year":"2020","unstructured":"Soto C, Dorronsoro B, Fraire H et al (2020) Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evolut Comput 53:100632. https:\/\/doi.org\/10.1016\/j.swevo.2019.100632","journal-title":"Swarm Evolut Comput"},{"issue":"11","key":"6741_CR20","doi-asserted-by":"publisher","first-page":"3027","DOI":"10.1080\/00207540600988105","volume":"46","author":"ZBH Wang Shi-Jin","year":"2008","unstructured":"Wang Shi-Jin ZBH, Li-Feng X (2008) A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem. Int J Prod Res 46(11):3027\u20133058. https:\/\/doi.org\/10.1080\/00207540600988105","journal-title":"Int J Prod Res"},{"key":"6741_CR21","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10845-014-0872-0","volume":"27","author":"MAF P\u00e9rez","year":"2016","unstructured":"P\u00e9rez MAF, Raupp FM (2016) A newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem. J Intell Manuf 27:409\u2013416. https:\/\/doi.org\/10.1007\/s10845-014-0872-0","journal-title":"J Intell Manuf"},{"key":"6741_CR22","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-010-2642-2","volume":"51","author":"X Wang","year":"2010","unstructured":"Wang X, Gao L, Zhang C et al (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manuf Tech 51:757\u2013767. https:\/\/doi.org\/10.1007\/s00170-010-2642-2","journal-title":"Int J Adv Manuf Tech"},{"key":"6741_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.resconrec.2016.12.001","volume":"128","author":"H Piroozfard","year":"2018","unstructured":"Piroozfard H, Wong KY, Wong WP (2018) Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm. Resour, Conserv Recycl 128:267\u2013283. https:\/\/doi.org\/10.1016\/j.resconrec.2016.12.001","journal-title":"Resour, Conserv Recycl"},{"key":"6741_CR24","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.jclepro.2018.10.289","volume":"209","author":"X Gong","year":"2019","unstructured":"Gong X, De Pessemier T, Martens L et al (2019) Energy- and labor-aware flexible job shop scheduling under dynamic electricity pricing: a many-objective optimization investigation. J Clean Prod 209:1078\u20131094. https:\/\/doi.org\/10.1016\/j.jclepro.2018.10.289","journal-title":"J Clean Prod"},{"key":"6741_CR25","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1007\/s00170-012-4701-3","volume":"67","author":"X Shao","year":"2013","unstructured":"Shao X, Liu W, Liu Q et al (2013) Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem. Int J Adv Manuf Technol 67:2885\u20132901. https:\/\/doi.org\/10.1007\/s00170-012-4701-3","journal-title":"Int J Adv Manuf Technol"},{"key":"6741_CR26","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1007\/s12555-018-0264-x","volume":"17","author":"S He","year":"2019","unstructured":"He S, Wu Y, Li Y (2019) Asymptotic stability of master-slave systems using sampled-data controller with time-delay. Int J Control, Autom Syst 17:1473\u20131482. https:\/\/doi.org\/10.1007\/s12555-018-0264-x","journal-title":"Int J Control, Autom Syst"},{"key":"6741_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2022.104466","volume":"123","author":"X Xi","year":"2022","unstructured":"Xi X, Wu Y, Xia C et al (2022) Feature fusion for object detection at one map. Image Vision Computing 123:104466. https:\/\/doi.org\/10.1016\/j.imavis.2022.104466","journal-title":"Image Vision Computing"},{"key":"6741_CR28","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1007\/s00170-015-8075-1","volume":"85","author":"MR Singh","year":"2016","unstructured":"Singh MR, Singh M, Mahapatra S et al (2016) Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol 85:2353\u20132366. https:\/\/doi.org\/10.1007\/s00170-015-8075-1","journal-title":"Int J Adv Manuf Technol"},{"key":"6741_CR29","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s00170-011-3665-z","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang L, Zhou G, Xu Y et al (2012) An enhanced pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int J Adv Manuf Technol 60:1111\u20131123. https:\/\/doi.org\/10.1007\/s00170-011-3665-z","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"6741_CR30","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Modell 38(3):1111\u20131132. https:\/\/doi.org\/10.1016\/j.apm.2013.07.038","journal-title":"Appl Math Modell"},{"key":"6741_CR31","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jclepro.2017.09.037","volume":"168","author":"Q Liu","year":"2017","unstructured":"Liu Q, Zhan M, Chekem FO et al (2017) A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint. J Clean Prod 168:668\u2013678. https:\/\/doi.org\/10.1016\/j.jclepro.2017.09.037","journal-title":"J Clean Prod"},{"issue":"6","key":"6741_CR32","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1504\/IJBIC.2015.073165","volume":"7","author":"S Karthikeyan","year":"2015","unstructured":"Karthikeyan S, Asokan P, Nickolas S et al (2015) A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int J Bio-Inspired Comput 7(6):386\u2013401. https:\/\/doi.org\/10.1504\/IJBIC.2015.073165","journal-title":"Int J Bio-Inspired Comput"},{"issue":"1","key":"6741_CR33","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans Autom Sci Eng 12(1):336\u2013353. https:\/\/doi.org\/10.1109\/TASE.2013.2274517","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"6741_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2020.02.004","volume":"55","author":"L Hu","year":"2020","unstructured":"Hu L, Liu Z, Hu W et al (2020) Petri-net-based dynamic scheduling of flexible manufacturing system via deep reinforcement learning with graph convolutional network. J Manuf Syst 55:1\u201314. https:\/\/doi.org\/10.1016\/j.jmsy.2020.02.004","journal-title":"J Manuf Syst"},{"key":"6741_CR35","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A et\u00a0al (2017) Graph attention networks. arXiv preprint arXiv:1710.10903https:\/\/doi.org\/10.48550\/arXiv.1710.10903","DOI":"10.48550\/arXiv.1710.10903"},{"key":"6741_CR36","doi-asserted-by":"crossref","unstructured":"Miettinen K (1999) Nonlinear multiobjective optimization, Springer Science Business Media 12","DOI":"10.1007\/978-1-4615-5563-6"},{"issue":"6","key":"6741_CR37","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TEVC.2016.2521175","volume":"20","author":"R Wang","year":"2016","unstructured":"Wang R, Zhang Q, Zhang T (2016) Decomposition-based algorithms using pareto adaptive scalarizing methods. IEEE Trans Evolut Comput 20(6):821\u2013837. https:\/\/doi.org\/10.1109\/TEVC.2016.2521175","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"6741_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TEVC.2016.2611642","volume":"22","author":"R Wang","year":"2018","unstructured":"Wang R, Zhou Z, Ishibuchi H et al (2018) Localized weighted sum method for many-objective optimization. IEEE Trans Evolut Comput 22(1):3\u201318. https:\/\/doi.org\/10.1109\/TEVC.2016.2611642","journal-title":"IEEE Trans Evolut Comput"},{"key":"6741_CR39","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2023.02.054","volume":"630","author":"L He","year":"2023","unstructured":"He L, Bai L, Yang X et al (2023) High-order graph attention network. Inform Sci 630:222\u2013234. https:\/\/doi.org\/10.1016\/j.ins.2023.02.054","journal-title":"Inform Sci"},{"key":"6741_CR40","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. Op Res Spektrum 15:205\u2013215. https:\/\/doi.org\/10.1007\/BF01719451","journal-title":"Op Res Spektrum"},{"issue":"3","key":"6741_CR41","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Op Res 41(3):157\u2013183. https:\/\/doi.org\/10.1007\/BF02023073","journal-title":"Ann Op Res"},{"issue":"4","key":"6741_CR42","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 Evolut Comput 18(4):577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evolut Comput"},{"key":"6741_CR43","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11277-012-0811-3","volume":"71","author":"S \u00d6zdemir","year":"2013","unstructured":"\u00d6zdemir S, Attea BA, Khalil \u00d6A (2013) Multi-objective evolutionary algorithm based on decomposition for energy efficient coverage in wireless sensor networks. Wirel Pers Commun 71:195\u2013215. https:\/\/doi.org\/10.1007\/s11277-012-0811-3","journal-title":"Wirel Pers Commun"},{"issue":"3","key":"6741_CR44","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) Sms-emoa: multiobjective selection based on dominated hypervolume. Eur J Op Res 181(3):1653\u20131669. https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","journal-title":"Eur J Op Res"},{"issue":"2","key":"6741_CR45","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2018.2855411","volume":"23","author":"K Li","year":"2019","unstructured":"Li K, Chen R, Fu G et al (2019) Two-archive evolutionary algorithm for constrained multiobjective optimization. IEEE Trans Evolut Comput 23(2):303\u2013315. https:\/\/doi.org\/10.1109\/TEVC.2018.2855411","journal-title":"IEEE Trans Evolut Comput"},{"issue":"5","key":"6741_CR46","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M et al (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evolut Comput 20(5):773\u2013791. https:\/\/doi.org\/10.1109\/TEVC.2016.2519378","journal-title":"IEEE Trans Evolut Comput"},{"key":"6741_CR47","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank J, Deb K (2020) Pymoo: multi-objective optimization in python. IEEE Access 8:89497\u201389509. https:\/\/doi.org\/10.1109\/ACCESS.2020.2990567","journal-title":"IEEE Access"},{"key":"6741_CR48","doi-asserted-by":"publisher","first-page":"5232518","DOI":"10.1155\/2017\/5232518","volume":"1","author":"Q Deng","year":"2017","unstructured":"Deng Q, Gong G, Gong X et al (2017) A bee evolutionary guiding nondominated sorting genetic algorithm ii for multiobjective flexible job-shop scheduling. Comput Intell Neurosci 1:5232518. https:\/\/doi.org\/10.1155\/2017\/5232518","journal-title":"Comput Intell Neurosci"},{"key":"6741_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106869","volume":"99","author":"Y An","year":"2021","unstructured":"An Y, Chen X, Li Y et al (2021) An improved non-dominated sorting biogeography-based optimization algorithm for the (hybrid) multi-objective flexible job-shop scheduling problem. Appl Soft Comput 99:106869. https:\/\/doi.org\/10.1016\/j.asoc.2020.106869","journal-title":"Appl Soft Comput"},{"issue":"2","key":"6741_CR50","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M et al (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evolut Comput 7(2):117\u2013132. https:\/\/doi.org\/10.1109\/TEVC.2003.810758","journal-title":"IEEE Trans Evolut Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06741-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06741-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06741-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T10:01:45Z","timestamp":1734256905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06741-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,15]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6741"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06741-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,15]]},"assertion":[{"value":"17 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2024","order":2,"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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"293"}}