{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:10:27Z","timestamp":1776939027704,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"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":["Comput Manag Sci"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10287-025-00529-2","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T09:38:38Z","timestamp":1740389918000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["University course timetabling with multi-section courses, room stability and lecturer preferences: an application in a business school"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2862-2496","authenticated-orcid":false,"given":"Akin","family":"Ozkan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0439-2211","authenticated-orcid":false,"given":"Aydin","family":"Ulucan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6762-8933","authenticated-orcid":false,"given":"Ceren","family":"Dirik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-9641","authenticated-orcid":false,"given":"Kazim Baris","family":"Atici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,24]]},"reference":[{"key":"529_CR1","doi-asserted-by":"crossref","unstructured":"Abdullah S, Burke EK, McCollum B (2007) A hybrid evolutionary approach to the university course timetabling problem. In: 2007 IEEE congress on evolutionary computation (CEC 2007), Singopore","DOI":"10.1109\/CEC.2007.4424686"},{"issue":"10","key":"529_CR2","doi-asserted-by":"publisher","first-page":"12349","DOI":"10.1016\/j.eswa.2009.04.051","volume":"36","author":"CH Aladag","year":"2009","unstructured":"Aladag CH, Hocaoglu G, Basaran MA (2009) The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem. Expert Syst Appl 36(10):12349\u201312356","journal-title":"Expert Syst Appl"},{"key":"529_CR3","doi-asserted-by":"publisher","first-page":"111666","DOI":"10.1109\/ACCESS.2021.3103495","volume":"9","author":"H Algethami","year":"2021","unstructured":"Algethami H, Laesanklang W (2021) A mathematical model for course timetabling problem with faculty-course assignment constraints. IEEE Access 9:111666\u2013111682","journal-title":"IEEE Access"},{"issue":"3","key":"529_CR4","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/S0377-2217(01)00091-1","volume":"137","author":"R Alvarez-Valdes","year":"2002","unstructured":"Alvarez-Valdes R, Crespo E, Tamarit JM (2002) Design and implementation of a course scheduling system using Tabu Search. Eur J Oper Res 137(3):512\u2013523","journal-title":"Eur J Oper Res"},{"issue":"2","key":"529_CR5","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ejor.2005.01.052","volume":"173","author":"SM Al-Yakoob","year":"2006","unstructured":"Al-Yakoob SM, Sherali HD (2006) Mathematical programming models and algorithms for a class\u2013faculty assignment problem. Eur J Oper Res 173(2):488\u2013507","journal-title":"Eur J Oper Res"},{"issue":"1","key":"529_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-007-0210-4","volume":"155","author":"SM Al-Yakoob","year":"2007","unstructured":"Al-Yakoob SM, Sherali HD (2007) Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations. Ann Oper Res 155(1):119\u2013142","journal-title":"Ann Oper Res"},{"key":"529_CR7","doi-asserted-by":"crossref","unstructured":"Asmuni H, Burke EK, Garibaldi JM (2005) Fuzzy multiple heuristic ordering for course timetabling. In: Proceedings of the 2005 UK workshop on computational intelligence (UKCI 2005), London, United Kingdom","DOI":"10.1007\/11593577_19"},{"key":"529_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2014.11.010","volume":"86","author":"H Babaei","year":"2015","unstructured":"Babaei H, Karimpour J, Hadidi A (2015) A survey of approaches for university course timetabling problem. Comput Ind Eng 86:43\u201359","journal-title":"Comput Ind Eng"},{"key":"529_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2014.09.020","volume":"78","author":"RP Badoni","year":"2014","unstructured":"Badoni RP, Gupta DK, Mishra P (2014) A new hybrid algorithm for university course timetabling problem using events based on groupings of students. Comput Ind Eng 78:12\u201325","journal-title":"Comput Ind Eng"},{"issue":"4","key":"529_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0305-0548(97)00048-8","volume":"25","author":"MA Badri","year":"1998","unstructured":"Badri MA, Davis DL, Davis DF, Hollingsworth J (1998) A multi-objective course scheduling model: combining faculty preferences for courses and times. Comput Oper Res 25(4):303\u2013316","journal-title":"Comput Oper Res"},{"key":"529_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10951-018-0582-0","volume":"22","author":"NCF Bagger","year":"2019","unstructured":"Bagger NCF, Desaulniers G, Desrosiers J (2019) Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem. J Sched 22:155\u2013172","journal-title":"J Sched"},{"issue":"1","key":"529_CR12","first-page":"41","volume":"37","author":"MA Bak\u0131r","year":"2008","unstructured":"Bak\u0131r MA, Aksop C (2008) A 0\u20131 integer programming approach to a university timetabling problem. Hacettepe J Math Stat 37(1):41\u201355","journal-title":"Hacettepe J Math Stat"},{"key":"529_CR13","first-page":"228","volume-title":"International conference on the practice and theory of automated timetabling","author":"C Beyrouthy","year":"2007","unstructured":"Beyrouthy C, Burke EK, Landa-Silva D, McCollum B, McMullan P, Parkes AJ (2007) The teaching space allocation problem with splitting. In: Burke EK, Rudov\u00e1 H (eds) International conference on the practice and theory of automated timetabling. Springer, pp 228\u2013247"},{"issue":"2","key":"529_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-008-0088-2","volume":"12","author":"T Birbas","year":"2009","unstructured":"Birbas T, Daskalaki S, Housos E (2009) School timetabling for quality student and teacher schedules. J Sched 12(2):177\u2013197","journal-title":"J Sched"},{"issue":"3","key":"529_CR15","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ejor.2008.04.038","volume":"196","author":"JVD Broek","year":"2009","unstructured":"Broek JVD, Hurkens C, Woeginger G (2009) Timetabling problems at the TU Eindhoven. Eur J Oper Res 196(3):877\u2013885","journal-title":"Eur J Oper Res"},{"issue":"2","key":"529_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"EK Burke","year":"2002","unstructured":"Burke EK, Petrovic S (2002) Recent research directions in automated timetabling. Eur J Oper Res 140(2):266\u2013280","journal-title":"Eur J Oper Res"},{"issue":"1","key":"529_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1):177\u2013192","journal-title":"Eur J Oper Res"},{"issue":"7","key":"529_CR18","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia S, Gaspero LD, Schaerf A (2012) Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput Oper Res 39(7):1615\u20131624","journal-title":"Comput Oper Res"},{"issue":"1","key":"529_CR19","first-page":"100","volume":"2","author":"A Chaudhuri","year":"2010","unstructured":"Chaudhuri A, De K (2010) Fuzzy genetic heuristic for university course timetable problem. Int J Adv Soft Comput Appl 2(1):100\u2013123","journal-title":"Int J Adv Soft Comput Appl"},{"key":"529_CR20","first-page":"281","volume-title":"International conference on the practice and theory of automated timetabling","author":"TB Cooper","year":"1995","unstructured":"Cooper TB, Kingston JH (1995) The complexity of timetable construction problems. In: Burke E, Ross P (eds) International conference on the practice and theory of automated timetabling. Springer, pp 281\u2013295"},{"key":"529_CR21","doi-asserted-by":"crossref","unstructured":"Dandashi A, Al-Mouhamed M (2010) Graph coloring for class scheduling. In: ACS\/IEEE international conference on computer systems and applications (AICCSA 2010), Hammamet, Tunisia","DOI":"10.1109\/AICCSA.2010.5586963"},{"issue":"1","key":"529_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2003.06.023","volume":"160","author":"S Daskalaki","year":"2005","unstructured":"Daskalaki S, Birbas T (2005) Efficient solutions for a university timetabling problem through integer programming. Eur J Oper Res 160(1):106\u2013120","journal-title":"Eur J Oper Res"},{"issue":"1","key":"529_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0377-2217(03)00103-6","volume":"153","author":"S Daskalaki","year":"2004","unstructured":"Daskalaki S, Birbas T, Housos E (2004) An integer programming formulation for a case study in university timetabling. Eur J Oper Res 153(1):117\u2013135","journal-title":"Eur J Oper Res"},{"issue":"2","key":"529_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D De Werra","year":"1985","unstructured":"De Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151\u2013162","journal-title":"Eur J Oper Res"},{"issue":"3","key":"529_CR25","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","volume":"96","author":"D De Werra","year":"1997","unstructured":"De Werra D (1997) The combinatorics of timetabling. Eur J Oper Res 96(3):504\u2013513","journal-title":"Eur J Oper Res"},{"issue":"3","key":"529_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0952-1976(99)00007-X","volume":"12","author":"S Deris","year":"1999","unstructured":"Deris S, Omatu S, Ohta H, Saad P (1999) Incorporating constraint propagation in genetic algorithm for university timetable planning. Eng Appl Artif Intell 12(3):241\u2013253","journal-title":"Eng Appl Artif Intell"},{"issue":"9","key":"529_CR27","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/S0305-0548(99)00051-9","volume":"27","author":"S Deris","year":"2000","unstructured":"Deris S, Omatu S, Ohta H (2000) Timetable planning using the constraint-based reasoning. Comput Oper Res 27(9):819\u2013840","journal-title":"Comput Oper Res"},{"issue":"1","key":"529_CR28","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0377-2217(00)00052-7","volume":"130","author":"M Dimopoulou","year":"2001","unstructured":"Dimopoulou M, Miliotis P (2001) Implementation of a university course and examination timetabling system. Eur J Oper Res 130(1):202\u2013213","journal-title":"Eur J Oper Res"},{"issue":"1","key":"529_CR29","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0377-2217(03)00104-8","volume":"153","author":"M Dimopoulou","year":"2004","unstructured":"Dimopoulou M, Miliotis P (2004) An automated university course timetabling system developed in a distributed environment: a case study. Eur J Oper Res 153(1):136\u2013147","journal-title":"Eur J Oper Res"},{"key":"529_CR30","doi-asserted-by":"crossref","unstructured":"Even S, Itai A, Shamir A (1975) On the complexity of time table and multi-commodity flow problems. In: 16th annual symposium on foundations of computer science (pp 184\u2013193). IEEE.","DOI":"10.1109\/SFCS.1975.21"},{"key":"529_CR31","unstructured":"Feizi-Derakhshi MR, Babaei H, Heidarzadeh J (2012) A survey of approaches for university course timetabling problem. In: Proceedings of 8th international symposium on intelligent and manufacturing systems (IMS 2012), Antalya, Turkey"},{"issue":"1","key":"529_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2017.01.040","volume":"261","author":"SL Goh","year":"2017","unstructured":"Goh SL, Kendall G, Sabar NR (2017) Improved local search approaches to solve the post enrolment course timetabling problem. Eur J Oper Res 261(1):17\u201329","journal-title":"Eur J Oper Res"},{"issue":"3","key":"529_CR33","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.ejor.2011.02.019","volume":"212","author":"JK Hao","year":"2011","unstructured":"Hao JK, Benlic U (2011) Lower bounds for the ITC-2007 curriculum-based course timetabling problem. Eur J Oper Res 212(3):464\u2013472","journal-title":"Eur J Oper Res"},{"key":"529_CR34","unstructured":"Jamili A, Hamid M, Gharoun H, Khoshnoudi R (2018) Developing a comprehensive and multi-objective mathematical model for university course timetabling problem: a real case study. In: Proceedings of the international conference on industrial engineering and operations management, Paris, France"},{"issue":"3","key":"529_CR35","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0377-2217(92)90360-L","volume":"61","author":"L Kang","year":"1992","unstructured":"Kang L, White GM (1992) A logic approach to the resolution of constraints in timetabling. Eur J Oper Res 61(3):306\u2013317","journal-title":"Eur J Oper Res"},{"issue":"2","key":"529_CR36","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-016-2151-2","volume":"252","author":"A Kiefer","year":"2017","unstructured":"Kiefer A, Hartl RF, Schnell A (2017) Adaptive large neighborhood search for the curriculum-based course timetabling problem. Ann Oper Res 252(2):255\u2013282","journal-title":"Ann Oper Res"},{"issue":"2","key":"529_CR37","first-page":"446","volume":"9","author":"MS Kohshori","year":"2012","unstructured":"Kohshori MS, Abadeh MS (2012) Hybrid genetic algorithms for university course timetabling. Int J Comput Sci Issues 9(2):446\u2013455","journal-title":"Int J Comput Sci Issues"},{"key":"529_CR38","first-page":"235","volume-title":"International workshop on experimental and efficient algorithms","author":"G Lach","year":"2008","unstructured":"Lach G, L\u00fcbbecke ME (2008) Optimal university course timetables and the partial transversal polytope. In: McGeoch CC (ed) International workshop on experimental and efficient algorithms. Springer, pp 235\u2013248"},{"issue":"1","key":"529_CR39","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","volume":"194","author":"G Lach","year":"2012","unstructured":"Lach G, L\u00fcbbecke ME (2012) Curriculum based course timetabling: new solutions to Udine benchmark instances. Ann Oper Res 194(1):255\u2013272","journal-title":"Ann Oper Res"},{"issue":"01","key":"529_CR40","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1142\/S0218213008003868","volume":"17","author":"LF Lai","year":"2008","unstructured":"Lai LF, Wu CC, Hsueh NL, Huang LT, Hwang SF (2008) An artificial intelligence approach to course timetabling. Int J Artif Intell Tools 17(01):223\u2013240","journal-title":"Int J Artif Intell Tools"},{"key":"529_CR41","volume":"6","author":"A Lemos","year":"2019","unstructured":"Lemos A, Melo FS, Monteiro PT, Lynce I (2019) Room usage optimization in timetabling: A case study at Universidade de Lisboa. Oper Res Perspect 6:100092","journal-title":"Oper Res Perspect"},{"issue":"1","key":"529_CR42","first-page":"814","volume":"175","author":"SA MirHassani","year":"2006","unstructured":"MirHassani SA (2006) A computational approach to enhancing course timetabling with integer programming. Appl Math Comput 175(1):814\u2013822","journal-title":"Appl Math Comput"},{"issue":"2","key":"529_CR43","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10462-011-9262-6","volume":"39","author":"SA MirHassani","year":"2013","unstructured":"MirHassani SA, Habibi F (2013) Solution approaches to the course timetabling problem. Artif Intell Rev 39(2):133\u2013149","journal-title":"Artif Intell Rev"},{"issue":"1","key":"529_CR44","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10479-010-0735-9","volume":"181","author":"T M\u00fcller","year":"2010","unstructured":"M\u00fcller T, Murray K (2010) Comprehensive approach to student sectioning. Ann Oper Res 181(1):249\u2013269","journal-title":"Ann Oper Res"},{"issue":"1","key":"529_CR45","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10479-014-1643-1","volume":"239","author":"T M\u00fcller","year":"2016","unstructured":"M\u00fcller T, Rudov\u00e1 H (2016) Real-life curriculum-based timetabling with elective courses and course sections. Ann Oper Res 239(1):153\u2013170","journal-title":"Ann Oper Res"},{"key":"529_CR46","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2014.07.012","volume":"53","author":"AE Phillips","year":"2015","unstructured":"Phillips AE, Waterer H, Ehrgott M, Ryan DM (2015) Integer programming methods for large-scale practical classroom assignment problems. Comput Oper Res 53:42\u201353","journal-title":"Comput Oper Res"},{"key":"529_CR47","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10479-015-2094-z","volume":"252","author":"AE Phillips","year":"2017","unstructured":"Phillips AE, Walker CG, Ehrgott M, Ryan DM (2017) Integer programming for minimal perturbation problems in university course timetabling. Ann Oper Res 252:283\u2013304","journal-title":"Ann Oper Res"},{"issue":"2","key":"529_CR48","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87\u2013127","journal-title":"Artif Intell Rev"},{"issue":"4","key":"529_CR49","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s00291-006-0074-z","volume":"29","author":"K Schimmelpfeng","year":"2007","unstructured":"Schimmelpfeng K, Helber S (2007) Application of a real-world university-course timetabling model solved by integer programming. OR Spectrum 29(4):783\u2013803","journal-title":"OR Spectrum"},{"issue":"1","key":"529_CR50","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-017-2621-1","volume":"275","author":"D Schindl","year":"2019","unstructured":"Schindl D (2019) Optimal student sectioning on mandatory courses with various sections numbers. Ann Oper Res 275(1):209\u2013221","journal-title":"Ann Oper Res"},{"issue":"2","key":"529_CR51","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.ejor.2015.11.028","volume":"251","author":"H Vermuyten","year":"2016","unstructured":"Vermuyten H, Lemmens S, Marques I, Beli\u00ebn J (2016) Developing compact course timetables with optimized student flows. Eur J Oper Res 251(2):651\u2013661","journal-title":"Eur J Oper Res"},{"issue":"4","key":"529_CR52","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0957-4174(02)00017-9","volume":"22","author":"YZ Wang","year":"2002","unstructured":"Wang YZ (2002) An application of genetic algorithm methods for teacher assignment problems. Expert Syst Appl 22(4):295\u2013302","journal-title":"Expert Syst Appl"},{"issue":"1","key":"529_CR53","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh DJA, Powell MB (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10(1):85\u201386","journal-title":"Comput J"},{"key":"529_CR54","unstructured":"Zhang L, Lau S (2005) Constructing university timetable using constraint satisfaction programming approach. In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC'06), Vienna, Austria"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-025-00529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-025-00529-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-025-00529-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:02:23Z","timestamp":1750251743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-025-00529-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,24]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["529"],"URL":"https:\/\/doi.org\/10.1007\/s10287-025-00529-2","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,24]]},"assertion":[{"value":"30 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 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 the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Authors express consent to participate in this article and express that they know, respect and comply with the ethical requirements for the publication of the document.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}}],"article-number":"3"}}