{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T06:00:42Z","timestamp":1763445642699},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10489-023-04845-5","type":"journal-article","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T07:02:11Z","timestamp":1693378931000},"page":"26907-26926","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling for trial production with a parallel machine and multitasking scheduling model"],"prefix":"10.1007","volume":"53","author":[{"given":"Jinsheng","family":"Gao","sequence":"first","affiliation":[]},{"given":"Xiaomin","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Runtong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"4845_CR1","doi-asserted-by":"publisher","first-page":"3507","DOI":"10.4028\/www.scientific.net\/AMR.694-697.3507","volume":"694\u2013697","author":"LY Tao","year":"2013","unstructured":"Tao LY, Zhang M, Li ZD (2013) Study on the product quality control in small batch trial process. Adv Mater Res 694\u2013697:3507\u20133511. https:\/\/doi.org\/10.4028\/www.scientific.net\/AMR.694-697.3507","journal-title":"Adv Mater Res"},{"key":"4845_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.omega.2016.05.003","volume":"67","author":"Y Shi","year":"2017","unstructured":"Shi Y, Reich D, Epelman M, Klampfl E, Cohn A (2017) An analytical approach to prototype vehicle test scheduling. Omega 67:168\u2013176. https:\/\/doi.org\/10.1016\/j.omega.2016.05.003","journal-title":"Omega"},{"issue":"12","key":"4845_CR3","doi-asserted-by":"publisher","first-page":"3903","DOI":"10.1080\/00207543.2018.1471243","volume":"57","author":"Q Liu","year":"2019","unstructured":"Liu Q, Zhang H, Leng J, Chen X (2019) Digital twin-driven rapid individualised designing of automated flow-shop manufacturing system. Int J Prod Res 57(12):3903\u20133919. https:\/\/doi.org\/10.1080\/00207543.2018.1471243","journal-title":"Int J Prod Res"},{"issue":"7","key":"4845_CR4","doi-asserted-by":"publisher","first-page":"2254","DOI":"10.1080\/00207543.2021.1886368","volume":"60","author":"J Gao","year":"2021","unstructured":"Gao J, Zhu X, Bai K, Zhang R (2021) New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem. Int J Prod Res 60(7):2254\u20132274. https:\/\/doi.org\/10.1080\/00207543.2021.1886368","journal-title":"Int J Prod Res"},{"key":"4845_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-04090-2","author":"J Belabid","year":"2022","unstructured":"Belabid J, Aqil S, Allali K (2022) Nash equilibrium inspired greedy search for solving flow shop scheduling problems. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-022-04090-2","journal-title":"Applied Intelligence"},{"key":"4845_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.jmsy.2017.12.006","volume":"46","author":"DJL Siedlak","year":"2018","unstructured":"Siedlak DJL, Pinon OJ, Robertson BE, Mavris DN (2018) Robust simulation-based scheduling methodology to reduce the impact of manual installation tasks on low-volume aerospace production flows. J Manuf Syst 46:193\u2013207. https:\/\/doi.org\/10.1016\/j.jmsy.2017.12.006","journal-title":"J Manuf Syst"},{"issue":"6","key":"4845_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/nav.21863","volume":"66","author":"X Xiong","year":"2019","unstructured":"Xiong X, Zhou P, Yin Y, Cheng TCE, Li D (2019) An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Naval Research Logistics (NRL) 66(6):502\u2013516. https:\/\/doi.org\/10.1002\/nav.21863","journal-title":"Naval Research Logistics (NRL)"},{"issue":"6","key":"4845_CR8","doi-asserted-by":"publisher","first-page":"3464","DOI":"10.1111\/itor.13110","volume":"29","author":"J Gao","year":"2022","unstructured":"Gao J, Zhu X, Zhang R (2022) A branch-and-price approach to the multitasking scheduling with batch control on parallel machines. Int Trans Oper Res 29(6):3464\u20133485. https:\/\/doi.org\/10.1111\/itor.13110","journal-title":"Int Trans Oper Res"},{"issue":"8","key":"4845_CR9","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1111\/poms.12331","volume":"24","author":"NG Hall","year":"2015","unstructured":"Hall NG, Leung JYT, Li C (2015) The effects of multitasking on operations scheduling. Prod Oper Manag 24(8):1248\u20131265. https:\/\/doi.org\/10.1111\/poms.12331","journal-title":"Prod Oper Manag"},{"key":"4845_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.dam.2016.03.018","volume":"208","author":"NG Hall","year":"2016","unstructured":"Hall NG, Leung JYT, Li C (2016) Multitasking via alternate and shared processing: Algorithms and complexity. Discret Appl Math 208:41\u201358. https:\/\/doi.org\/10.1016\/j.dam.2016.03.018","journal-title":"Discret Appl Math"},{"issue":"7","key":"4845_CR11","doi-asserted-by":"publisher","first-page":"4143","DOI":"10.1007\/s10489-020-02027-1","volume":"51","author":"K Salimifard","year":"2021","unstructured":"Salimifard K, Li J, Mohammadi D, Moghdani R (2021) A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs. Appl Intell 51(7):4143\u20134161. https:\/\/doi.org\/10.1007\/s10489-020-02027-1","journal-title":"Appl Intell"},{"issue":"1\u20132","key":"4845_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3(1\u20132):59\u201366. https:\/\/doi.org\/10.1002\/nav.3800030106","journal-title":"Nav Res Logist Q"},{"issue":"7","key":"4845_CR13","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J Bruno","year":"1974","unstructured":"Bruno J, Coffman EG, Sethi R (1974) Scheduling independent tasks to reduce mean finishing time. Commun ACM 17(7):382\u2013387. https:\/\/doi.org\/10.1145\/361011.361064","journal-title":"Commun ACM"},{"key":"4845_CR14","doi-asserted-by":"crossref","unstructured":"Azizoglu M, Kirca O (1999) On the minimization of total weighted Flow time with identical and uniform parallel machines. Eur J Oper Res 32:91\u2013100. https:\/\/doi.org\/10.1016 &\/j.cor.2004.03.013","DOI":"10.1016\/S0377-2217(97)00427-X"},{"issue":"1","key":"4845_CR15","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z Chen","year":"1999","unstructured":"Chen Z, Powell WB (1999) solving parallel machine scheduling problems by Column generation. INFORMS J Comput 11(1):78\u201394. https:\/\/doi.org\/10.1287\/ijoc.11.1.78","journal-title":"INFORMS J Comput"},{"issue":"1","key":"4845_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.11.039","volume":"275","author":"A Kramer","year":"2019","unstructured":"Kramer A, Dell\u2018Amico M (2019) Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. Eur J Oper Res 275(1):67\u201379. https:\/\/doi.org\/10.1016\/j.ejor.2018.11.039","journal-title":"Eur J Oper Res"},{"issue":"5","key":"4845_CR17","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37(5):798\u2013804. https:\/\/doi.org\/10.1287\/opre.37.5.798","journal-title":"Oper Res"},{"issue":"2","key":"4845_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2004.03.022","volume":"167","author":"S Dunstall","year":"2005","unstructured":"Dunstall S, Wirth A (2005) A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. Eur J Oper Res 167(2):283\u2013296. https:\/\/doi.org\/10.1016\/j.ejor.2004.03.022","journal-title":"Eur J Oper Res"},{"issue":"9","key":"4845_CR19","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1016\/j.cor.2004.03.013","volume":"32","author":"S Dunstall","year":"2005","unstructured":"Dunstall S, Wirth A (2005) Heuristic methods for the identical parallel machine flowtime problem with set-up times. Comput Oper Res 32(9):2479\u20132491. https:\/\/doi.org\/10.1016\/j.cor.2004.03.013","journal-title":"Comput Oper Res"},{"issue":"7","key":"4845_CR20","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1002\/nav.10091","volume":"50","author":"Z Chen","year":"2003","unstructured":"Chen Z, Powell WB (2003) Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Res Logist 50(7):823\u2013840. https:\/\/doi.org\/10.1002\/nav.10091","journal-title":"Naval Res Logist"},{"issue":"1","key":"4845_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.camwa.2011.10.077","volume":"63","author":"C Liao","year":"2012","unstructured":"Liao C, Chao C, Chen L (2012) An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times. Comput Math Appl 63(1):110\u2013117. https:\/\/doi.org\/10.1016\/j.camwa.2011.10.077","journal-title":"Comput Math Appl"},{"issue":"3","key":"4845_CR22","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2019.07.006","volume":"289","author":"A Kramer","year":"2021","unstructured":"Kramer A, Iori M, Lacomme P (2021) Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization. Eur J Oper Res 289(3):825\u2013840. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.006","journal-title":"Eur J Oper Res"},{"key":"4845_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/4750791","volume":"2017","author":"Z Zhu","year":"2017","unstructured":"Zhu Z, Li J, Chu C (2017) Multitasking scheduling problems with deterioration effect. Math Prob Eng 2017:1\u201310. https:\/\/doi.org\/10.1155\/2017\/4750791","journal-title":"Math Prob Eng"},{"issue":"1","key":"4845_CR24","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. https:\/\/doi.org\/10.1080\/00207543.2016.1208852","journal-title":"Int J Prod Res"},{"issue":"5","key":"4845_CR25","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1111\/itor.12393","volume":"26","author":"Z Zhu","year":"2019","unstructured":"Zhu Z, Liu M, Chu C, Li J (2019) Multitasking scheduling with multiple rate-modifying activities. Int Trans Oper Res 26(5):1956\u20131976. https:\/\/doi.org\/10.1111\/itor.12393","journal-title":"Int Trans Oper Res"},{"key":"4845_CR26","doi-asserted-by":"publisher","first-page":"106569","DOI":"10.1016\/j.cie.2020.106569","volume":"146","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang J, Yin Y (2020) Multitasking scheduling and due year assignment with deterioration effect and efficiency promotion. Comput Indus Eng 146:106569. https:\/\/doi.org\/10.1016\/j.cie.2020.106569","journal-title":"Comput Indus Eng"},{"issue":"6","key":"4845_CR27","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1080\/00207543.2018.1497312","volume":"57","author":"M Ji","year":"2019","unstructured":"Ji M, Zhang W, Liao L, Cheng TCE, Tan Y (2019) Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment. Int J Prod Res 57(6):1667\u20131684. https:\/\/doi.org\/10.1080\/00207543.2018.1497312","journal-title":"Int J Prod Res"},{"key":"4845_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00600-5","author":"Y Yang","year":"2020","unstructured":"Yang Y, Yin G, Wang C, Yin Y (2020) Due date assignment and two-agent scheduling under multitasking environment. Journal of Combinatorial Optimization. https:\/\/doi.org\/10.1007\/s10878-020-00600-5","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"4845_CR29","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s40747-020-00184-x","volume":"7","author":"X Xu","year":"2021","unstructured":"Xu X, Yin G, Wang C (2021) Multitasking scheduling with batch distribution and due year assignment. Complex Intell Syst 7(1):191\u2013202. https:\/\/doi.org\/10.1007\/s40747-020-00184-x","journal-title":"Complex Intell Syst"},{"issue":"3","key":"4845_CR30","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1051\/ro\/2021079","volume":"55","author":"C Xu","year":"2021","unstructured":"Xu C, Xu Y, Zheng F, Liu M (2021) Multitasking scheduling problems with a common due-window. RAIRO - Oper Res 55(3):1787\u20131798. https:\/\/doi.org\/10.1051\/ro\/2021079","journal-title":"RAIRO - Oper Res"},{"issue":"5","key":"4845_CR31","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1007\/s00170-016-9226-8","volume":"89","author":"C Tseng","year":"2017","unstructured":"Tseng C, Lee C (2017) A new electromagnetism-like mechanism for identical parallel machine scheduling with family setup times. Int J Adv Manuf Technol 89(5):1865\u20131874. https:\/\/doi.org\/10.1007\/s00170-016-9226-8","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"4845_CR32","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s10845-021-01847-3","volume":"34","author":"BM Kayhan","year":"2023","unstructured":"Kayhan BM, Yildiz G (2023) Reinforcement learning applications to machine scheduling problems: a comprehensive literature review. J Intell Manuf 34(3):905\u2013929. https:\/\/doi.org\/10.1007\/s10845-021-01847-3","journal-title":"J Intell Manuf"},{"key":"4845_CR33","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.procir.2020.05.163","volume":"93","author":"L Zhou","year":"2020","unstructured":"Zhou L, Zhang L, Horn BKP (2020) Deep reinforcement learning-based dynamic scheduling in smart manufacturing. Procedia CIRP 93:383\u2013388. https:\/\/doi.org\/10.1016\/j.procir.2020.05.163","journal-title":"Procedia CIRP"},{"key":"4845_CR34","doi-asserted-by":"publisher","first-page":"101390","DOI":"10.1109\/ACCESS.2021.3097254","volume":"9","author":"B Paeng","year":"2021","unstructured":"Paeng B, Park I-B, Park J (2021) Deep reinforcement learning for minimizing tardiness in parallel machine scheduling with sequence dependent family setups. IEEE Access 9:101390\u2013101401. https:\/\/doi.org\/10.1109\/ACCESS.2021.3097254","journal-title":"IEEE Access"},{"issue":"7","key":"4845_CR35","doi-asserted-by":"publisher","first-page":"3033","DOI":"10.1287\/mnsc.2017.2763","volume":"64","author":"PB Goes","year":"2018","unstructured":"Goes PB, Ilk N, Lin M, Zhao JL (2018) When more is less\u202f: Field evidence on unintended consequences of multitasking. Manag Sci 64(7):3033\u20133054. https:\/\/doi.org\/10.1287\/mnsc.2017.2763","journal-title":"Manag Sci"},{"key":"4845_CR36","doi-asserted-by":"publisher","unstructured":"Li X, Wang L, Jiang Q (2022) Multipopulation-based multi-tasking evolutionary algorithm. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-022-03626-w","DOI":"10.1007\/s10489-022-03626-w"},{"key":"4845_CR37","doi-asserted-by":"publisher","unstructured":"Xu S, Hall NG (2021) Fatigue, personnel scheduling and operations: Review and research opportunities. Eur J Oper Res 295(3):807\u2013822. https:\/\/doi.org\/10.1016\/j.ejor.2021.03.036","DOI":"10.1016\/j.ejor.2021.03.036"},{"key":"4845_CR38","doi-asserted-by":"publisher","unstructured":"Liu M, Wang S, Zheng F, Chu C (2017) Algorithms for the joint multitasking scheduling and common due year assignment problem. Int J Prod Res 55(20):6052\u20136066. https:\/\/doi.org\/10.1080\/00207543.2017.1321804","DOI":"10.1080\/00207543.2017.1321804"},{"issue":"12","key":"4845_CR39","doi-asserted-by":"publisher","first-page":"3633","DOI":"10.1080\/00207543.2020.1748908","volume":"59","author":"D Wang","year":"2021","unstructured":"Wang D, Yu Y, Yin Y, Cheng TCE (2021) Multi-agent scheduling problems under multitasking. Int J Prod Res 59(12):3633\u20133663. https:\/\/doi.org\/10.1080\/00207543.2020.1748908","journal-title":"Int J Prod Res"},{"key":"4845_CR40","doi-asserted-by":"publisher","unstructured":"Wu C, Azzouz A, Chen J, Xu J, Shen W, Lu L, Ben Said L, Lin W (2021) A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics. Complex & Intelligent Systems. https:\/\/doi.org\/10.1007\/s40747-021-00355-4","DOI":"10.1007\/s40747-021-00355-4"},{"key":"4845_CR41","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Math 5:287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","journal-title":"Annals Discrete Math"},{"issue":"3","key":"4845_CR42","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.1070.0246","volume":"20","author":"M Dell\u2019Amico","year":"2008","unstructured":"Dell\u2019Amico M, Iori M, Martello S, Monaci M (2008) Heuristic and exact algorithms for the identical parallel machine scheduling problem. INFORMS J Comput 20(3):333\u2013344. https:\/\/doi.org\/10.1287\/ijoc.1070.0246","journal-title":"INFORMS J Comput"},{"issue":"1","key":"4845_CR43","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"AAB Pritsker","year":"1969","unstructured":"Pritsker AAB, Waiters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: A zero-one programming approach. Manag Sci 16(1):93\u2013108. https:\/\/doi.org\/10.1287\/mnsc.16.1.93","journal-title":"Manag Sci"},{"key":"4845_CR44","doi-asserted-by":"publisher","unstructured":"Gao J, Zhu X, Zhang R (2022) Optimization of parallel test task scheduling with constraint satisfaction. The Journal of Supercomputing. https:\/\/doi.org\/10.1007\/s11227-022-04943-0","DOI":"10.1007\/s11227-022-04943-0"},{"issue":"3","key":"4845_CR45","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s10589-015-9822-9","volume":"64","author":"HH Kramer","year":"2016","unstructured":"Kramer HH, Uchoa E, Fampa M, K\u00f6hler V, Vanderbeck F (2016) Column generation approaches for the software clustering problem. Comput Optim Appl 64(3):843\u2013864. https:\/\/doi.org\/10.1007\/s10589-015-9822-9","journal-title":"Comput Optim Appl"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04845-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04845-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04845-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T23:10:47Z","timestamp":1698275447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04845-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":45,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["4845"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04845-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"25 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}