{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:18Z","timestamp":1740124218624,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T00:00:00Z","timestamp":1693180800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T00:00:00Z","timestamp":1693180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CPS-1932530"],"award-info":[{"award-number":["CPS-1932530"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11241-023-09408-y","type":"journal-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T16:04:21Z","timestamp":1693238661000},"page":"24-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cutting-plane algorithms for preemptive uniprocessor scheduling problems"],"prefix":"10.1007","volume":"60","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9312-0081","authenticated-orcid":false,"given":"Abhishek","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"5","key":"9408_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1049\/sej.1993.0034","volume":"8","author":"N Audsley","year":"1993","unstructured":"Audsley N, Burns A, Richardson M et al (1993) Applying new scheduling theory to static priority pre-emptive scheduling. Softw Eng J 8(5):284\u2013292. https:\/\/doi.org\/10.1049\/sej.1993.0034","journal-title":"Softw Eng J"},{"issue":"2\u20133","key":"9408_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01094342","volume":"8","author":"NC Audsley","year":"1995","unstructured":"Audsley NC, Burns A, Davis RI et al (1995) Fixed priority pre-emptive scheduling: an historical perspective. Real-Time Syst 8(2\u20133):173\u2013198. https:\/\/doi.org\/10.1007\/BF01094342","journal-title":"Real-Time Syst"},{"key":"9408_CR3","doi-asserted-by":"publisher","unstructured":"Baruah S, Fisher N (2005) Real-time scheduling of sporadic task systems when the number of distinct task types is small. In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA\u201905), pp 232\u2013237, https:\/\/doi.org\/10.1109\/RTCSA.2005.75","DOI":"10.1109\/RTCSA.2005.75"},{"key":"9408_CR4","doi-asserted-by":"publisher","unstructured":"Baruah S, Mok A, Rosier L (1990a) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: [1990] Proceedings 11th Real-Time Systems Symposium, pp 182\u2013190, https:\/\/doi.org\/10.1109\/REAL.1990.128746","DOI":"10.1109\/REAL.1990.128746"},{"key":"9408_CR5","doi-asserted-by":"crossref","unstructured":"Baruah S, Ekberg P, Singh A (2022) Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems. In: 2022 IEEE Real-Time Systems Symposium, p\u00a012","DOI":"10.1109\/RTSS55097.2022.00025"},{"issue":"4","key":"9408_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01995675","volume":"2","author":"SK Baruah","year":"1990","unstructured":"Baruah SK, Rosier LE, Howell RR (1990) Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst 2(4):301\u2013324. https:\/\/doi.org\/10.1007\/BF01995675","journal-title":"Real-Time Syst"},{"key":"9408_CR7","doi-asserted-by":"publisher","unstructured":"Bini E (2019) Cutting the Unnecessary Deadlines in EDF. In: 2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pp 1\u20138, https:\/\/doi.org\/10.1109\/RTCSA.2019.8864569","DOI":"10.1109\/RTCSA.2019.8864569"},{"issue":"11","key":"9408_CR8","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/TC.2004.103","volume":"53","author":"E Bini","year":"2004","unstructured":"Bini E, Buttazzo G (2004) Schedulability analysis of periodic fixed priority systems. IEEE Trans Comput 53(11):1462\u20131473. https:\/\/doi.org\/10.1109\/TC.2004.103","journal-title":"IEEE Trans Comput"},{"key":"9408_CR9","doi-asserted-by":"publisher","unstructured":"Bril R, Verhaegh W, Pol EJ (2003) Initial values for online response time calculations. In: 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings., pp 13\u201322, https:\/\/doi.org\/10.1109\/EMRTS.2003.1212722","DOI":"10.1109\/EMRTS.2003.1212722"},{"key":"9408_CR10","doi-asserted-by":"publisher","unstructured":"Bubeck S (2015) Convex Optimization: Algorithms and Complexity. https:\/\/doi.org\/10.48550\/arXiv.1405.4980, http:\/\/arxiv.org\/abs\/1405.4980, arXiv:1405.4980 [cs, math, stat]","DOI":"10.48550\/arXiv.1405.4980"},{"key":"9408_CR11","volume-title":"Numerical analysis","author":"RL Burden","year":"2011","unstructured":"Burden RL, Faires JD (2011) Numerical analysis, 9th edn. Cengage Learning, Boston","edition":"9"},{"issue":"1","key":"9408_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:TIME.0000048932.30002.d9","volume":"29","author":"GC Buttazzo","year":"2005","unstructured":"Buttazzo GC (2005) Rate monotonic vs. EDF: judgment day. Real-Time Syst 29(1):5\u201326. https:\/\/doi.org\/10.1023\/B:TIME.0000048932.30002.d9","journal-title":"Real-Time Syst"},{"key":"9408_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0676-1","volume-title":"Hard real-time computing systems: predictable scheduling algorithms and applications","author":"GC Buttazzo","year":"2011","unstructured":"Buttazzo GC (2011) Hard real-time computing systems: predictable scheduling algorithms and applications, 3rd edn. Springer Publishing Company, Incorporated, Cham","edition":"3"},{"key":"9408_CR14","doi-asserted-by":"publisher","unstructured":"Chv\u00e1tal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics 4(4):305\u2013337, https:\/\/doi.org\/10.1016\/0012-365X(73)90167-2, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X73901672","DOI":"10.1016\/0012-365X(73)90167-2"},{"key":"9408_CR15","doi-asserted-by":"publisher","unstructured":"Cook W, Coullard CR, Tur\u00e1n G (1987) On the complexity of cutting-plane proofs. Discrete Applied Mathematics 18(1):25\u201338, https:\/\/doi.org\/10.1016\/0166-218X(87)90039-4, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X87900394","DOI":"10.1016\/0166-218X(87)90039-4"},{"issue":"3","key":"9408_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s12532-013-0055-6","volume":"5","author":"W Cook","year":"2013","unstructured":"Cook W, Koch T, Steffy DE et al (2013) A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math Progr Comput 5(3):305\u2013344. https:\/\/doi.org\/10.1007\/s12532-013-0055-6","journal-title":"Math Progr Comput"},{"key":"9408_CR17","unstructured":"Dantzig GB (1987) Origins of the Simplex Method. Tech. Rep. SOL 87-5, Department of Operations Research, Stanford University, https:\/\/apps.dtic.mil\/sti\/citations\/ADA182708, section: Technical Reports"},{"issue":"9","key":"9408_CR18","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/TC.2008.66","volume":"57","author":"RI Davis","year":"2008","unstructured":"Davis RI, Zabos A, Burns A (2008) Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans Comput 57(9):1261\u20131276. https:\/\/doi.org\/10.1109\/TC.2008.66","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"9408_CR19","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s10107-021-01749-5","volume":"197","author":"L Eifler","year":"2023","unstructured":"Eifler L, Gleixner A (2023) A computational status update for exact rational mixed integer programming. Math Progr 197(2):793\u2013812. https:\/\/doi.org\/10.1007\/s10107-021-01749-5","journal-title":"Math Progr"},{"key":"9408_CR20","doi-asserted-by":"publisher","unstructured":"Ekberg P, Yi W (2017) Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard. In: 2017 IEEE Real-Time Systems Symposium (RTSS), pp 139\u2013146, https:\/\/doi.org\/10.1109\/RTSS.2017.00020","DOI":"10.1109\/RTSS.2017.00020"},{"key":"9408_CR21","unstructured":"George L, Rivierre N, Spuri M (1996) Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling. Report, INRIA"},{"key":"9408_CR22","doi-asserted-by":"publisher","unstructured":"Griffin D, Bate I, Davis RI (2020) Generating Utilization Vectors for the Systematic Evaluation of Schedulability Tests. In: 2020 IEEE Real-Time Systems Symposium (RTSS), pp 76\u201388, https:\/\/doi.org\/10.1109\/RTSS49844.2020.00018","DOI":"10.1109\/RTSS49844.2020.00018"},{"key":"9408_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric algorithms and combinatorial optimization, algorithms and combinatorics","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1993) Geometric algorithms and combinatorial optimization, algorithms and combinatorics. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-78240-4"},{"issue":"1","key":"9408_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02186368","volume":"12","author":"JN Hooker","year":"1988","unstructured":"Hooker JN (1988) Generalized resolution and cutting planes. Ann Oper Res 12(1):217\u2013239. https:\/\/doi.org\/10.1007\/BF02186368","journal-title":"Ann Oper Res"},{"issue":"5","key":"9408_CR25","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1093\/comjnl\/29.5.390","volume":"29","author":"M Joseph","year":"1986","unstructured":"Joseph M, Pandya P (1986) Finding response times in a real-time system. Comput J 29(5):390\u2013395. https:\/\/doi.org\/10.1093\/comjnl\/29.5.390","journal-title":"Comput J"},{"issue":"4","key":"9408_CR26","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373\u2013395. https:\/\/doi.org\/10.1007\/BF02579150","journal-title":"Combinatorica"},{"issue":"1","key":"9408_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan LG (1980) Polynomial algorithms in linear programming. USSR Comput Math Mathe Phys 20(1):53\u201372. https:\/\/doi.org\/10.1016\/0041-5553(80)90061-0","journal-title":"USSR Comput Math Mathe Phys"},{"key":"9408_CR28","doi-asserted-by":"publisher","unstructured":"Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In: [1989] Proceedings. Real-Time Systems Symposium, pp 166\u2013171, https:\/\/doi.org\/10.1109\/REAL.1989.63567","DOI":"10.1109\/REAL.1989.63567"},{"issue":"4","key":"9408_CR29","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra HW (1983) Integer programming with a fixed number of variables. Math Oper Res 8(4):538\u2013548","journal-title":"Math Oper Res"},{"key":"9408_CR30","volume-title":"Handbook of real-time computing","author":"DC Levy","year":"2020","unstructured":"Levy DC, Tian YC (2020) Handbook of real-time computing. Springer Singapore, Singapore"},{"issue":"1","key":"9408_CR31","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu CL, Layland JW (1973) Scheduling Algorithms for Multiprogramming in a hard-real-time environment. J ACM 20(1):46\u201361. https:\/\/doi.org\/10.1145\/321738.321743","journal-title":"J ACM"},{"key":"9408_CR32","volume-title":"Real-Time System","author":"JWSW Liu","year":"2000","unstructured":"Liu JWSW (2000) Real-Time System, 1st edn. Prentice Hall PTR, Hoboken","edition":"1"},{"key":"9408_CR33","doi-asserted-by":"publisher","unstructured":"Lu WC, Hsieh JW, Shih WK (2006) A precise schedulability test algorithm for scheduling periodic tasks in real-time systems. In: Proceedings of the 2006 ACM Symposium on Applied Computing. Association for Computing Machinery, New York, NY, USA, SAC \u201906, pp 1451\u20131455, https:\/\/doi.org\/10.1145\/1141277.1141616","DOI":"10.1145\/1141277.1141616"},{"issue":"2","key":"9408_CR34","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1007964900035","volume":"14","author":"Y Manabe","year":"1998","unstructured":"Manabe Y, Aoyagi S (1998) A feasibility decision algorithm for rate monotonic and deadline monotonic scheduling. Real-Time Syst 14(2):171\u2013181. https:\/\/doi.org\/10.1023\/A:1007964900035","journal-title":"Real-Time Syst"},{"key":"9408_CR35","volume-title":"Understanding and using linear programming","author":"J Matou\u0161ek","year":"2007","unstructured":"Matou\u0161ek J, G\u00e4rtner B (2007) Understanding and using linear programming, 1st edn. Springer, Berlin","edition":"1"},{"issue":"1","key":"9408_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11081-011-9176-9","volume":"13","author":"J Mattingley","year":"2012","unstructured":"Mattingley J, Boyd S (2012) CVXGEN: a code generator for embedded convex optimization. Optim Eng 13(1):1\u201327. https:\/\/doi.org\/10.1007\/s11081-011-9176-9","journal-title":"Optim Eng"},{"key":"9408_CR37","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-031-06678-8_33","volume-title":"Combinatorial algorithms","author":"THC Nguyen","year":"2022","unstructured":"Nguyen THC, Grass W, Jansen K (2022) Exact polynomial time algorithm for the response time analysis of harmonic tasks. In: Bazgan C, Fernau H (eds) Combinatorial algorithms. Springer International Publishing, Cham, pp 451\u2013465. https:\/\/doi.org\/10.1007\/978-3-031-06678-8_33"},{"issue":"1","key":"9408_CR38","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33(1):60\u2013100","journal-title":"SIAM Rev"},{"issue":"106","key":"9408_CR39","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ipl.2022.106296","volume":"179","author":"M Park","year":"2023","unstructured":"Park M, Baek H (2023) Determining rate monotonic schedulability of real-time periodic tasks using continued fractions. Information Proc Lett 179(106):296. https:\/\/doi.org\/10.1016\/j.ipl.2022.106296","journal-title":"Information Proc Lett"},{"issue":"102","key":"9408_CR40","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.sysarc.2021.102236","volume":"119","author":"D Perale","year":"2021","unstructured":"Perale D, Vardanega T (2021) Removing bias from the judgment day: a Ravenscar-based toolbox for quantitative comparison of EDF-to-RM uniprocessor scheduling. J Syst Archit 119(102):236. https:\/\/doi.org\/10.1016\/j.sysarc.2021.102236","journal-title":"J Syst Archit"},{"key":"9408_CR41","unstructured":"Queyranne M, Schulz AS (1996) Polyhedral approaches to machine scheduling"},{"issue":"1","key":"9408_CR42","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF00365519","volume":"11","author":"I Ripoll","year":"1996","unstructured":"Ripoll I, Crespo A, Mok AK (1996) Improvement in feasibility testing for real-time tasks. Real-Time Syst 11(1):19\u201339. https:\/\/doi.org\/10.1007\/BF00365519","journal-title":"Real-Time Syst"},{"key":"9408_CR43","doi-asserted-by":"publisher","unstructured":"Rivas JM, Gutierrez JJ, Palencia JC, et\u00a0al (2011) Schedulability Analysis and Optimization of Heterogeneous EDF and FP Distributed Real-Time Systems. In: 2011 23rd Euromicro Conference on Real-Time Systems, pp 195\u2013204, https:\/\/doi.org\/10.1109\/ECRTS.2011.26","DOI":"10.1109\/ECRTS.2011.26"},{"key":"9408_CR44","doi-asserted-by":"publisher","unstructured":"Selman B, Mitchell DG, Levesque HJ (1996) Generating hard satisfiability problems. Artificial Intelligence 81(1):17\u201329, https:\/\/doi.org\/10.1016\/0004-3702(95)00045-3, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0004370295000453","DOI":"10.1016\/0004-3702(95)00045-3"},{"issue":"2","key":"9408_CR45","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:TIME.0000045315.61234.1e","volume":"28","author":"L Sha","year":"2004","unstructured":"Sha L, Abdelzaher T, \u00c5rz\u00e9n KE, et al (2004) Real time scheduling theory: a historical perspective. Real-Time Syst 28(2):101\u2013155. https:\/\/doi.org\/10.1023\/B:TIME.0000045315.61234.1e","journal-title":"Real-Time Syst"},{"key":"9408_CR56","doi-asserted-by":"publisher","unstructured":"Singh A (2023) abhcs\/rtsched, 0.1.2. https:\/\/doi.org\/10.5281\/zenodo.7938966","DOI":"10.5281\/zenodo.7938966"},{"key":"9408_CR46","doi-asserted-by":"publisher","unstructured":"Sjodin M, Hansson H (1998) Improved response-time analysis calculations. In: Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279), pp 399\u2013408, https:\/\/doi.org\/10.1109\/REAL.1998.739773","DOI":"10.1109\/REAL.1998.739773"},{"key":"9408_CR47","unstructured":"Spuri M (1996) Analysis of deadline scheduled real-time systems. Report, INRIA"},{"key":"9408_CR48","unstructured":"Spuri M (1996) Holistic analysis for deadline scheduled real-time distributed systems. Report, INRIA"},{"issue":"2","key":"9408_CR49","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0165-6074(94)90080-9","volume":"40","author":"K Tindell","year":"1994","unstructured":"Tindell K, Clark J (1994) Holistic schedulability analysis for distributed hard real-time systems. Microprocessing Microprogramming 40(2):117\u2013134. https:\/\/doi.org\/10.1016\/0165-6074(94)90080-9","journal-title":"Microprocessing Microprogramming"},{"issue":"3","key":"9408_CR50","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10107990047a","volume":"85","author":"J van den Akker","year":"1999","unstructured":"van den Akker J, van Hoesel C, Savelsbergh M (1999) A polyhedral approach to single-machine scheduling problems. Math Progr 85(3):541\u2013572. https:\/\/doi.org\/10.1007\/s10107990047a","journal-title":"Math Progr"},{"key":"9408_CR51","unstructured":"Wolsey LA (1998) Integer programming \/ laurence A. Wolsey. In: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization, J. Wiley, New York"},{"issue":"4","key":"9408_CR52","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TC.2012.21","volume":"62","author":"H Zeng","year":"2013","unstructured":"Zeng H, Di Natale M (2013) An efficient formulation of the real-time feasibility region for design optimization. IEEE Trans Comput 62(4):644\u2013661. https:\/\/doi.org\/10.1109\/TC.2012.21","journal-title":"IEEE Trans Comput"},{"key":"9408_CR53","doi-asserted-by":"publisher","unstructured":"Zhang F, Burns A (2009a) Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems. In: 2009 21st Euromicro Conference on Real-Time Systems, pp 76\u201386, https:\/\/doi.org\/10.1109\/ECRTS.2009.20","DOI":"10.1109\/ECRTS.2009.20"},{"issue":"9","key":"9408_CR54","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/TC.2009.58","volume":"58","author":"F Zhang","year":"2009","unstructured":"Zhang F, Burns A (2009) Schedulability analysis for real-time systems with EDF scheduling. IEEE Trans Comput 58(9):1250\u20131258. https:\/\/doi.org\/10.1109\/TC.2009.58","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"9408_CR55","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/2442116.2442117","volume":"12","author":"F Zhang","year":"2013","unstructured":"Zhang F, Burns A (2013) Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing. ACM Trans Embed Comput Syst 12(3):61\u201369. https:\/\/doi.org\/10.1145\/2442116.2442117","journal-title":"ACM Trans Embed Comput Syst"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-023-09408-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11241-023-09408-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-023-09408-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T17:09:25Z","timestamp":1713805765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11241-023-09408-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,28]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["9408"],"URL":"https:\/\/doi.org\/10.1007\/s11241-023-09408-y","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2023,8,28]]},"assertion":[{"value":"31 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":2,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}