{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T00:08:17Z","timestamp":1780531697346,"version":"3.54.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"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":["62173216"],"award-info":[{"award-number":["62173216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s12293-025-00449-3","type":"journal-article","created":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T03:41:29Z","timestamp":1742614889000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving multi-objective energy-efficient flexible job shop problems by a dual-level NSGA-II algorithm"],"prefix":"10.1007","volume":"17","author":[{"given":"Junqing","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weimeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiake","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"449_CR1","doi-asserted-by":"crossref","unstructured":"Ghasemi A, Farajzadeh F, Heavey C, Fowler J, Papadopoulos CT (2024) Simulation optimization applied to production scheduling in the era of industry 4.0: A review and future roadmap. J Ind Inf Integr, 100599.","DOI":"10.1016\/j.jii.2024.100599"},{"issue":"12","key":"449_CR2","doi-asserted-by":"publisher","first-page":"7291","DOI":"10.1109\/TSMC.2024.3449413","volume":"54","author":"J Li","year":"2024","unstructured":"Li J, Li J, Gao K, Duan P (2024) A hybrid graph-based imitation learning method for a realistic distributed hybrid flow shop with family setup time. IEEE Trans Syst, Man, Cybern: Syst 54(12):7291\u20137304. https:\/\/doi.org\/10.1109\/TSMC.2024.3449413","journal-title":"IEEE Trans Syst, Man, Cybern: Syst"},{"key":"449_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106919","volume":"175","author":"H Song","year":"2025","unstructured":"Song H, Li J, Du Z, Yu X, Xu Y, Zheng Z, Li J (2025) A Q-learning driven multi-objective evolutionary algorithm for worker fatigue dual-resource-constrained distributed hybrid flow shop. Comput Op Res 175:106919","journal-title":"Comput Op Res"},{"key":"449_CR4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2025.3543770","author":"X Chen","year":"2025","unstructured":"Chen X, Li J, Wang Z, Chen Q, Gao K, Pan Q (2025) Optimizing dynamic flexible job shop scheduling using an evolutionary multi-task optimization framework and genetic programming. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2025.3543770","journal-title":"IEEE Trans Evol Comput"},{"key":"449_CR5","doi-asserted-by":"publisher","first-page":"101619","DOI":"10.1016\/j.swevo.2024.101619","volume":"89","author":"J Li","year":"2024","unstructured":"Li J, Li J, Gao K, Ying X (2024) A double-Q network collaborative multi-objective optimization algorithm for precast scheduling with curing constraints. Swarm Evolut Comput 89:101619. https:\/\/doi.org\/10.1016\/j.swevo.2024.101619","journal-title":"Swarm Evolut Comput"},{"issue":"2","key":"449_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"449_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s12293-022-00364-x","volume":"14","author":"Q Liu","year":"2022","unstructured":"Liu Q, Li X, Gao L, Wang G (2022) A multiobjective memetic algorithm for integrated process planning and scheduling problem in distributed heterogeneous manufacturing systems. Memetic Computing 14(2):193\u2013209","journal-title":"Memetic Computing"},{"issue":"2","key":"449_CR8","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","volume":"265","author":"L Shen","year":"2018","unstructured":"Shen L, Dauz\u00e8re-P\u00e9r\u00e8s S, Neufeld JS (2018) Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur J Oper Res 265(2):503\u2013516","journal-title":"Eur J Oper Res"},{"key":"449_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106032","volume":"200","author":"J-Q Li","year":"2020","unstructured":"Li J-Q, Deng J-W, Li C-Y, Han Y-Y, Tian J, Zhang B, Wang C-G (2020) An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times. Knowl-Based Syst 200:106032","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"449_CR10","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TNNLS.2022.3208942","volume":"35","author":"Y Du","year":"2024","unstructured":"Du Y, Li J, Li C, Duan P (2024) A reinforcement learning approach for flexible job shop scheduling problem with crane transportation and setup times. IEEE Trans Neural Netw Learn Syst 35(4):5695\u20135709","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"3","key":"449_CR11","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.ejor.2023.07.036","volume":"312","author":"L Berterotti\u00e8re","year":"2024","unstructured":"Berterotti\u00e8re L, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2024) Flexible job-shop scheduling with transportation resources. Eur J Oper Res 312(3):890\u2013909","journal-title":"Eur J Oper Res"},{"key":"449_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102198","volume":"72","author":"J Yan","year":"2021","unstructured":"Yan J, Liu Z, Zhang C, Zhang T, Zhang Y, Yang C (2021) Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop. Robot Comput-Integr Manuf 72:102198","journal-title":"Robot Comput-Integr Manuf"},{"key":"449_CR13","doi-asserted-by":"crossref","unstructured":"Li R, Gong W, Lu C, Wang L (2022) A learning-based memetic algorithm for energy-efficient flexible job shop scheduling with type-2 fuzzy processing time. IEEE Trans Evolutionary Comput","DOI":"10.1016\/j.swevo.2022.101139"},{"issue":"5","key":"449_CR14","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TFUZZ.2019.2895562","volume":"27","author":"L Sun","year":"2019","unstructured":"Sun L, Lin L, Gen M, Li H (2019) A hybrid cooperative coevolution algorithm for fuzzy flexible job shop scheduling. IEEE Trans Fuzzy Syst 27(5):1008\u20131022","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"449_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:106208","journal-title":"Appl Soft Comput"},{"issue":"18","key":"449_CR16","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(18):5675\u20135696","journal-title":"Int J Prod Res"},{"key":"449_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106863","volume":"149","author":"RH Caldeira","year":"2020","unstructured":"Caldeira RH, Gnanavelbabu A, Vaidyanathan T (2020) An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput Ind Eng 149:106863","journal-title":"Comput Ind Eng"},{"key":"449_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100594","volume":"51","author":"Z Wang","year":"2019","unstructured":"Wang Z, Zhang J, Yang S (2019) An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals. Swarm Evol Comput 51:100594","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"449_CR19","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, Zhang J, Meng X, Qian L (2024) Large-scale dynamic scheduling for flexible job-shop with random arrivals of new jobs by hierarchical reinforcement learning. IEEE Trans Ind Inf 20(1):1007\u20131018. https:\/\/doi.org\/10.1109\/TII.2023.3272661","journal-title":"IEEE Trans Ind Inf"},{"key":"449_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109255","volume":"180","author":"Y Gui","year":"2023","unstructured":"Gui Y, Tang D, Zhu H, Zhang Y, Zhang Z (2023) Dynamic scheduling for flexible job shop using a deep reinforcement learning approach. Comput Ind Eng 180:109255","journal-title":"Comput Ind Eng"},{"key":"449_CR21","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.cie.2017.09.005","volume":"113","author":"X Li","year":"2017","unstructured":"Li X, Peng Z, Du B, Guo J, Xu W, Zhuang K (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng 113:10\u201326","journal-title":"Comput Ind Eng"},{"key":"449_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118711","volume":"212","author":"Y An","year":"2023","unstructured":"An Y, Chen X, Gao K, Zhang L, Li Y, Zhao Z (2023) A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance. Expert Syst Appl 212:118711","journal-title":"Expert Syst Appl"},{"key":"449_CR23","doi-asserted-by":"publisher","first-page":"121205","DOI":"10.1016\/j.eswa.2023.121205","volume":"237","author":"N Zhu","year":"2024","unstructured":"Zhu N, Gong G, Lu D, Huang D, Peng N, Qi H (2024) An effective reformative memetic algorithm for distributed flexible job-shop scheduling problem with order cancellation. Expert Syst Appl 237:121205\u2013121205","journal-title":"Expert Syst Appl"},{"key":"449_CR24","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, Fan Q, Gong G, Ding S (2021) An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput Ind Eng 155:107211","journal-title":"Comput Ind Eng"},{"key":"449_CR25","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":"449_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117489","volume":"203","author":"J Duan","year":"2022","unstructured":"Duan J, Wang J (2022) Robust scheduling for flexible machining job shop subject to machine breakdowns and new job arrivals considering system reusability and task recurrence. Expert Syst Appl 203:117489","journal-title":"Expert Syst Appl"},{"key":"449_CR27","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ijpe.2011.04.020","volume":"132","author":"N Al-Hinai","year":"2011","unstructured":"Al-Hinai N, ElMekkawy T (2011) Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ 132:279\u2013291","journal-title":"Int J Prod Econ"},{"key":"449_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121149","volume":"235","author":"C Luo","year":"2024","unstructured":"Luo C, Gong W, Lu C (2024) Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns. Expert Syst Appl 235:121149","journal-title":"Expert Syst Appl"},{"key":"449_CR29","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jmsy.2024.03.002","volume":"74","author":"C Fan","year":"2024","unstructured":"Fan C, Wang W, Tian J (2024) Flexible job shop scheduling with stochastic machine breakdowns by an improved tuna swarm optimization algorithm. J Manuf Syst 74:180\u2013197","journal-title":"J Manuf Syst"},{"key":"449_CR30","doi-asserted-by":"publisher","first-page":"117460","DOI":"10.1016\/j.eswa.2022.117460","volume":"203","author":"G Zhang","year":"2022","unstructured":"Zhang G, Lu X, Liu X, Zhang L, Wei S, Zhang W (2022) An effective two-stage algorithm based on convolutional neural network for the bi-objective flexible job shop scheduling problem with machine breakdown. Expert Syst Appl 203:117460\u2013117460","journal-title":"Expert Syst Appl"},{"key":"449_CR31","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2015.02.014","volume":"61","author":"H Mokhtari","year":"2015","unstructured":"Mokhtari H, Dadgar M (2015) Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate. Comput Oper Res 61:31\u201345","journal-title":"Comput Oper Res"},{"issue":"21","key":"449_CR32","doi-asserted-by":"publisher","first-page":"7652","DOI":"10.1016\/j.eswa.2015.06.004","volume":"42","author":"KZ Gao","year":"2015","unstructured":"Gao KZ, Suganthan PN, Chua TJ, Chong CS, Cai TX, Pan QK (2015) A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst Appl 42(21):7652\u20137663","journal-title":"Expert Syst Appl"},{"issue":"6","key":"449_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3453474","volume":"54","author":"AP Guerreiro","year":"2021","unstructured":"Guerreiro AP, Fonseca CM, Paquete L (2021) The hypervolume indicator: Computational problems and algorithms. ACM Comput Surv (CSUR) 54(6):1\u201342","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"449_CR34","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","volume":"23","author":"Y Sun","year":"2018","unstructured":"Sun Y, Yen GG, Yi Z (2018) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173\u2013187","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"449_CR35","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TASE.2023.3300922","volume":"21","author":"J Li","year":"2024","unstructured":"Li J, Han Y, Gao K, Xiao X, Duan P (2024) Bi-population balancing multi-objective algorithm for fuzzy flexible job shop with energy and transportation. IEEE Trans Autom Sci Eng 21(3):4686\u20134702. https:\/\/doi.org\/10.1109\/TASE.2023.3300922","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"11","key":"449_CR36","doi-asserted-by":"publisher","first-page":"3126","DOI":"10.1080\/00207543.2016.1262082","volume":"55","author":"D Lei","year":"2017","unstructured":"Lei D, Zheng Y, Guo X (2017) A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption. Int J Prod Res 55(11):3126\u20133140","journal-title":"Int J Prod Res"},{"issue":"4","key":"449_CR37","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1109\/TASE.2021.3115821","volume":"19","author":"Y Lv","year":"2021","unstructured":"Lv Y, Li C, Tang Y, Kou Y (2021) Toward energy-efficient rescheduling decision mechanisms for flexible job shop with dynamic events and alternative process plans. IEEE Trans Autom Sci Eng 19(4):3259\u20133275","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"449_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104307","volume":"103","author":"M Li","year":"2021","unstructured":"Li M, Lei D (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","journal-title":"Eng Appl Artif Intell"},{"issue":"11","key":"449_CR39","doi-asserted-by":"publisher","first-page":"3027","DOI":"10.1080\/00207540600988105","volume":"46","author":"W Shi-Jin","year":"2008","unstructured":"Shi-Jin W, Bing-Hai Z, 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":"449_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105401","volume":"134","author":"H Fan","year":"2021","unstructured":"Fan H, Xiong H, Goh M (2021) Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints. Comput Oper Res 134:105401","journal-title":"Comput Oper Res"},{"key":"449_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110880","volume":"278","author":"X-R Tao","year":"2023","unstructured":"Tao X-R, Pan Q-K, Sang H-Y, Gao L, Yang A-L, Rong M (2023) Nondominated sorting genetic algorithm-II with Q-learning for the distributed permutation flowshop rescheduling problem. Knowl-Based Syst 278:110880","journal-title":"Knowl-Based Syst"},{"issue":"02","key":"449_CR42","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1142\/S0219622016500024","volume":"15","author":"E Teymourian","year":"2016","unstructured":"Teymourian E, Kayvanfar V, Komaki GM, Khodarahmi M (2016) An enhanced intelligent water drops algorithm for scheduling of an agile manufacturing system. Int J Inf Technol Decis Mak 15(02):239\u2013266","journal-title":"Int J Inf Technol Decis Mak"},{"key":"449_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.tmp.2020.100673","volume":"34","author":"R Khorsand","year":"2020","unstructured":"Khorsand R, Rafiee M, Kayvanfar V (2020) Insights into TripAdvisor\u2019s online reviews: the case of Tehran\u2019s hotels. Tourism Manag Perspect 34:100673","journal-title":"Tourism Manag Perspect"},{"issue":"7","key":"449_CR44","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s10472-020-09718-y","volume":"90","author":"\u00d6F Y\u0131lmaz","year":"2022","unstructured":"Y\u0131lmaz \u00d6F (2022) An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method. Ann Math Artif Intell 90(7):679\u2013696","journal-title":"Ann Math Artif Intell"},{"key":"449_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121947","volume":"238","author":"T Mraihi","year":"2024","unstructured":"Mraihi T, Driss OB, El-Haouzi HB (2024) Distributed permutation flow shop scheduling problem with worker flexibility: review, trends and model proposition. Expert Syst Appl 238:121947","journal-title":"Expert Syst Appl"},{"key":"449_CR46","doi-asserted-by":"crossref","unstructured":"Aqil S (2024) Effective population-based meta-heuristics with neh and grasp heuristics minimizing total weighted flow time in no-wait flow shop scheduling problem under sequence-dependent setup time constraint. Arabian J Scie Eng, pp.1\u201324.","DOI":"10.1007\/s13369-023-08642-7"},{"key":"449_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101374","volume":"82","author":"L Meng","year":"2023","unstructured":"Meng L, Zhang C, Zhang B, Gao K, Ren Y, Sang H (2023) MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times. Swarm Evol Comput 82:101374","journal-title":"Swarm Evol Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00449-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T09:30:40Z","timestamp":1750930240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00449-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00449-3","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"9 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict interest"}}],"article-number":"10"}}