{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:10:31Z","timestamp":1782277831240,"version":"3.54.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T00:00:00Z","timestamp":1750723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T00:00:00Z","timestamp":1750723200000},"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":["62173169"],"award-info":[{"award-number":["62173169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72201115"],"award-info":[{"award-number":["72201115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72362026"],"award-info":[{"award-number":["72362026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Research Key Project of Yunnan Province","award":["202201AS070030"],"award-info":[{"award-number":["202201AS070030"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12293-025-00454-6","type":"journal-article","created":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T05:31:33Z","timestamp":1750743093000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An estimation of distribution algorithm-based hyper-heuristic for the blocking flowshop group scheduling problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Sen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zi-qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingxia","family":"Shang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zuocheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,24]]},"reference":[{"key":"454_CR1","volume-title":"Group technology: applications to production management","author":"I Ham","year":"2012","unstructured":"Ham I, Hitomi K, Yoshida T (2012) Group technology: applications to production management. Springer"},{"key":"454_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120909","volume":"233","author":"Y Wang","year":"2023","unstructured":"Wang Y, Han Y, Wang Y, Li J, Gao K, Liu Y (2023) An effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time. Expert Syst Appl 233:120909. https:\/\/doi.org\/10.1016\/j.eswa.2023.120909","journal-title":"Expert Syst Appl"},{"key":"454_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119548","volume":"217","author":"B Zhang","year":"2023","unstructured":"Zhang B, Lu C, Meng LL, Han YY, Sang HY, Jiang XC (2023) Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm. Expert Syst Appl 217:119548. https:\/\/doi.org\/10.1016\/j.eswa.2023.119548","journal-title":"Expert Syst Appl"},{"issue":"2","key":"454_CR4","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.ejor.2022.09.034","volume":"307","author":"M Ghorbanzadeh","year":"2023","unstructured":"Ghorbanzadeh M, Ranjbar M (2023) Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints. Eur J Oper Res 307(2):519\u2013537. https:\/\/doi.org\/10.1016\/j.ejor.2022.09.034","journal-title":"Eur J Oper Res"},{"key":"454_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-009-0147-3","volume":"13","author":"CA Gelogullari","year":"2010","unstructured":"Gelogullari CA, Logendran R (2010) Group-scheduling problems in electronics manufacturing. J Sched 13:177\u2013202. https:\/\/doi.org\/10.1007\/s10951-009-0147-3","journal-title":"J Sched"},{"key":"454_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2017.02.027","volume":"79","author":"V Riahi","year":"2017","unstructured":"Riahi V, Khorramizadeh M, Newton MH, Sattar A (2017) Scatter search for mixed blocking flowshop scheduling. Expert Syst Appl 79:20\u201332. https:\/\/doi.org\/10.1016\/j.eswa.2017.02.027","journal-title":"Expert Syst Appl"},{"key":"454_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","journal-title":"Ann Discrete Math"},{"issue":"2","key":"454_CR8","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","volume":"125","author":"JE Schaller","year":"2000","unstructured":"Schaller JE, Gupta JN, Vakharia AJ (2000) Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur J Oper Res 125(2):324\u2013339. https:\/\/doi.org\/10.1016\/S0377-2217(99)00387-2","journal-title":"Eur J Oper Res"},{"issue":"3","key":"454_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.cie.2003.11.004","volume":"48","author":"PM Fran\u00e7a","year":"2005","unstructured":"Fran\u00e7a PM, Gupta JN, Mendes AS, Moscato P, Veltink KJ (2005) Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Comput Ind Eng 48(3):491\u2013506. https:\/\/doi.org\/10.1016\/j.cie.2003.11.004","journal-title":"Comput Ind Eng"},{"issue":"1","key":"454_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.cor.2010.06.006","volume":"38","author":"R Bouabda","year":"2011","unstructured":"Bouabda R, Jarboui B, Eddaly M, Reba\u00ef A (2011) A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. Comput Oper Res 38(1):387\u2013393. https:\/\/doi.org\/10.1016\/j.cor.2010.06.006","journal-title":"Comput Oper Res"},{"issue":"12","key":"454_CR11","doi-asserted-by":"publisher","first-page":"15517","DOI":"10.1016\/j.eswa.2011.06.008","volume":"38","author":"HM Cheng","year":"2011","unstructured":"Cheng HM, Ying KC (2011) Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times. Expert Syst Appl 38(12):15517\u201315522. https:\/\/doi.org\/10.1016\/j.eswa.2011.06.008","journal-title":"Expert Syst Appl"},{"issue":"3","key":"454_CR12","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1504\/EJIE.2014.060997","volume":"8","author":"T Keshavarz","year":"2014","unstructured":"Keshavarz T, Salmasi N (2014) Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems. Eur J Ind Eng 8(3):366\u2013387. https:\/\/doi.org\/10.1504\/EJIE.2014.060997","journal-title":"Eur J Ind Eng"},{"key":"454_CR13","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s10845-015-1049-1","volume":"28","author":"A Costa","year":"2017","unstructured":"Costa A, Cappadonna FA, Fichera S (2017) A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. J Intell Manuf 28:1269\u20131283. https:\/\/doi.org\/10.1007\/s10845-015-1049-1","journal-title":"J Intell Manuf"},{"key":"454_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103413","volume":"89","author":"A Costa","year":"2020","unstructured":"Costa A, Cappadonna FV, Fichera S (2020) Minimizing makespan in a flow shop sequence dependent group scheduling problem with blocking constraint. Eng Appl Artif Intell 89:103413. https:\/\/doi.org\/10.1016\/j.engappai.2019.103413","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"454_CR15","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1109\/TEVC.2021.3115795","volume":"27","author":"X He","year":"2021","unstructured":"He X, Pan QK, Gao L, Wang L, Suganthan PN (2021) A greedy cooperative co-evolutionary algorithm with problem-specific knowledge for multiobjective flowshop group scheduling problems. IEEE Trans Evol Comput 27(3):430\u2013444. https:\/\/doi.org\/10.1109\/TEVC.2021.3115795","journal-title":"IEEE Trans Evol Comput"},{"key":"454_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125026","volume":"257","author":"Y Wang","year":"2024","unstructured":"Wang Y, Han Y, Li H, Li J, Gao K, Liu Y (2024) Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling. Expert Syst Appl 257:125026. https:\/\/doi.org\/10.1016\/j.eswa.2024.125026","journal-title":"Expert Syst Appl"},{"key":"454_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.12.025","volume":"128","author":"SW Lin","year":"2019","unstructured":"Lin SW, Ying KC (2019) Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Comput Ind Eng 128:1\u20137. https:\/\/doi.org\/10.1016\/j.cie.2018.12.025","journal-title":"Comput Ind Eng"},{"key":"454_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107705","volume":"111","author":"CY Cheng","year":"2021","unstructured":"Cheng CY, Pourhejazy P, Ying KC, Liao YH (2021) New benchmark algorithms for No-wait flowshop group scheduling problem with sequence-dependent setup times. Appl Soft Comput 111:107705. https:\/\/doi.org\/10.1016\/j.asoc.2021.107705","journal-title":"Appl Soft Comput"},{"key":"454_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10845-020-01580-3","volume":"32","author":"S Yuan","year":"2021","unstructured":"Yuan S, Li T, Wang B (2021) A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times. J Intell Manuf 32:427\u2013439. https:\/\/doi.org\/10.1007\/s10845-020-01580-3","journal-title":"J Intell Manuf"},{"key":"454_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109962","volume":"258","author":"H Qin","year":"2022","unstructured":"Qin H, Han Y, Wang Y, Liu Y, Li J, Pan Q (2022) Intelligent optimization under blocking constraints: a novel iterated greedy algorithm for the hybrid flow shop group scheduling problem. Knowl-Based Syst 258:109962. https:\/\/doi.org\/10.1016\/j.knosys.2022.109962","journal-title":"Knowl-Based Syst"},{"key":"454_CR21","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"JS Neufeld","year":"2016","unstructured":"Neufeld JS, Gupta JN, Buscher U (2016) A comprehensive review of flowshop group scheduling literature. Comput Oper Res 70:56\u201374. https:\/\/doi.org\/10.1016\/j.cor.2015.12.006","journal-title":"Comput Oper Res"},{"key":"454_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110695","volume":"146","author":"ZQ Zhang","year":"2023","unstructured":"Zhang ZQ, Qian B, Hu R, Yang JB (2023) Q-learning-based hyper-heuristic evolutionary algorithm for the distributed assembly blocking flowshop scheduling problem. Appl Soft Comput 146:110695. https:\/\/doi.org\/10.1016\/j.asoc.2023.110695","journal-title":"Appl Soft Comput"},{"key":"454_CR23","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ins.2014.02.155","volume":"277","author":"G Koulinas","year":"2014","unstructured":"Koulinas G, Kotsikas L, Anagnostopoulos K (2014) A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem. Inf Sci 277:680\u2013693. https:\/\/doi.org\/10.1016\/j.ins.2014.02.155","journal-title":"Inf Sci"},{"key":"454_CR24","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.engappai.2018.10.008","volume":"77","author":"J Lin","year":"2019","unstructured":"Lin J (2019) Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time. Eng Appl Artif Intell 77:186\u2013196. https:\/\/doi.org\/10.1016\/j.engappai.2018.10.008","journal-title":"Eng Appl Artif Intell"},{"key":"454_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112915","volume":"140","author":"J Lin","year":"2020","unstructured":"Lin J, Zhu L, Gao K (2020) A genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Expert Syst Appl 140:112915. https:\/\/doi.org\/10.1016\/j.eswa.2019.112915","journal-title":"Expert Syst Appl"},{"issue":"3","key":"454_CR26","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1109\/TSMC.2022.3198829","volume":"53","author":"B Qian","year":"2022","unstructured":"Qian B, Zhang ZQ, Hu R, Jin HP, Yang JB (2022) A matrix-cube-based estimation of distribution algorithm for no-wait flow-shop scheduling with sequence-dependent setup times and release times. IEEE Trans Syst Man Cybern Syst 53(3):1492\u20131503. https:\/\/doi.org\/10.1109\/TSMC.2022.3198829","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"3","key":"454_CR27","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509\u2013520. https:\/\/doi.org\/10.1016\/j.cor.2008.12.004","journal-title":"Comput Oper Res"},{"key":"454_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117602","volume":"205","author":"ZQ Zhang","year":"2022","unstructured":"Zhang ZQ, Qian B, Hu R, Jin HP, Wang L, Yang JB (2022) A matrix-cube-based estimation of distribution algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Expert Syst Appl 205:117602. https:\/\/doi.org\/10.1016\/j.eswa.2022.117602","journal-title":"Expert Syst Appl"},{"key":"454_CR29","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz R, Pan QK, Naderi B (2019) Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83:213\u2013222. https:\/\/doi.org\/10.1016\/j.omega.2018.03.004","journal-title":"Omega"},{"key":"454_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.swevo.2017.12.005","volume":"40","author":"Z Shao","year":"2018","unstructured":"Shao Z, Pi D, Shao W (2018) A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 40:53\u201375. https:\/\/doi.org\/10.1016\/j.swevo.2017.12.005","journal-title":"Swarm Evol Comput"},{"key":"454_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"MF Tasgetiren","year":"2017","unstructured":"Tasgetiren MF, Kizilay D, Pan QK, Suganthan PN (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77:111\u2013126. https:\/\/doi.org\/10.1016\/j.cor.2016.07.002","journal-title":"Comput Oper Res"},{"issue":"1","key":"454_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"issue":"1","key":"454_CR33","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","volume":"103","author":"C Rajendran","year":"1997","unstructured":"Rajendran C, Ziegler H (1997) An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. Eur J Oper Res 103(1):129\u2013138. https:\/\/doi.org\/10.1016\/S0377-2217(96)00273-1","journal-title":"Eur J Oper Res"},{"issue":"1","key":"454_CR34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TETCI.2022.3174915","volume":"7","author":"Z Shao","year":"2022","unstructured":"Shao Z, Shao W, Pi D (2022) LS-HH: a learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling. IEEE Trans Emerg Top Comput Intell 7(1):111\u2013127. https:\/\/doi.org\/10.1109\/TETCI.2022.3174915","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"2","key":"454_CR35","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166\u2013180. https:\/\/doi.org\/10.1016\/j.omega.2011.05.002","journal-title":"Omega"},{"issue":"7","key":"454_CR36","doi-asserted-by":"publisher","first-page":"5999","DOI":"10.1109\/TCYB.2020.3041494","volume":"52","author":"QK Pan","year":"2020","unstructured":"Pan QK, Gao L, Wang L (2020) An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Trans Cybern 52(7):5999\u20136012. https:\/\/doi.org\/10.1109\/TCYB.2020.3041494","journal-title":"IEEE Trans Cybern"},{"key":"454_CR37","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2017","unstructured":"Montgomery DC (2017) Design and analysis of experiments. Wiley"},{"key":"454_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100785","volume":"60","author":"ZQ Zhang","year":"2021","unstructured":"Zhang ZQ, Qian B, Hu R, Jin HP, Wang L (2021) A matrix-cube-based estimation of distribution algorithm for the distributed assembly permutation flow-shop scheduling problem. Swarm Evol Comput 60:100785. https:\/\/doi.org\/10.1016\/j.swevo.2020.100785","journal-title":"Swarm Evol Comput"},{"issue":"9","key":"454_CR39","doi-asserted-by":"publisher","first-page":"5626","DOI":"10.1109\/TSMC.2023.3272311","volume":"53","author":"F Zhao","year":"2023","unstructured":"Zhao F, Zhu B, Wang L (2023) An estimation of distribution algorithm-based hyper-heuristic for the distributed assembly mixed no-idle permutation flowshop scheduling problem. IEEE Trans Syst Man Cybern Syst 53(9):5626\u20135637. https:\/\/doi.org\/10.1109\/TSMC.2023.3272311","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"454_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107830","volume":"112","author":"JP Huang","year":"2021","unstructured":"Huang JP, Pan QK, Gao L, Wang L (2021) An effective iterated greedy algorithm for PCBs grouping problem to minimize setup times. Appl Soft Comput 112:107830. https:\/\/doi.org\/10.1016\/j.asoc.2021.107830","journal-title":"Appl Soft Comput"},{"key":"454_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104264","volume":"102","author":"V Riahi","year":"2021","unstructured":"Riahi V, Newton MH, Sattar A (2021) Constraint based local search for flowshops with sequence-dependent setup times. Eng Appl Artif Intell 102:104264. https:\/\/doi.org\/10.1016\/j.engappai.2021.104264","journal-title":"Eng Appl Artif Intell"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00454-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00454-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00454-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T06:54:43Z","timestamp":1757573683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00454-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,24]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["454"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00454-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,24]]},"assertion":[{"value":"17 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"33"}}