{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:57:41Z","timestamp":1780473461296,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003035","name":"Aase og Ejnar Danielsens Fond","doi-asserted-by":"publisher","award":["No. CSTB2022NSCQ-MSX1337"],"award-info":[{"award-number":["No. CSTB2022NSCQ-MSX1337"]}],"id":[{"id":"10.13039\/501100003035","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Youth Project of Science and Technology Research Program of Chongqing Education Commission","award":["No. KJQN202200820"],"award-info":[{"award-number":["No. KJQN202200820"]}]},{"name":"the Key Platform Open Project of Chongqing Technology and Business University","award":["No. KFJJ2022027"],"award-info":[{"award-number":["No. KFJJ2022027"]}]},{"name":"the High-level Talent Introduction Project of Chongqing Technology and Business University","award":["No. 2256014"],"award-info":[{"award-number":["No. 2256014"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07586-z","type":"journal-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T09:41:45Z","timestamp":1751449305000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic multi-objective flexible job-shop scheduling via dynamic dual attention network-based deep reinforcement learning"],"prefix":"10.1007","volume":"81","author":[{"given":"Dan","family":"Zeng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanbin","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinjun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"7586_CR1","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-follow 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":"7586_CR2","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":"7586_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jii.2024.100598","volume":"39","author":"AM Fathollahi-Fard","year":"2024","unstructured":"Fathollahi-Fard AM, Woodward L, Akhrif O (2024) A distributed permutation flow-shop considering sustainability criteria and real-time scheduling. J Ind Inf Integr 39:100598. https:\/\/doi.org\/10.1016\/j.jii.2024.100598","journal-title":"J Ind Inf Integr"},{"issue":"2","key":"7586_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Sethi JR (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129. https:\/\/doi.org\/10.1287\/moor.1.2.117","journal-title":"Math Oper Res"},{"key":"7586_CR5","doi-asserted-by":"publisher","unstructured":"Luo S, Zhang L, Fan Y (2021) Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2021.107489","DOI":"10.1016\/j.cie.2021.107489"},{"key":"7586_CR6","doi-asserted-by":"publisher","unstructured":"Zhu J, Wang H, Zhang T (2020) A deep reinforcement learning approach to the flexible flowshop scheduling problem with makespan minimization. In: 2020 IEEE 9th Data Driven Control and Learning Systems Conference (DDCLS), pp 1220\u20131225, https:\/\/doi.org\/10.1109\/DDCLS49620.2020.9275080","DOI":"10.1109\/DDCLS49620.2020.9275080"},{"key":"7586_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cie.2016.03.011","volume":"96","author":"N Kundakci","year":"2016","unstructured":"Kundakci N, Kulak O (2016) Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Comput Ind Eng 96:31\u201351. https:\/\/doi.org\/10.1016\/j.cie.2016.03.011","journal-title":"Comput Ind Eng"},{"key":"7586_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.compind.2015.10.001","volume":"81","author":"D Tang","year":"2016","unstructured":"Tang D, Dai M, Salido MA et al (2016) Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization. Comput Ind 81:82\u201395. https:\/\/doi.org\/10.1016\/j.compind.2015.10.001","journal-title":"Comput Ind"},{"key":"7586_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.aime.2024.100144","volume":"9","author":"MK Hajji","year":"2024","unstructured":"Hajji MK, Hamlaoui O, Hadda H (2024) A simulated annealing metaheuristic approach to hybrid flow shop scheduling problem. Adv Ind Manuf Eng 9:100144. https:\/\/doi.org\/10.1016\/j.aime.2024.100144","journal-title":"Adv Ind Manuf Eng"},{"key":"7586_CR10","doi-asserted-by":"publisher","DOI":"10.3390\/computation11070137","author":"MK Hajji","year":"2023","unstructured":"Hajji MK, Hadda H, Dridi N (2023) Makespan minimization for the two-stage hybrid flow shop problem with dedicated machines: a comprehensive study of exact and heuristic approaches. Computation. https:\/\/doi.org\/10.3390\/computation11070137","journal-title":"Computation"},{"key":"7586_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.ejor.2019.11.016","volume":"283","author":"S Zhang","year":"2020","unstructured":"Zhang S, Li X, Zhang B et al (2020) Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system. Eur J Oper Res 283:441\u2013460. https:\/\/doi.org\/10.1016\/j.ejor.2019.11.016","journal-title":"Eur J Oper Res"},{"key":"7586_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107318","volume":"157","author":"W Xu","year":"2021","unstructured":"Xu W, Hu Y, Luo W et al (2021) A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission. Comput Ind Eng 157:107318. https:\/\/doi.org\/10.1016\/j.cie.2021.107318","journal-title":"Comput Ind Eng"},{"key":"7586_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.jmsy.2020.06.005","volume":"56","author":"A Baykaso\u011flu","year":"2020","unstructured":"Baykaso\u011flu A, Madeno\u011flu FS, Hamzaday\u0131 A (2020) Greedy randomized adaptive search for dynamic flexible job-shop scheduling. J Manuf Syst 56:425\u2013451. https:\/\/doi.org\/10.1016\/j.jmsy.2020.06.005","journal-title":"J Manuf Syst"},{"key":"7586_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107211","volume":"155","author":"K Li","year":"2021","unstructured":"Li K, Deng Q, Zhang L et al (2021) An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput Ind Eng 155:107211. https:\/\/doi.org\/10.1016\/j.cie.2021.107211","journal-title":"Comput Ind Eng"},{"issue":"21","key":"7586_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106208","volume":"91","author":"S Luo","year":"2020","unstructured":"Luo S (2020) Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl Soft Comput 91(21):106208. https:\/\/doi.org\/10.1016\/j.asoc.2020.106208","journal-title":"Appl Soft Comput"},{"key":"7586_CR16","doi-asserted-by":"publisher","first-page":"71752","DOI":"10.1109\/ACCESS.2020.2987820","volume":"8","author":"CL Liu","year":"2020","unstructured":"Liu CL, Chang CC, Tseng CJ (2020) Actor-critic deep reinforcement learning for solving job shop scheduling problems. IEEE Access 8:71752\u201371762. https:\/\/doi.org\/10.1109\/ACCESS.2020.2987820","journal-title":"IEEE Access"},{"key":"7586_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 Comput 131:109717. https:\/\/doi.org\/10.1016\/j.asoc.2022.109717","journal-title":"Appl Soft Comput"},{"issue":"2","key":"7586_CR18","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 Industr Inf 19(2):1600\u20131610. https:\/\/doi.org\/10.1109\/TII.2022.3189725","journal-title":"IEEE Trans Industr Inf"},{"key":"7586_CR19","doi-asserted-by":"publisher","unstructured":"Mohan J, Lanka K et al (2019) A review of dynamic job shop scheduling techniques. Proced Manuf. https:\/\/doi.org\/10.1016\/j.promfg.2019.02.006","DOI":"10.1016\/j.promfg.2019.02.006"},{"issue":"4","key":"7586_CR20","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","volume":"24","author":"L Nie","year":"2013","unstructured":"Nie L, Gao L, Li P et al (2013) A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates. J Intell Manuf 24(4):763\u2013774. https:\/\/doi.org\/10.1007\/s10845-012-0626-9","journal-title":"J Intell Manuf"},{"key":"7586_CR21","doi-asserted-by":"publisher","first-page":"108699","DOI":"10.1016\/j.engappai.2024.108699","volume":"134","author":"L Zhang","year":"2024","unstructured":"Zhang L, Yan Y, Hu Yaoguang (2024) Dynamic flexible scheduling with transportation constraints by multi-agent reinforcement learning. Eng Appl Artif Intell 134:108699. https:\/\/doi.org\/10.1016\/j.engappai.2024.108699","journal-title":"Eng Appl Artif Intell"},{"key":"7586_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102412","volume":"78","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Zhu H, Tang D et al (2022) Dynamic job shop scheduling based on deep reinforcement learning for multi-agent manufacturing systems. Robot Comput Integr Manuf 78:102412. https:\/\/doi.org\/10.1016\/j.rcim.2022.102412","journal-title":"Robot Comput Integr Manuf"},{"key":"7586_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2024.01.002","volume":"73","author":"Z Liu","year":"2024","unstructured":"Liu Z, Mao H, Sa G et al (2024) Dynamic job-shop scheduling using graph reinforcement learning with auxiliary strategy. J Manuf Syst 73:1\u201318. https:\/\/doi.org\/10.1016\/j.jmsy.2024.01.002","journal-title":"J Manuf Syst"},{"issue":"1","key":"7586_CR24","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/TII.2023.3272661","volume":"20","author":"K Lei","year":"2024","unstructured":"Lei K, Guo P, Wang Y et al (2024) Large-scale dynamic scheduling for flexible job-shop with random arrivals of new jobs by hierarchical reinforcement learning. IEEE Trans Industr Inf 20(1):1007\u20131018. https:\/\/doi.org\/10.1109\/TII.2023.3272661","journal-title":"IEEE Trans Industr Inf"},{"key":"7586_CR25","doi-asserted-by":"publisher","DOI":"10.3390\/pr11072018","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. https:\/\/doi.org\/10.3390\/pr11072018","journal-title":"Processes"},{"key":"7586_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108487","volume":"133","author":"S Lu","year":"2024","unstructured":"Lu S, Wang Y, Kong M et al (2024) A double deep q-network framework for a flexible job shop scheduling problem with dynamic job arrivals and urgent job insertions. Eng Appl Artif Intell 133:108487. https:\/\/doi.org\/10.1016\/j.engappai.2024.108487","journal-title":"Eng Appl Artif Intell"},{"key":"7586_CR27","unstructured":"Li A, Florensa C, Clavera I, et\u00a0al (2020) Sub-policy adaptation for hierarchical reinforcement learning. In: International Conference on Learning Representations"},{"issue":"1","key":"7586_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli F, Gori M, Tsoi AC et al (2009) The graph neural network model. IEEE Trans Neural Netw 20(1):61\u201380. https:\/\/doi.org\/10.1109\/TNN.2008.2005605","journal-title":"IEEE Trans Neural Netw"},{"key":"7586_CR29","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, et\u00a0al (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"7586_CR30","doi-asserted-by":"publisher","unstructured":"Brody S, Alon U, Yahav E (2021) How attentive are graph attention networks? arXiv preprint arXiv:2105.14491https:\/\/doi.org\/10.48550\/arXiv.2105.14491","DOI":"10.48550\/arXiv.2105.14491"},{"key":"7586_CR31","doi-asserted-by":"publisher","unstructured":"Wang R, Wang G, Sun J, et\u00a0al (2023) Flexible Job Shop Scheduling via Dual Attention Network Based Reinforcement Learning. https:\/\/doi.org\/10.48550\/arXiv.2305.05119","DOI":"10.48550\/arXiv.2305.05119"},{"key":"7586_CR32","doi-asserted-by":"publisher","unstructured":"Zhao Y, Chen Y, Wu J, et\u00a0al (2024) Dual dynamic attention network for flexible job scheduling with reinforcement learning. In: 2024 International Joint Conference on Neural Networks (IJCNN), IEEE, pp 1\u20138, https:\/\/doi.org\/10.1109\/IJCNN60899.2024.10649988","DOI":"10.1109\/IJCNN60899.2024.10649988"},{"issue":"13","key":"7586_CR33","doi-asserted-by":"publisher","first-page":"e77","DOI":"10.1093\/nar\/gkab349","volume":"49","author":"F Ullah","year":"2021","unstructured":"Ullah F, Ben-Hur A (2021) A self-attention model for inferring cooperativity between regulatory features. Nucleic Acids Res 49(13):e77\u2013e77. https:\/\/doi.org\/10.1093\/nar\/gkab349","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"7586_CR34","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1109\/TASE.2023.3248229","volume":"21","author":"W Song","year":"2023","unstructured":"Song W, Mi N, Li Q et al (2023) Stochastic economic lot scheduling via self-attention based deep reinforcement learning. IEEE Trans Autom Sci Eng 21(2):1457\u20131468. https:\/\/doi.org\/10.1109\/TASE.2023.3248229","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"7586_CR35","unstructured":"Vaswani A (2017) Attention is all you need. Advances in Neural Information Processing Systems"},{"key":"7586_CR36","unstructured":"Kool W, Van\u00a0Hoof H, Welling M (2018) Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475"},{"key":"7586_CR37","doi-asserted-by":"publisher","unstructured":"Schulman J, Wolski F, Dhariwal P, et\u00a0al (2017) Proximal policy optimization algorithms. Comput Sci Mach Learn.https:\/\/doi.org\/10.48550\/arXiv.1707.06347","DOI":"10.48550\/arXiv.1707.06347"},{"key":"7586_CR38","unstructured":"Schulman J, Moritz P, Levine S, et\u00a0al (2015) High-dimensional continuous control using generalized advantage estimation. arXiv e-prints arXiv:1506.02438"},{"key":"7586_CR39","unstructured":"Glorot X, Bengio Y (2010) Understanding the difficulty of training deep feedforward neural networks. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, JMLR Workshop and Conference Proceedings, pp 249\u2013256"},{"key":"7586_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107211","volume":"155","author":"K Li","year":"2021","unstructured":"Li K, Deng Q, Zhang L et al (2021) An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput Ind Eng 155:107211. https:\/\/doi.org\/10.1016\/j.cie.2021.107211","journal-title":"Comput Ind Eng"},{"key":"7586_CR41","unstructured":"Kingma D, Ba J (2014) Adam: A method for stochastic optimization. Computer Science https:\/\/doi.org\/10.48550\/arXiv.1412.6980"},{"key":"7586_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100664","volume":"54","author":"G Zhang","year":"2020","unstructured":"Zhang G, Hu Y, Sun J et al (2020) An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm Evol Comput 54:100664. https:\/\/doi.org\/10.1016\/j.swevo.2020.100664","journal-title":"Swarm Evol Comput"},{"key":"7586_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109719","volume":"130","author":"S Lu","year":"2022","unstructured":"Lu S, Ma C, Kong M et al (2022) Solving a stochastic hierarchical scheduling problem by VNS-based metaheuristic with locally assisted algorithms. Appl Soft Comput 130:109719. https:\/\/doi.org\/10.1016\/j.asoc.2022.109719","journal-title":"Appl Soft Comput"},{"key":"7586_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100601","volume":"51","author":"LP Cota","year":"2019","unstructured":"Cota LP, Guimar\u00e3es FG, Ribeiro RG et al (2019) An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem. Swarm Evol Comput 51:100601. https:\/\/doi.org\/10.1016\/j.swevo.2019.100601","journal-title":"Swarm Evol Comput"},{"key":"7586_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104207","volume":"101","author":"K Dehghan-Sanej","year":"2021","unstructured":"Dehghan-Sanej K, Eghbali-Zarch M, Tavakkoli-Moghaddam R et al (2021) Solving a new robust reverse job shop scheduling problem by meta-heuristic algorithms. Eng Appl Artif Intell 101:104207. https:\/\/doi.org\/10.1016\/j.engappai.2021.104207","journal-title":"Eng Appl Artif Intell"},{"key":"7586_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110658","volume":"146","author":"Y Li","year":"2023","unstructured":"Li Y, Liao C, Wang L et al (2023) A reinforcement learning-artificial bee colony algorithm for flexible job-shop scheduling problem with lot streaming. Appl Soft Comput 146:110658. https:\/\/doi.org\/10.1016\/j.asoc.2023.110658","journal-title":"Appl Soft Comput"},{"issue":"2","key":"7586_CR47","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 Industr Inf 19(2):1600\u20131610. https:\/\/doi.org\/10.1109\/TII.2022.3189725","journal-title":"IEEE Trans Industr Inf"},{"key":"7586_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102283","volume":"74","author":"Y Li","year":"2022","unstructured":"Li Y, Gu W, Yuan M et al (2022) Real-time data-driven dynamic scheduling for flexible job shop with insufficient transportation resources using hybrid deep q network. Robot Comput Integr Manuf 74:102283. https:\/\/doi.org\/10.1016\/j.rcim.2021.102283","journal-title":"Robot Comput Integr Manuf"},{"key":"7586_CR49","doi-asserted-by":"publisher","unstructured":"Wang Haoxiang, JLBhaba R. Sarker, 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","DOI":"10.1080\/00207543.2020.1794075"},{"key":"7586_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen R, Yang B, Li S et al (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng 149:106778. https:\/\/doi.org\/10.1016\/j.cie.2020.106778","journal-title":"Comput Ind Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07586-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07586-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07586-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T09:41:49Z","timestamp":1751449309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07586-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":50,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["7586"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07586-z","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"15 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 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":"No Conflict of interest exist in the submission of this manuscript, and the manuscript has been approved by all the authors for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The data involved in the database have obtained ethical approval. Source data, so there are no ethical issues and other Conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"1099"}}