{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:59:09Z","timestamp":1764773949527,"version":"3.46.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10732-025-09573-2","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T02:30:37Z","timestamp":1763519437000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource-constrained multi-stage processing and assembly scheduling with sequential and batch operations"],"prefix":"10.1007","volume":"31","author":[{"given":"Song","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguang","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"issue":"2","key":"9573_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10845-013-0775-5","volume":"26","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A., Aydilek, H.: The two stage assembly flowshop scheduling problem to minimize total tardiness. J. Intell. Manuf. 26(2), 225\u2013237 (2015). https:\/\/doi.org\/10.1007\/s10845-013-0775-5","journal-title":"J. Intell. Manuf."},{"key":"9573_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2025.03.024","author":"C Artigues","year":"2025","unstructured":"Artigues, C., Hartmann, S., Vanhoucke, M.: Fifty years of research on resource-constrained project scheduling explored from different perspectives. Eur. J. Oper. Res. (2025). https:\/\/doi.org\/10.1016\/j.ejor.2025.03.024","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9573_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: Review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016). https:\/\/doi.org\/10.1111\/itor.12199","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9573_CR4","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., et al.: The flexible job shop scheduling problem: A review. Eur. J. Oper. Res. 314(2), 409\u2013432 (2024). https:\/\/doi.org\/10.1016\/j.ejor.2023.05.017","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9573_CR5","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D Debels","year":"2006","unstructured":"Debels, D., De Reyck, B., Leus, R., et al.: A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res. 169(2), 638\u2013653 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2004.08.020","journal-title":"Eur. J. Oper. Res."},{"issue":"104","key":"9573_CR6","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/j.cor.2020.104951","volume":"121","author":"H Ding","year":"2020","unstructured":"Ding, H., Gu, X.: Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Computers & Operations Research 121(104), 951 (2020). https:\/\/doi.org\/10.1016\/j.cor.2020.104951","journal-title":"Computers & Operations Research"},{"issue":"1","key":"9573_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2022","unstructured":"Fowler, J.W., M\u00f6nch, L.: A survey of scheduling with parallel batch (p-batch) processing. Eur. J. Oper. Res. 298(1), 1\u201324 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.06.012","journal-title":"Eur. J. Oper. Res."},{"key":"9573_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.cor.2017.07.012","volume":"88","author":"JM Framinan","year":"2017","unstructured":"Framinan, J.M., Perez-Gonzalez, P.: The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic. Computers & Operations Research 88, 237\u2013246 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.07.012","journal-title":"Computers & Operations Research"},{"issue":"2","key":"9573_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","volume":"273","author":"JM Framinan","year":"2019","unstructured":"Framinan, J.M., Perez-Gonzalez, P., Fernandez-Viagas, V.: Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. Eur. J. Oper. Res. 273(2), 401\u2013417 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.04.033","journal-title":"Eur. J. Oper. Res."},{"issue":"109","key":"9573_CR10","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.ijpe.2025.109647","volume":"285","author":"Q Gong","year":"2025","unstructured":"Gong, Q., Zhang, Y., Chen, G., et al.: The intelligent production line configuration strategy. Int. J. Prod. Econ. 285(109), 647 (2025). https:\/\/doi.org\/10.1016\/j.ijpe.2025.109647","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"9573_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","volume":"297","author":"S Hartmann","year":"2022","unstructured":"Hartmann, S., Briskorn, D.: An updated survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 297(1), 1\u201314 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.05.004","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9573_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2), 394\u2013407 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00485-3","journal-title":"Eur. J. Oper. Res."},{"key":"9573_CR13","doi-asserted-by":"publisher","unstructured":"Jiang, Z., Jin, Y., E M, et al.: Method of tasks and resources matching and analysis for cyber-physical production system. Adv. Mech. Eng. 10(5), 1\u20139 (2018). https:\/\/doi.org\/10.1177\/1687814018777828","DOI":"10.1177\/1687814018777828"},{"issue":"2","key":"9573_CR14","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur. J. Oper. Res. 90(2), 320\u2013333 (1996). https:\/\/doi.org\/10.1016\/0377-2217(95)00357-6","journal-title":"Eur. J. Oper. Res."},{"key":"9573_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jocs.2015.03.011","volume":"8","author":"G Komaki","year":"2015","unstructured":"Komaki, G., Kayvanfar, V.: Grey wolf optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time. Journal of Computational Science 8, 109\u2013120 (2015). https:\/\/doi.org\/10.1016\/j.jocs.2015.03.011","journal-title":"Journal of Computational Science"},{"issue":"10","key":"9573_CR16","doi-asserted-by":"publisher","first-page":"2926","DOI":"10.1080\/00207543.2018.1550269","volume":"57","author":"GM Komaki","year":"2019","unstructured":"Komaki, G.M., Sheikh, S., Malakooti, B.: Flow shop scheduling problems with assembly operations: A review and new trends. Int. J. Prod. Res. 57(10), 2926\u20132955 (2019). https:\/\/doi.org\/10.1080\/00207543.2018.1550269","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"9573_CR17","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2023.03.013","volume":"310","author":"K Kurowski","year":"2023","unstructured":"Kurowski, K., Pecyna, T., Slysz, M., et al.: Application of quantum approximate optimization algorithm to job shop scheduling problem. Eur. J. Oper. Res. 310(2), 518\u2013528 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.03.013","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9573_CR18","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"KY Li","year":"1992","unstructured":"Li, K.Y., Willis, R.J.: An iterative scheduling technique for resource-constrained project scheduling. Eur. J. Oper. Res. 56(3), 370\u2013379 (1992). https:\/\/doi.org\/10.1016\/0377-2217(92)90320-9","journal-title":"Eur. J. Oper. Res."},{"issue":"107","key":"9573_CR19","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1016\/j.cie.2021.107928","volume":"165","author":"L Li","year":"2022","unstructured":"Li, L.: Research on discrete intelligent workshop lot-streaming scheduling with variable sublots under engineer to order. Computers & Industrial Engineering 165(107), 928 (2022). https:\/\/doi.org\/10.1016\/j.cie.2021.107928","journal-title":"Computers & Industrial Engineering"},{"issue":"105","key":"9573_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.cor.2021.105431","volume":"135","author":"Z Liu","year":"2021","unstructured":"Liu, Z., Wang, J., Zhang, C., et al.: A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem. Computers & Operations Research 135(105), 431 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105431","journal-title":"Computers & Operations Research"},{"key":"9573_CR21","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00500-008-0337-5","volume":"13","author":"M Mahdi Mobini","year":"2009","unstructured":"Mahdi Mobini, M., Rabbani, M., Amalnik, M., et al.: Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. Soft. Comput. 13, 597\u2013610 (2009). https:\/\/doi.org\/10.1007\/s00500-008-0337-5","journal-title":"Soft. Comput."},{"issue":"7","key":"9573_CR22","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1007\/s10845-022-01940-1","volume":"33","author":"S Mahmud","year":"2022","unstructured":"Mahmud, S., Chakrabortty, R.K., Abbasi, A., et al.: Switching strategy-based hybrid evolutionary algorithms for job shop scheduling problems. J. Intell. Manuf. 33(7), 1939\u20131966 (2022). https:\/\/doi.org\/10.1007\/s10845-022-01940-1","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"9573_CR23","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"J Mendes","year":"2009","unstructured":"Mendes, J., Gon\u00e7alves, J., Resende, M.: A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research 36(1), 92\u2013109 (2009). https:\/\/doi.org\/10.1016\/j.cor.2007.07.001","journal-title":"Computers & Operations Research"},{"issue":"4","key":"9573_CR24","doi-asserted-by":"publisher","first-page":"3983","DOI":"10.1016\/j.eswa.2011.09.062","volume":"39","author":"DC Paraskevopoulos","year":"2012","unstructured":"Paraskevopoulos, D.C., Tarantilis, C.D., Ioannou, G.: Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Syst. Appl. 39(4), 3983\u20133994 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2011.09.062","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"9573_CR25","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2019.01.063","volume":"280","author":"R Pellerin","year":"2020","unstructured":"Pellerin, R., Perrier, N., Berthaut, F.: A survey of hybrid metaheuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 280(2), 395\u2013416 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.01.063","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9573_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/nav.20439","volume":"58","author":"S Proon","year":"2011","unstructured":"Proon, S., Jin, M.: A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem. Nav. Res. Logist. 58(2), 73\u201382 (2011). https:\/\/doi.org\/10.1002\/nav.20439","journal-title":"Nav. Res. Logist."},{"issue":"10","key":"9573_CR27","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"R Qing-dao-er-ji","year":"2012","unstructured":"Qing-dao-er-ji, R., Wang, Y.: A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research 39(10), 2291\u20132299 (2012). https:\/\/doi.org\/10.1016\/j.cor.2011.12.005","journal-title":"Computers & Operations Research"},{"key":"9573_CR28","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s002910000042","volume":"22","author":"C Schwindt","year":"2000","unstructured":"Schwindt, C., Trautmann, N.: Batch scheduling in process industries: an application of resource-constrained project scheduling. OR-Spektrum 22, 501\u2013524 (2000). https:\/\/doi.org\/10.1007\/s002910000042","journal-title":"OR-Spektrum"},{"issue":"2","key":"9573_CR29","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, J.S.: Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 265(2), 503\u2013516 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.08.021","journal-title":"Eur. J. Oper. Res."},{"issue":"106","key":"9573_CR30","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.cor.2024.106850","volume":"173","author":"HB Song","year":"2025","unstructured":"Song, H.B., Lin, J., Chen, Y.R.: An effective two-stage heuristic for scheduling the distributed assembly flowshops with sequence dependent setup times. Computers & Operations Research 173(106), 850 (2025). https:\/\/doi.org\/10.1016\/j.cor.2024.106850","journal-title":"Computers & Operations Research"},{"key":"9573_CR31","doi-asserted-by":"publisher","unstructured":"Tang Q, Wang Y (2022) Multiobjective lot sizing and scheduling of multiproduct switching production in the process industry considering uncertain market information under mass customization. IEEE Access 10:74,747\u201374,764. https:\/\/doi.org\/10.1109\/ACCESS.2022.3191465","DOI":"10.1109\/ACCESS.2022.3191465"},{"key":"9573_CR32","doi-asserted-by":"publisher","unstructured":"Trautmann N, Schwindt C (2005) A minlp\/rcpsp decomposition approach for the short-term planning of batch production. In: Puigjaner L, Espu\u00f1a A (eds) Computer Aided Chemical Engineering, vol\u00a020. Elsevier, Barcelona, p 1309\u20131314, https:\/\/doi.org\/10.1016\/S1570-7946(05)80060-4","DOI":"10.1016\/S1570-7946(05)80060-4"},{"issue":"3","key":"9573_CR33","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ejor.2024.07.016","volume":"319","author":"M Vanhoucke","year":"2024","unstructured":"Vanhoucke, M., Coelho, J.: A matheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 319(3), 711\u2013725 (2024). https:\/\/doi.org\/10.1016\/j.ejor.2024.07.016","journal-title":"Eur. J. Oper. Res."},{"key":"9573_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40438-2","author":"M Vanhoucke","year":"2012","unstructured":"Vanhoucke, M., et al.: Project management with dynamic scheduling. Springer, Berlin Heidelberg, (2012). https:\/\/doi.org\/10.1007\/978-3-642-40438-2","journal-title":"Springer, Berlin Heidelberg,"},{"issue":"10","key":"9573_CR35","doi-asserted-by":"publisher","first-page":"3465","DOI":"10.1007\/s00500-017-3003-y","volume":"23","author":"F Villaf\u00e1\u00f1ez","year":"2019","unstructured":"Villaf\u00e1\u00f1ez, F., Poza, D., L\u00f3pez-Paredes, A., et al.: A generic heuristic for multi-project scheduling problems with global and local resource constraints (rcmpsp). Soft. Comput. 23(10), 3465\u20133479 (2019). https:\/\/doi.org\/10.1007\/s00500-017-3003-y","journal-title":"Soft. Comput."},{"issue":"3","key":"9573_CR36","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie, J., Gao, L., Peng, K., et al.: Review on flexible job shop scheduling. IET Collaborative Intelligent Manufacturing 1(3), 67\u201377 (2019). https:\/\/doi.org\/10.1049\/iet-cim.2018.0009","journal-title":"IET Collaborative Intelligent Manufacturing"},{"issue":"7","key":"9573_CR37","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1080\/00207543.2022.2060772","volume":"61","author":"J Xie","year":"2023","unstructured":"Xie, J., Li, X., Gao, L., et al.: A new neighbourhood structure for job shop scheduling problems. Int. J. Prod. Res. 61(7), 2147\u20132161 (2023). https:\/\/doi.org\/10.1080\/00207543.2022.2060772","journal-title":"Int. J. Prod. Res."},{"issue":"105","key":"9573_CR38","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/j.cor.2022.105731","volume":"142","author":"H Xiong","year":"2022","unstructured":"Xiong, H., Shi, S., Ren, D., et al.: A survey of job shop scheduling problem: The types and models. Computers & Operations Research 142(105), 731 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105731","journal-title":"Computers & Operations Research"},{"issue":"5","key":"9573_CR39","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1080\/00207543.2024.2383781","volume":"63","author":"KC Ying","year":"2025","unstructured":"Ying, K.C., Lin, S.W., Chen, K.F.: Minimising makespan in distributed assembly hybrid flowshop scheduling problems. Int. J. Prod. Res. 63(5), 1674\u20131691 (2025). https:\/\/doi.org\/10.1080\/00207543.2024.2383781","journal-title":"Int. J. Prod. Res."},{"issue":"123","key":"9573_CR40","doi-asserted-by":"publisher","first-page":"019","DOI":"10.1016\/j.eswa.2023.123019","volume":"245","author":"E Yuan","year":"2024","unstructured":"Yuan, E., Wang, L., Cheng, S., et al.: Solving flexible job shop scheduling problems via deep reinforcement learning. Expert Syst. Appl. 245(123), 019 (2024). https:\/\/doi.org\/10.1016\/j.eswa.2023.123019","journal-title":"Expert Syst. Appl."},{"issue":"106","key":"9573_CR41","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.cor.2024.106929","volume":"175","author":"X Zhang","year":"2025","unstructured":"Zhang, X., Zhu, G.Y.: A literature review of reinforcement learning methods applied to job-shop scheduling problems. Computers & Operations Research 175(106), 929 (2025). https:\/\/doi.org\/10.1016\/j.cor.2024.106929","journal-title":"Computers & Operations Research"},{"issue":"1","key":"9573_CR42","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1038\/s41598-024-71963-6","volume":"14","author":"X Zhang","year":"2024","unstructured":"Zhang, X., Wang, Z., Zhang, D., et al.: An improved intelligent optimization algorithm for small-batch order production scheduling. Scientific Reports 14(1), 21 (2024). https:\/\/doi.org\/10.1038\/s41598-024-71963-6","journal-title":"Scientific Reports"},{"issue":"4","key":"9573_CR43","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1080\/00207543.2015.1041575","volume":"54","author":"F Zhao","year":"2016","unstructured":"Zhao, F., Shao, Z., Wang, J., et al.: A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems. Int. J. Prod. Res. 54(4), 1039\u20131060 (2016). https:\/\/doi.org\/10.1080\/00207543.2015.1041575","journal-title":"Int. J. Prod. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09573-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09573-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09573-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:55:13Z","timestamp":1764773713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09573-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9573"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09573-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"15 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential competing interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure statement"}}],"article-number":"38"}}