{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T17:05:58Z","timestamp":1767200758716,"version":"3.48.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["884\/22"],"award-info":[{"award-number":["884\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10878-025-01365-5","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T17:55:49Z","timestamp":1764611749000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single machine lot scheduling with maintenance activity"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2824-8214","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,1]]},"reference":[{"key":"1365_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I Adiri","year":"1989","unstructured":"Adiri I, Bruno J, Frostig E, Rinnooy Kan AHG (1989) Single machine flow-time scheduling with a single breakdown. Acta Informatica 26:679\u2013696","journal-title":"Acta Informatica"},{"key":"1365_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105827","volume":"144","author":"M Atsmony","year":"2022","unstructured":"Atsmony M, Mosheiov G (2022) A greedy heuristic for solving scheduling problems with bounded rejection cost. Comput Oper Res 144:105827","journal-title":"Comput Oper Res"},{"key":"1365_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s12351-023-00744-2","volume":"23","author":"N Biber","year":"2023","unstructured":"Biber N, Mor B, Schlissel Y, Shapira D (2023) Lot scheduling involving completion time problems on identical parallel machines. Oper Res Int Journal 23:12","journal-title":"Oper Res Int Journal"},{"key":"1365_CR4","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s10878-020-00654-5","volume":"43","author":"Y Chen","year":"2022","unstructured":"Chen Y, Cheng Y, Zhang G (2022) Single machine lot scheduling with non-uniform lot capacities and processing times. J Comb Optim 43:1359\u20131367","journal-title":"J Comb Optim"},{"key":"1365_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2020.09.042","volume":"291","author":"M de Weerdt","year":"2021","unstructured":"de Weerdt M, Baart R, He L (2021) Single-machine scheduling with release times, deadlines, setup times, and rejection. Eur J Oper Res 291:629\u2013639","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1365_CR6","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1007\/s10878-021-00715-3","volume":"43","author":"J Fan","year":"2022","unstructured":"Fan J, Shi H (2022) Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance. J Comb Optim 43(5):1645\u20131654","journal-title":"J Comb Optim"},{"key":"1365_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105329","volume":"133","author":"D Freud","year":"2021","unstructured":"Freud D, Mosheiov G (2021) Scheduling with competing agents, total late work and job rejection. Comput Oper Res 133:105329","journal-title":"Comput Oper Res"},{"key":"1365_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and algorithms of time-dependent scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz S (2020) Models and algorithms of time-dependent scheduling. Springer, Berlin Heidelberg"},{"key":"1365_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10951-022-00731-z","volume":"25","author":"D Hermelin","year":"2022","unstructured":"Hermelin D, Shabtay D, Zelig C, Pinedo M (2022) A general scheme for solving a large set of scheduling problems with rejection in FPT time. J Sched 25:229\u2013255","journal-title":"J Sched"},{"key":"1365_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"Y-T Hou","year":"2014","unstructured":"Hou Y-T, Yang D-L, Kuo W-H (2014) Lot scheduling on a single machine. Inf Process Lett 114:718\u2013722","journal-title":"Inf Process Lett"},{"issue":"20","key":"1365_CR11","doi-asserted-by":"publisher","first-page":"4799","DOI":"10.1016\/j.ins.2011.06.010","volume":"181","author":"CJ Hsu","year":"2011","unstructured":"Hsu CJ, Cheng TE, Yang DL (2011) Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time. Inf Sci 181(20):4799\u20134803","journal-title":"Inf Sci"},{"key":"1365_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10878-011-9415-1","volume":"26","author":"M Ji","year":"2013","unstructured":"Ji M, Hsu CJ, Yang DL (2013) Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration. J Comb Optim 26:437\u2013447","journal-title":"J Comb Optim"},{"issue":"2","key":"1365_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2021.07.023","volume":"298","author":"H Kim","year":"2022","unstructured":"Kim H, Kim BI (2022) Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration. Eur J Oper Res 298(2):439\u2013450","journal-title":"Eur J Oper Res"},{"key":"1365_CR14","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.ejor.2022.06.025","volume":"305","author":"C Koulamas","year":"2023","unstructured":"Koulamas C, Kyparisis GJ (2023) Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection. Eur J Oper Res 305:608\u2013616","journal-title":"Eur J Oper Res"},{"key":"1365_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10951-020-00671-6","volume":"24","author":"C Koulamas","year":"2021","unstructured":"Koulamas C, Steiner G (2021) New results for scheduling to minimize tardiness on one machine with rejection and related problems. J Sched 24:27\u201334","journal-title":"J Sched"},{"issue":"1","key":"1365_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0377-2217(99)00066-1","volume":"128","author":"CY Lee","year":"2001","unstructured":"Lee CY, Leon VJ (2001) Machine scheduling with a rate-modifying activity. Eur J Oper Res 128(1):119\u2013128","journal-title":"Eur J Oper Res"},{"key":"1365_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"CY Lee","year":"1992","unstructured":"Lee CY, Liman SD (1992) Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29:375\u2013382","journal-title":"Acta Informatica"},{"key":"1365_CR18","volume-title":"Handbook of Combinatorial Optimization","author":"N Li","year":"2025","unstructured":"Li N, Zheng F, Liu M (2025) Lot Scheduling: Review. In: Pardalos PM, Du DZ, Thai MT (eds) Handbook of Combinatorial Optimization. Springer, New York"},{"key":"1365_CR19","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595923500409","author":"M Liu","year":"2024","unstructured":"Liu M, Liu Z, Zheng F, Chu C (2024) Mathematical models and optimal algorithms for lot scheduling considering job splitting and due dates in green logistics. Asia-Pac J Oper Res. https:\/\/doi.org\/10.1142\/S0217595923500409","journal-title":"Asia-Pac J Oper Res"},{"key":"1365_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2020.08.009","volume":"290","author":"R Ma","year":"2021","unstructured":"Ma R, Guo S (2021) Applying \u201cPeeling Onion\u201d approach for competitive analysis in online scheduling with rejection. Eur J Oper Res 290:57\u201367","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1365_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/0305215X.2020.1722119","volume":"53","author":"B Mor","year":"2021","unstructured":"Mor B (2021) Single-machine lot scheduling with variable lot processing times. Eng Optim 53(2):321\u2013334","journal-title":"Eng Optim"},{"key":"1365_CR22","volume":"23","author":"B Mor","year":"2023","unstructured":"Mor B (2023) Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection. Oper Res 23:10","journal-title":"Oper Res"},{"issue":"4","key":"1365_CR23","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.cie.2011.12.013","volume":"62","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012) Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times. Comput Ind Eng 62(4):908\u2013916","journal-title":"Comput Ind Eng"},{"issue":"2","key":"1365_CR24","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-021-00709-1","volume":"42","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G (2021) A note on the single machine CON and CONW problems with lot scheduling. J Comb Optim 42(2):327\u2013338","journal-title":"J Comb Optim"},{"key":"1365_CR25","first-page":"2707","volume":"22","author":"B Mor","year":"2022","unstructured":"Mor B, Mosheiov G (2022) Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper Res 22:2707\u20132719","journal-title":"Oper Res"},{"issue":"19","key":"1365_CR26","doi-asserted-by":"publisher","first-page":"6933","DOI":"10.1080\/00207543.2024.2314714","volume":"62","author":"B Mor","year":"2024","unstructured":"Mor B, Mosheiov G (2024) Scheduling on parallel dedicated machines with job rejection. Int J Prod Res 62(19):6933\u20136940","journal-title":"Int J Prod Res"},{"key":"1365_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.106009","volume":"164","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G, Shapira D (2020) Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf Process Lett 164:106009","journal-title":"Inf Process Lett"},{"issue":"1","key":"1365_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G, Shapira D (2021) Single machine lot scheduling with optional job-rejection. J Comb Optim 41(1):1\u201311","journal-title":"J Comb Optim"},{"key":"1365_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108168","volume":"169","author":"B Mor","year":"2022","unstructured":"Mor B, Shabtay D (2022) Single-machine scheduling with total late work and job rejection. Comput Ind Eng 169:108168","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1365_CR30","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s10878-022-00845-2","volume":"44","author":"B Mor","year":"2022","unstructured":"Mor B, Shapira D (2022) Single machine scheduling with non-availability interval and optional job rejection. J Comb Optim 44(1):480\u2013497","journal-title":"J Comb Optim"},{"key":"1365_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107138","volume":"154","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov G, Oron D (2021) A note on scheduling a rate modifying activity to minimize total late work. Computers Ind Eng 154:107138","journal-title":"Computers Ind Eng"},{"issue":"3","key":"1365_CR32","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1080\/0305215X.2020.1735380","volume":"53","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov G, Pruwer S (2021) On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Eng Optim 53(3):408\u2013424","journal-title":"Eng Optim"},{"issue":"5","key":"1365_CR33","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10878-023-01040-7","volume":"45","author":"G Mosheiov","year":"2023","unstructured":"Mosheiov G, Sarig A (2023) A note on lot scheduling on a single machine to minimize maximum weighted tardiness. J Comb Optim 45(5):128","journal-title":"J Comb Optim"},{"issue":"2","key":"1365_CR34","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.ejor.2018.04.019","volume":"271","author":"G Mosheiov","year":"2018","unstructured":"Mosheiov G, Sarig A, Strusevich VA, Mosheiff J (2018) Two-machine flow shop and open shop scheduling problems with a single maintenance window. Eur J Oper Res 271(2):388\u2013400","journal-title":"Eur J Oper Res"},{"key":"1365_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102313","volume":"102","author":"D Oron","year":"2021","unstructured":"Oron D (2021) Two-agent scheduling problems under rejection budget constraints. Omega 102:102313","journal-title":"Omega"},{"issue":"3","key":"1365_CR36","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1057\/jors.2014.18","volume":"66","author":"K Rustogi","year":"2015","unstructured":"Rustogi K, Strusevich VA (2015) Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance. J Oper Res Soc 66(3):500\u2013515","journal-title":"J Oper Res Soc"},{"key":"1365_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"1365_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.116380","volume":"459","author":"H Shen","year":"2025","unstructured":"Shen H, Simic V, Li S, Pamucar D (2025) Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine. J Comput Appl Math 459:116380","journal-title":"J Comput Appl Math"},{"issue":"1","key":"1365_CR39","first-page":"1","volume":"25","author":"J Song","year":"2025","unstructured":"Song J, Miao C, Kong F (2025) Scheduling with step learning and job rejection. Oper Res 25(1):1\u201318","journal-title":"Oper Res"},{"key":"1365_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with time-changing effects and rate-modifying activities","author":"VA Strusevich","year":"2017","unstructured":"Strusevich VA, Rustogi K (2017) Scheduling with time-changing effects and rate-modifying activities. Springer International Publishing, Cham, Switzerland"},{"issue":"3","key":"1365_CR41","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1080\/0305215X.2020.1740921","volume":"53","author":"JB Wang","year":"2021","unstructured":"Wang JB, Hu Y, Zhang B (2021) Common due-window assignment for single-machine scheduling with generalized earliness\/tardiness penalties and a rate-modifying activity. Eng Optim 53(3):496\u2013512","journal-title":"Eng Optim"},{"key":"1365_CR42","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cie.2017.05.007","volume":"109","author":"YB Woo","year":"2017","unstructured":"Woo YB, Jung S, Kim BS (2017) A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Comput Ind Eng 109:179\u2013190","journal-title":"Comput Ind Eng"},{"issue":"4","key":"1365_CR43","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1080\/00207543.2013.841330","volume":"52","author":"DL Yang","year":"2014","unstructured":"Yang DL, Cheng TCE, Yang SJ (2014) Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions. Int J Prod Res 52(4):1133\u20131141","journal-title":"Int J Prod Res"},{"key":"1365_CR44","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.cor.2016.10.004","volume":"79","author":"DL Yang","year":"2017","unstructured":"Yang DL, Hou YT, Kuo WH (2017) A note on a single-machine lot scheduling problem with indivisible orders. Comput Oper Res 79:34\u201338","journal-title":"Comput Oper Res"},{"key":"1365_CR45","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.ins.2013.02.013","volume":"235","author":"DL Yang","year":"2013","unstructured":"Yang DL, Yang SJ (2013) Unrelated parallel-machine scheduling problems with multiple rate-modifying activities. Inf Sci 235:280\u2013286","journal-title":"Inf Sci"},{"issue":"1","key":"1365_CR46","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.cie.2012.02.015","volume":"63","author":"Y Yin","year":"2012","unstructured":"Yin Y, Cheng TCE, Xu D, Wu CC (2012) Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost. Comput Ind Eng 63(1):223\u2013234","journal-title":"Comput Ind Eng"},{"key":"1365_CR47","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2018.10.002","volume":"142","author":"E Zhang","year":"2019","unstructured":"Zhang E, Liu M, Zheng F, Xu Y (2019) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46\u201351","journal-title":"Inf Process Lett"},{"issue":"3","key":"1365_CR48","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1057\/s41274-017-0200-0","volume":"69","author":"X Zhang","year":"2018","unstructured":"Zhang X, Wu WH, Lin WC, Wu CC (2018) Machine scheduling problems under deteriorating effects and deteriorating rate-modifying activities. J Oper Res Soc 69(3):439\u2013448","journal-title":"J Oper Res Soc"},{"issue":"6","key":"1365_CR49","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1016\/j.cor.2010.04.006","volume":"39","author":"C Zhao","year":"2012","unstructured":"Zhao C, Tang H (2012) A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity. Comput Oper Res 39(6):1300\u20131303","journal-title":"Comput Oper Res"},{"key":"1365_CR50","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ifacol.2019.11.115","volume":"52","author":"F Zheng","year":"2019","unstructured":"Zheng F, Jin K (2019) An improved heuristic for single machine lot scheduling problem. IFAC-PapersOnLine 52:217\u2013222","journal-title":"IFAC-PapersOnLine"},{"key":"1365_CR51","volume-title":"Computing and Combinatorics COCOON 2024 Lecture Notes in Computer Science","author":"F Zheng","year":"2025","unstructured":"Zheng F, Li N, Liu M, Xu Y (2025) Single Machine Lot Scheduling to Minimize Maximum Weighted Completion Time. In: Chen Y, Gao X, Sun X, Zhang A (eds) Computing and Combinatorics COCOON 2024 Lecture Notes in Computer Science. Springer, Singapore"},{"issue":"1","key":"1365_CR52","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10878-021-00842-x","volume":"44","author":"H Zheng","year":"2022","unstructured":"Zheng H, Gao S, Liu W, Wu W, Du DZ, Hou B (2022) Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. J Comb Optim 44(1):343\u2013353","journal-title":"J Comb Optim"},{"issue":"1","key":"1365_CR53","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1080\/00207543.2016.1208852","volume":"55","author":"Z Zhu","year":"2017","unstructured":"Zhu Z, Zheng F, Chu C (2017) Multitasking scheduling problems with a rate-modifying activity. Int J Prod Res 55(1):296\u2013312","journal-title":"Int J Prod Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01365-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01365-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01365-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T17:01:50Z","timestamp":1767200510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01365-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":53,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1365"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01365-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"8 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 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 report there are no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"46"}}