{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T17:02:32Z","timestamp":1781110952439,"version":"3.54.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"27","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. U21B2029"],"award-info":[{"award-number":["No. U21B2029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014219","name":"National Science Fund for Distinguished Young Scholars","doi-asserted-by":"publisher","award":["No. 51825502"],"award-info":[{"award-number":["No. 51825502"]}],"id":[{"id":"10.13039\/501100014219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00521-024-10580-w","type":"journal-article","created":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:54:11Z","timestamp":1733014451000},"page":"22451-22471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid algorithm considering continuous transportation for flexible job shop scheduling problem with finite transportation resources"],"prefix":"10.1007","volume":"37","author":[{"given":"Qingzheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanbin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhimou","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youjie","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,1]]},"reference":[{"key":"10580_CR1","doi-asserted-by":"publisher","first-page":"168781401880409","DOI":"10.1177\/1687814018804096","volume":"10","author":"R Wu","year":"2018","unstructured":"Wu R, Li Y-B, Guo S-S, Xu W-X (2018) Solving the dual-resource constrained flexible job shop scheduling problem with learning effect by a hybrid genetic algorithm. Adv Mech Eng 10:1687814018804096. https:\/\/doi.org\/10.1177\/1687814018804096","journal-title":"Adv Mech Eng"},{"key":"10580_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jmsy.2023.01.004","volume":"67","author":"C Destouet","year":"2023","unstructured":"Destouet C, Tlahig H, Bettayeb B, Mazari B (2023) Flexible job shop scheduling problem under Industry 5.0: a survey on human reintegration, environmental consideration and resilience improvement. J Manuf Syst 67:155\u2013173. https:\/\/doi.org\/10.1016\/j.jmsy.2023.01.004","journal-title":"J Manuf Syst"},{"key":"10580_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119359","volume":"215","author":"K-X Sun","year":"2023","unstructured":"Sun K-X, Zheng D-B, Song H-H et al (2023) Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system. Expert Syst Appl 215:119359. https:\/\/doi.org\/10.1016\/j.eswa.2022.119359","journal-title":"Expert Syst Appl"},{"key":"10580_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X-Y Li","year":"2016","unstructured":"Li X-Y, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93\u2013110. https:\/\/doi.org\/10.1016\/j.ijpe.2016.01.016","journal-title":"Int J Prod Econ"},{"key":"10580_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Intl Trans Op Res 23:551\u2013591. https:\/\/doi.org\/10.1111\/itor.12199","journal-title":"Intl Trans Op Res"},{"key":"10580_CR6","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.jmsy.2022.01.014","volume":"62","author":"J-X Fan","year":"2022","unstructured":"Fan J-X, Zhang C-J, Liu Q-H et al (2022) An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules. J Manuf Syst 62:650\u2013667. https:\/\/doi.org\/10.1016\/j.jmsy.2022.01.014","journal-title":"J Manuf Syst"},{"key":"10580_CR7","doi-asserted-by":"publisher","first-page":"7881","DOI":"10.1007\/s00521-022-06890-6","volume":"34","author":"H Yan","year":"2022","unstructured":"Yan H, Du X-M, Xu L et al (2022) Toward intelligent clothes manufacturing: a systematic method for static and dynamic task allocation by genetic optimization. Neural Comput Appl 34:7881\u20137897. https:\/\/doi.org\/10.1007\/s00521-022-06890-6","journal-title":"Neural Comput Appl"},{"key":"10580_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jmsy.2023.07.004","volume":"70","author":"Q-H Liu","year":"2023","unstructured":"Liu Q-H, Wang C-Y, Li X-Y et al (2023) An improved genetic algorithm with modified critical path-based searching for integrated process planning and scheduling problem considering automated guided vehicle transportation task. J Manuf Syst 70:127\u2013136. https:\/\/doi.org\/10.1016\/j.jmsy.2023.07.004","journal-title":"J Manuf Syst"},{"key":"10580_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108672","volume":"173","author":"A Amirteimoori","year":"2022","unstructured":"Amirteimoori A, Mahdavi I, Solimanpur M et al (2022) A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation. Comput Ind Eng 173:108672. https:\/\/doi.org\/10.1016\/j.cie.2022.108672","journal-title":"Comput Ind Eng"},{"key":"10580_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102506","volume":"81","author":"Y-J Yao","year":"2023","unstructured":"Yao Y-J, Liu Q-H, Li X-Y, Gao L (2023) A novel MILP model for job shop scheduling problem with mobile robots. Robot Compu-Integr Manuf 81:102506. https:\/\/doi.org\/10.1016\/j.rcim.2022.102506","journal-title":"Robot Compu-Integr Manuf"},{"key":"10580_CR11","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K-Z Gao","year":"2019","unstructured":"Gao K-Z, Cao Z-G, Zhang L et al (2019) A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE-CAA J Automatica Sin 6:904\u2013916. https:\/\/doi.org\/10.1109\/JAS.2019.1911540","journal-title":"IEEE-CAA J Automatica Sin"},{"key":"10580_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108786","volume":"174","author":"X Li","year":"2022","unstructured":"Li X, Guo X, Tang H-T et al (2022) Survey of integrated flexible job shop scheduling problems. Comput Ind Eng 174:108786. https:\/\/doi.org\/10.1016\/j.cie.2022.108786","journal-title":"Comput Ind Eng"},{"key":"10580_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10845-009-0283-9","volume":"22","author":"N Singh","year":"2011","unstructured":"Singh N, Sarngadharan PV, Pal PK (2011) AGV scheduling for automated material distribution: a case study. J Intell Manuf 22:219\u2013228. https:\/\/doi.org\/10.1007\/s10845-009-0283-9","journal-title":"J Intell Manuf"},{"key":"10580_CR14","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.ejor.2021.08.008","volume":"298","author":"N Singh","year":"2022","unstructured":"Singh N, Dang Q-V, Akcay A et al (2022) A matheuristic for AGV scheduling with battery constraints. Eur J Oper Res 298:855\u2013873. https:\/\/doi.org\/10.1016\/j.ejor.2021.08.008","journal-title":"Eur J Oper Res"},{"key":"10580_CR15","doi-asserted-by":"publisher","first-page":"5675","DOI":"10.1080\/00207543.2021.1968526","volume":"60","author":"W Ren","year":"2022","unstructured":"Ren W, Yan Y, Hu Y, Guan Y (2022) Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints. Int J Prod Res 60:5675\u20135696. https:\/\/doi.org\/10.1080\/00207543.2021.1968526","journal-title":"Int J Prod Res"},{"key":"10580_CR16","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ejor.2022.09.006","volume":"306","author":"DBMM Fontes","year":"2023","unstructured":"Fontes DBMM, Homayouni SM, Gon\u00e7alves JF (2023) A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Eur J Oper Res 306:1140\u20131157. https:\/\/doi.org\/10.1016\/j.ejor.2022.09.006","journal-title":"Eur J Oper Res"},{"key":"10580_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1504\/IJCAT.2020.111603","volume":"64","author":"Y-Q Liu","year":"2020","unstructured":"Liu Y-Q, Jing H, Liu X, Lv Y-L (2020) An improved hybrid error control path tracking intelligent algorithm for omnidirectional AGV on ROS. Int J Comput Appl Technol 64:115\u2013125. https:\/\/doi.org\/10.1504\/IJCAT.2020.111603","journal-title":"Int J Comput Appl Technol"},{"key":"10580_CR18","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1007\/s12555-014-0553-y","volume":"14","author":"PS Pratama","year":"2016","unstructured":"Pratama PS, Nguyen TH, Kim HK et al (2016) Positioning and obstacle avoidance of automatic guided vehicle in partially known environment. Int J Control Autom Syst 14:1572\u20131581. https:\/\/doi.org\/10.1007\/s12555-014-0553-y","journal-title":"Int J Control Autom Syst"},{"key":"10580_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105517","volume":"136","author":"Q-V Dang","year":"2021","unstructured":"Dang Q-V, Singh N, Adan I et al (2021) Scheduling heterogeneous multi-load AGVs with battery constraints. Comput Oper Res 136:105517. https:\/\/doi.org\/10.1016\/j.cor.2021.105517","journal-title":"Comput Oper Res"},{"key":"10580_CR20","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s00521-016-2495-1","volume":"29","author":"Z-C Liu","year":"2018","unstructured":"Liu Z-C, Hou L-Y, Shi Y-J et al (2018) A co-evolutionary design methodology for complex AGV system. Neural Comput Appl 29:959\u2013974. https:\/\/doi.org\/10.1007\/s00521-016-2495-1","journal-title":"Neural Comput Appl"},{"key":"10580_CR21","doi-asserted-by":"publisher","first-page":"5813","DOI":"10.1007\/s00521-022-07023-9","volume":"34","author":"T Ren","year":"2022","unstructured":"Ren T, Luo T-Y, Li S-X et al (2022) Review on R&D task integrated management of intelligent manufacturing equipment. Neural Comput Appl 34:5813\u20135837. https:\/\/doi.org\/10.1007\/s00521-022-07023-9","journal-title":"Neural Comput Appl"},{"key":"10580_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4523","volume":"33","author":"S Bansal","year":"2022","unstructured":"Bansal S, Aggarwal H, Aggarwal M (2022) A systematic review of task scheduling approaches in fog computing. Trans Emerg Telecommun Technol 33:e4523. https:\/\/doi.org\/10.1002\/ett.4523","journal-title":"Trans Emerg Telecommun Technol"},{"key":"10580_CR23","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1007\/s00521-015-1828-9","volume":"26","author":"A Mortazavi","year":"2015","unstructured":"Mortazavi A, Khamseh AA, Naderi B (2015) A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems. Neural Comput Appl 26:1709\u20131723. https:\/\/doi.org\/10.1007\/s00521-015-1828-9","journal-title":"Neural Comput Appl"},{"key":"10580_CR24","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.apm.2016.09.022","volume":"41","author":"S Karimi","year":"2017","unstructured":"Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Appl Math Model 41:667\u2013682. https:\/\/doi.org\/10.1016\/j.apm.2016.09.022","journal-title":"Appl Math Model"},{"key":"10580_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","volume":"59","author":"M Dai","year":"2019","unstructured":"Dai M, Tang D-B, Giret A, Salido MA (2019) Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot Comput-Integr Manuf 59:143\u2013157. https:\/\/doi.org\/10.1016\/j.rcim.2019.04.006","journal-title":"Robot Comput-Integr Manuf"},{"key":"10580_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2022.100680","volume":"35","author":"T-H Jiang","year":"2022","unstructured":"Jiang T-H, Zhu H-Q, Liu L, Gong Q-T (2022) Energy-conscious flexible job shop scheduling problem considering transportation time and deterioration effect simultaneously. Sust Comput 35:100680. https:\/\/doi.org\/10.1016\/j.suscom.2022.100680","journal-title":"Sust Comput"},{"key":"10580_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104307","volume":"103","author":"M Li","year":"2021","unstructured":"Li M, Lei D-M (2021) An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times. Eng Appl Artif Intell 103:104307. https:\/\/doi.org\/10.1016\/j.engappai.2021.104307","journal-title":"Eng Appl Artif Intell"},{"key":"10580_CR28","unstructured":"Deroussi L, Norre S (2010) Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: International conference on metaheuristics and nature inspired computing, Djerba, Island Tunisia, pp 1\u20132"},{"key":"10580_CR29","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00170-010-2820-2","volume":"53","author":"MV Satish Kumar","year":"2011","unstructured":"Satish Kumar MV, Janardhana R, Rao CSP (2011) Simultaneous scheduling of machines and vehicles in an FMS environment with alternative routing. Int J Adv Manuf Technol 53:339\u2013351. https:\/\/doi.org\/10.1007\/s00170-010-2820-2","journal-title":"Int J Adv Manuf Technol"},{"key":"10580_CR30","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1287\/opre.43.6.1058","volume":"43","author":"\u00dc Bilge","year":"1995","unstructured":"Bilge \u00dc, Ulusoy G (1995) A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper Res 43:1058\u20131070. https:\/\/doi.org\/10.1287\/opre.43.6.1058","journal-title":"Oper Res"},{"key":"10580_CR31","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","volume":"39","author":"Q Zhang","year":"2012","unstructured":"Zhang Q, Manier H, Manier M-A (2012) A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput Oper Res 39:1713\u20131723. https:\/\/doi.org\/10.1016\/j.cor.2011.10.007","journal-title":"Comput Oper Res"},{"key":"10580_CR32","doi-asserted-by":"crossref","unstructured":"Zhang Q, Manier H, Manier M-A (2013) Metaheuristics for job shop scheduling with transportation. In: Metaheuristics for production scheduling, pp 465\u2013493","DOI":"10.1002\/9781118731598.ch17"},{"key":"10580_CR33","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1080\/00207543.2013.828164","volume":"52","author":"Q Zhang","year":"2014","unstructured":"Zhang Q, Manier H, Manier M-A (2014) A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints. Int J Prod Res 52:985\u20131002. https:\/\/doi.org\/10.1080\/00207543.2013.828164","journal-title":"Int J Prod Res"},{"key":"10580_CR34","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-12970-9_13","volume-title":"Swarm intelligence based optimization","author":"L Deroussi","year":"2014","unstructured":"Deroussi L (2014) A hybrid PSO applied to the flexible job shop with transport. In: Siarry P, Idoumghar L, Lepagnot J (eds) Swarm intelligence based optimization. Springer, Cham, pp 115\u2013122"},{"key":"10580_CR35","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.cie.2016.02.024","volume":"102","author":"HE Nouri","year":"2016","unstructured":"Nouri HE, Driss OB, Gh\u00e9dira K (2016) Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Comput Ind Eng 102:488\u2013501. https:\/\/doi.org\/10.1016\/j.cie.2016.02.024","journal-title":"Comput Ind Eng"},{"key":"10580_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102198","volume":"72","author":"J Yan","year":"2021","unstructured":"Yan J, Liu Z-F, Zhang C-X et al (2021) Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop. Robot Comput-Integr Manuf 72:102198. https:\/\/doi.org\/10.1016\/j.rcim.2021.102198","journal-title":"Robot Comput-Integr Manuf"},{"key":"10580_CR37","doi-asserted-by":"publisher","DOI":"10.1063\/1.5090012","volume":"2070","author":"SM Homayouni","year":"2019","unstructured":"Homayouni SM, Fontes DBMM (2019) Joint scheduling of production and transport with alternative job routing in flexible manufacturing systems. AIP Conf Proc 2070:020045. https:\/\/doi.org\/10.1063\/1.5090012","journal-title":"AIP Conf Proc"},{"key":"10580_CR38","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10898-021-00992-6","volume":"79","author":"SM Homayouni","year":"2021","unstructured":"Homayouni SM, Fontes DBMM (2021) Production and transport scheduling in flexible job shop manufacturing systems. J Glob Optim 79:463\u2013502. https:\/\/doi.org\/10.1007\/s10898-021-00992-6","journal-title":"J Glob Optim"},{"key":"10580_CR39","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12878","author":"SM Homayouni","year":"2020","unstructured":"Homayouni SM, Fontes DBMM, Gon\u00e7alves JF (2020) A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. Intl Trans in Op Res. https:\/\/doi.org\/10.1111\/itor.12878","journal-title":"Intl Trans in Op Res"},{"key":"10580_CR40","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1007\/s10845-020-01537-6","volume":"31","author":"A Ham","year":"2020","unstructured":"Ham A (2020) Transfer-robot task scheduling in flexible job shop. J Intell Manuf 31:1783\u20131793. https:\/\/doi.org\/10.1007\/s10845-020-01537-6","journal-title":"J Intell Manuf"},{"key":"10580_CR41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3219238","author":"Z-X Pan","year":"2022","unstructured":"Pan Z-X, Wang L, Zheng J et al (2022) A learning-based multi-population evolutionary optimization for flexible job shop scheduling problem with finite transportation resources. IEEE Trans Evol Computat. https:\/\/doi.org\/10.1109\/TEVC.2022.3219238","journal-title":"IEEE Trans Evol Computat"},{"key":"10580_CR42","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2024.3356255","author":"Y Yao","year":"2024","unstructured":"Yao Y, Liu Q, Fu L et al (2024) A novel mathematical model for the flexible job-shop scheduling problem with limited automated guided vehicles. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2024.3356255","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10580-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-10580-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10580-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T14:07:34Z","timestamp":1757340454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-10580-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,1]]},"references-count":42,"journal-issue":{"issue":"27","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10580"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-10580-w","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,1]]},"assertion":[{"value":"9 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2024","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 no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article is original and has not been submitted to any other journal for simultaneous consideration.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}