{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T23:07:55Z","timestamp":1790032075957,"version":"4.0.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:00:00Z","timestamp":1782345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T00:00:00Z","timestamp":1790035200000},"content-version":"vor","delay-in-days":89,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>To address increasing production and logistical challenges in the fresh livestock processing industry, this study investigates a two-stage multiprocessor flow shop scheduling problem with fuzzy processing times and time window constraints. Ensuring product freshness under urban congestion and limited storage capacity requires precise and flexible scheduling to minimize early and late completion penalties. This study proposes an adaptive particle swarm optimization algorithm that integrates fuzzy processing environments with time-constrained scheduling. The main contributions are threefold: (1) the formulation of a bi-objective mathematical model incorporating fuzzy processing times and time window constraints, (2) the development of an adaptive inertia weight mechanism to enhance the exploration\u2013exploitation balance of particle swarm optimization (PSO), and (3) a comprehensive comparative analysis against benchmark algorithms, including hybrid genetic algorithm, the linearly decreasing inertia weight PSO, and the multi-objective evolutionary algorithm with heuristic decoding. Experimental results demonstrate that the proposed ADPSO significantly outperforms existing methods, achieving an average improvement of 18.10% in total penalty reduction and 19.93% in solution stability, thereby confirming its effectiveness and robustness in solving complex scheduling problems under uncertainty.<\/jats:p>","DOI":"10.1038\/s41598-026-59056-y","type":"journal-article","created":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T19:13:09Z","timestamp":1782414789000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A two-stage fuzzy flexible flow shop scheduling problem with no-wait and reentrant constraints using adaptive particle swarm optimization"],"prefix":"10.1038","volume":"16","author":[{"given":"Shun-Chi","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"issue":"2","key":"59056_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/trsc.1100.0332","volume":"45","author":"SQ Liu","year":"2011","unstructured":"Liu, S. Q. & Kozan, E. Scheduling trains with priorities: A no-wait blocking parallel-machine job-shop scheduling model. Transp. Sci. 45(2), 175\u2013198 (2011).","journal-title":"Transp. Sci."},{"issue":"4","key":"59056_CR2","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider, M., Stenge, A. & Goeke, D. The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. Transp. Sci. 48(4), 500\u2013520 (2014).","journal-title":"Transp. Sci."},{"issue":"5\u20138","key":"59056_CR3","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/s00170-013-5351-9","volume":"70","author":"M Akhshabi","year":"2014","unstructured":"Akhshabi, M., Tavakkoli-Moghaddam, R. & Rahnamay-Roodposhti, F. A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time\u201d. Int. J. Adv. Manuf. Technol. 70(5\u20138), 1181\u20131188 (2014).","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"59056_CR4","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/0305215X.2025.2466827","volume":"58","author":"L Cheng","year":"2026","unstructured":"Cheng, L. et al. Collaborative assembly factory in the distributed permutation flow-shop scheduling problem considering flexible assembly and fuzzy processing time. Eng. Optim. 58(2), 362\u2013393 (2026).","journal-title":"Eng. Optim."},{"issue":"1","key":"59056_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cie.2008.04.005","volume":"56","author":"HS Choi","year":"2009","unstructured":"Choi, H. S. & Lee, D. H. Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops. Comput. Ind. Eng. 56(1), 113\u2013120 (2009).","journal-title":"Comput. Ind. Eng."},{"key":"59056_CR6","doi-asserted-by":"crossref","unstructured":"Eberhart, R. C., and Kennedy, J. A. New optimizer using particle swarm theory,\u201d Proceedings of the Sixth International Symposium on Micro Machine and Human Science, IEEE Service Center, Piscataway, NJ, Nagoya, Japan: 39\u201343 (1995).","DOI":"10.1109\/MHS.1995.494215"},{"key":"59056_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00170-007-1203-9","volume":"39","author":"RH Huang","year":"2008","unstructured":"Huang, R. H. & Yang, C. L. Ant colony system for job shop scheduling with time windows. Int. J. Adv. Manuf. Technol. 39, 151\u2013157 (2008).","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"9\u201310","key":"59056_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s00170-008-1865-y","volume":"44","author":"RH Huang","year":"2009","unstructured":"Huang, R. H., Yang, C. L. & Huang, Y. C. No-wait two-stage multiprocessor flow shop scheduling with unit setup. Int. J. Adv. Manuf. Technol. 44(9\u201310), 921\u2013927 (2009).","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"59056_CR9","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1057\/jors.2008.184","volume":"61","author":"RH Huang","year":"2010","unstructured":"Huang, R. H., Yang, C. L. & Huang, H. T. Parallel machine scheduling with common due windows. J. Oper. Res. Soc. 61(4), 640\u2013646 (2010).","journal-title":"J. Oper. Res. Soc."},{"key":"59056_CR10","doi-asserted-by":"crossref","unstructured":"Huang, R. H., Yang, C. L., and Liu, S. C. No-wait flexible flow shop scheduling with due windows. Math. Prob. Eng. Article ID 456719 (2015).","DOI":"10.1155\/2015\/456719"},{"key":"59056_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Y. K., Xue, X. S. and Jiang, C. Optimizing ontology alignment through improved NSGA-II. Discret. Dyn. Nature Soc. Article ID 8586058 (2020).","DOI":"10.1155\/2020\/8586058"},{"key":"59056_CR12","doi-asserted-by":"crossref","unstructured":"Hsu, C. L. and Liao, J. R. Two parallel-machine scheduling problems with function constraint. Discret. Dyn. Nature and Soc. Article ID 2717095 (2020).","DOI":"10.1155\/2020\/2717095"},{"issue":"1","key":"59056_CR13","doi-asserted-by":"publisher","first-page":"11856","DOI":"10.1038\/s41598-025-88124-y","volume":"15","author":"B Khurshid","year":"2025","unstructured":"Khurshid, B., Maqsood, S., Habib, M. S., Omair, M. & Hwang, S. J. A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems. Sci. Rep. 15(1), 11856 (2025).","journal-title":"Sci. Rep."},{"issue":"1","key":"59056_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ijpe.2012.05.015","volume":"141","author":"FD Chou","year":"2013","unstructured":"Chou, F. D. Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks. Int. J. Prod. Econ. 141(1), 137\u2013145 (2013).","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"59056_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1111\/j.1467-8640.1988.tb00120.x","volume":"4","author":"D Dubois","year":"1988","unstructured":"Dubois, D. & Prade, H. On fuzzy syllogisms. Comput. Intell. 4(2), 171\u2013179 (1988).","journal-title":"Comput. Intell."},{"key":"59056_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-025-01448-5","author":"G Nie","year":"2025","unstructured":"Nie, G. & Rezvani, E. Towards an efficient scheduling strategy based on multi-objective optimization in fog environments. Computing https:\/\/doi.org\/10.1007\/s00607-025-01448-5 (2025).","journal-title":"Computing"},{"issue":"1\u20134","key":"59056_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00170-014-6429-8","volume":"77","author":"A Khamseh","year":"2015","unstructured":"Khamseh, A., Jolai, F. & Babaei, M. Integrating sequence-dependent group scheduling problem and preventive maintenance in flexible flow shops. Int. J. Adv. Manuf. Technol. 77(1\u20134), 173\u2013185 (2015).","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"9-12","key":"59056_CR18","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s00170-014-6219-3","volume":"75","author":"J Behnamian","year":"2014","unstructured":"Behnamian, J., Fatemi Ghomi, S. M. T. & Zandieh, M. Realistic variant of just-in-time flowshop scheduling: Integration of Lp-metric method in PSO-like algorithm. Int. J. Adv. Manuf. Technol. 75(9\u201312), 1787\u20131797 (2014).","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"59056_CR19","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-013-0343-z","volume":"17","author":"E Gerstl","year":"2014","unstructured":"Gerstl, E. & Mosheiov, G. The optimal number of used machines in a two-stage flexible flowshop scheduling problem. J. Sched. 17, 199\u2013210 (2014).","journal-title":"J. Sched."},{"issue":"1","key":"59056_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.ijpe.2008.05.008","volume":"115","author":"RH Huang","year":"2008","unstructured":"Huang, R. H. & Yang, C. L. Overlapping production scheduling planning with multiple objectives \u2013 An ant colony approach. Int. J. Prod. Econ. 115(1), 163\u2013170 (2008).","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"59056_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R. & V\u00e1zquez-Rodr\u00edguez, J. A. The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010).","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"59056_CR22","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-015-0427-z","volume":"18","author":"I B\u0142\u0105dek","year":"2015","unstructured":"B\u0142\u0105dek, I., Drozdowski, M., Guinand, F. & Schepler, X. On contiguous and non-contiguous parallel task scheduling. J. Sched. 18(5), 487\u2013495. https:\/\/doi.org\/10.1007\/s10951-015-0427-z (2015).","journal-title":"J. Sched."},{"issue":"2","key":"59056_CR23","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Ding, J., Shen, L. & Tamssaouet, K. The flexible job shop scheduling problem: A review. Eur. J. Oper. Res. 314(2), 409\u2013432 (2024).","journal-title":"Eur. J. Oper. Res."},{"key":"59056_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/00207721.2011.581396","volume":"44","author":"CD Liou","year":"2013","unstructured":"Liou, C. D., Hsieh, Y. C. & Chen, Y. Y. A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem. Int. J. Syst. Sci. 44, 77\u201393 (2013).","journal-title":"Int. J. Syst. Sci."},{"key":"59056_CR25","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C Oguz","year":"2005","unstructured":"Oguz, C. & Ercan, M. F. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J. Sched. 8, 323\u2013351 (2005).","journal-title":"J. Sched."},{"key":"59056_CR26","unstructured":"Pinedo, M. L. Scheduling: Theory, Algorithms, and Systems (3rd ed.). New York, NY: Springer Science+Business Media, LLC, (2008)."},{"key":"59056_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.jmsy.2025.03.005","volume":"80","author":"J Zheng","year":"2025","unstructured":"Zheng, J. et al. Dynamic flexible flow shop scheduling via cross-attention networks and multi-agent reinforcement learning. J. Manuf. Syst. 80, 395\u2013411 (2025).","journal-title":"J. Manuf. Syst."},{"key":"59056_CR28","doi-asserted-by":"publisher","first-page":"4731","DOI":"10.1080\/0020754041233127044","volume":"42","author":"GC Lee","year":"2004","unstructured":"Lee, G. C. & Kim, Y. D. A branch-and-bound algorithm for a two-stage hybrid flow shop scheduling problem minimizing total tardiness. Int. J. Prod. Res. 42, 4731\u20134743 (2004).","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"59056_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M. M. & Desrosiers, J. Time windows constrained routing and scheduling problem. Transp. Sci. 22(1), 1\u201313 (1988).","journal-title":"Transp. Sci."},{"issue":"5\u20138","key":"59056_CR30","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1007\/s00170-013-5375-1","volume":"71","author":"M Rabiee","year":"2014","unstructured":"Rabiee, M., Sadeghi Rad, R., Mazinani, M. & Shafaei, R. An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. Int. J. Adv. Manuf. Technol. 71(5\u20138), 1229\u20131245 (2014).","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"5","key":"59056_CR31","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1287\/opre.1060.0325","volume":"54","author":"N Brahimi","year":"2006","unstructured":"Brahimi, N., Dauzere-Peres, S. & Najid, N. M. Capacitated multi-item lot-sizing problems with time windows. Oper. Res. 54(5), 951\u2013967 (2006).","journal-title":"Oper. Res."},{"issue":"1","key":"59056_CR32","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers, G. Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1), 179\u2013192 (2010).","journal-title":"Oper. Res."},{"key":"59056_CR33","doi-asserted-by":"crossref","unstructured":"Huang, R. H. and Yu, S. C. Clarifying cutting and sewing processes with due windows using an effective ant colony optimization. Math. Prob. Eng. Article ID 182598 (2013).","DOI":"10.1155\/2013\/182598"},{"key":"59056_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.aap.2026.108443","volume":"230","author":"Q Luo","year":"2026","unstructured":"Luo, Q. et al. Study on a multi-factor lane-changing risk resilience assessment model based on genetic algorithm and fault tree analysis. Accid. Anal. Prev. 230, 108443 (2026).","journal-title":"Accid. Anal. Prev."},{"issue":"8","key":"59056_CR35","doi-asserted-by":"publisher","first-page":"2799","DOI":"10.1016\/j.eswa.2012.11.005","volume":"40","author":"R Rudek","year":"2013","unstructured":"Rudek, R., Rudek, A. & Kozik, A. The solution algorithms for the multiprocessor scheduling with workspan criterion. Expert Syst. Appl. 40(8), 2799\u20132806 (2013).","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"59056_CR36","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1287\/mnsc.1120.1632","volume":"59","author":"G Dobson","year":"2013","unstructured":"Dobson, G., Tezcan, T. & Tilson, V. Optimal workflow decisions for investigators in systems with interruptions. Manage. Sci. 59(5), 1125\u20131141 (2013).","journal-title":"Manage. Sci."},{"issue":"2","key":"59056_CR37","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","volume":"30","author":"A Tozkapan","year":"2003","unstructured":"Tozkapan, A., K\u0131rca, \u00d6. & Chung, C. S. A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput. Oper. Res. 30(2), 309\u2013320 (2003).","journal-title":"Comput. Oper. Res."},{"key":"59056_CR38","doi-asserted-by":"crossref","unstructured":"Y. Shi, and R. C. Eberhart, \u201cA modified particle swarm optimizer,\u201d Proceedings of the IEEE World Congress on Computational Intelligence: 69\u201373 (1998a).","DOI":"10.1109\/ICEC.1998.699146"},{"key":"59056_CR39","first-page":"591","volume":"7","author":"Y Shi","year":"1998","unstructured":"Shi, Y. & Eberhart, R. C. Parameter selection in particle swarm optimization. Evol. Programm. 7, 591\u2013600 (1998).","journal-title":"Evol. Programm."},{"key":"59056_CR40","doi-asserted-by":"crossref","unstructured":"Y. Shi, and R. C. Eberhart, \u201cEmpirical study of particle swarm optimization,\u201d Proceedings of the 1999 Congress on Evolutionary Computation 3,: 1945\u20131950 (1999).","DOI":"10.1109\/CEC.1999.785511"},{"key":"59056_CR41","doi-asserted-by":"crossref","unstructured":"Kennedy, J. and Eberhart, R. Particle swarm optimization,\u201d Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia 4: 1942\u20131948 (1995).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"59056_CR42","first-page":"4104","volume":"5","author":"J Kennedy","year":"1997","unstructured":"Kennedy, J. & Eberhart, R. A. Discrete binary version of the particle swarm algorithm. Proc. IEEE Int. Conf. Syst. 5, 4104\u20134108 (1997).","journal-title":"Proc. IEEE Int. Conf. Syst."},{"issue":"5","key":"59056_CR43","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1080\/00207543.2024.2392198","volume":"63","author":"J Mlekusch","year":"2025","unstructured":"Mlekusch, J. & Hartl, R. F. The dual-resource-constrained re-entrant flexible flow shop: A constraint programming approach and a hybrid genetic algorithm. Int. J. Prod. Res. 63(5), 1803\u20131824 (2025).","journal-title":"Int. J. Prod. Res."},{"key":"59056_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114282","volume":"168","author":"W Han","year":"2021","unstructured":"Han, W., Deng, Q., Gong, G., Zhang, L. & Luo, Q. Multi-objective evolutionary algorithms with heuristic decoding for hybrid flow shop scheduling problem with worker constraint. Expert Syst. Appl. 168, 114282. https:\/\/doi.org\/10.1016\/j.eswa.2020.114282 (2021).","journal-title":"Expert Syst. Appl."},{"key":"59056_CR45","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1080\/00207549308956812","volume":"31","author":"WX Zheng","year":"1993","unstructured":"Zheng, W. X., Nagasawa, H. & Nishiyama, N. Single-machine scheduling for minimizing total cost and with identical, asymmetrical earliness and tardiness penalties. Int. J. Prod. Res. 31, 1611\u20131620 (1993).","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"59056_CR46","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1541\/ieejpes.133.488","volume":"133","author":"Y Makino","year":"2013","unstructured":"Makino, Y., Takahashi, A., Imai, J. & Funabiki, S. Particle swarm optimization by using coefficient of variation for terminating scheme and its application to electric power leveling systems. IEEJ Trans. Power Energy 133(5), 488 (2013).","journal-title":"IEEJ Trans. Power Energy"},{"key":"59056_CR47","doi-asserted-by":"crossref","unstructured":"Perroni, P. F. Weingaertner, D. and Delgado, M. R. Estimating stop conditions of swarm based stochastic metaheuristic algorithms.\u201d Proceedings of the Genetic and Evolutionary Computation Conference (GECCO \u201817), Berlin, Germany: 691\u2013695 (2017).","DOI":"10.1145\/3071178.3071326"},{"key":"59056_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, T., Khalifa, H.\u2011A., S.\u202fE.\u202fNajafi, and Edalatpanah, S.\u202fA. Minimizing the machine processing time in a flow shop scheduling problem under piecewise quadratic fuzzy numbers.\u201d Discrete Dynamics in Nature and Society 2022: Article ID 3990534 (2022).","DOI":"10.1155\/2022\/3990534"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-59056-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-59056-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-59056-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T22:41:37Z","timestamp":1790030497000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-59056-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":48,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["59056"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-59056-y","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]},"assertion":[{"value":"14 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This paper does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","label":"Ethics approval","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"29374"}}