{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:20:06Z","timestamp":1778739606597,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T00:00:00Z","timestamp":1713744000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T00:00:00Z","timestamp":1713744000000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s40314-024-02717-3","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T16:02:31Z","timestamp":1713801751000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times"],"prefix":"10.1007","volume":"43","author":[{"given":"Xiao-Yuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan-Yang","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Na","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,22]]},"reference":[{"issue":"4","key":"2717_CR1","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz A, Ennigrou M, Said LB (2018) Scheduling problems under learning effects: classification and cartography. Int J Prod Res 56(4):1642\u20131661","journal-title":"Int J Prod Res"},{"key":"2717_CR2","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms, 2nd edn. Springer, Heidelberg","edition":"2"},{"key":"2717_CR3","doi-asserted-by":"crossref","first-page":"102786","DOI":"10.1016\/j.omega.2022.102786","volume":"115","author":"P Heuser","year":"2023","unstructured":"Heuser P, Tauer B (2023) Single-machine scheduling with product category-based learning and forgetting effects. Omega 115:102786","journal-title":"Omega"},{"key":"2717_CR4","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.ijpe.2010.03.016","volume":"126","author":"C Koulamas","year":"2010","unstructured":"Koulamas C, Kyparisis GJ (2010) Single-machine scheduling problems with past-sequence-dependent delivery times. Int J Prod Econ 126:264\u2013266","journal-title":"Int J Prod Econ"},{"key":"2717_CR5","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2023.2244529","author":"S Kovalev","year":"2023","unstructured":"Kovalev S, Chalamon I, B\u00e9cuwe A (2023) Single machine scheduling with resource constraints: equivalence to two-machine flow-shop scheduling for regular objectives. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2023.2244529","journal-title":"J Oper Res Soc"},{"key":"2717_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595923500148","author":"W Lei","year":"2023","unstructured":"Lei W, Sun L, Ren N, Jia X, Wang J-B (2023) Research on delivery times scheduling with sum of logarithm processing times-based learning effect. Asia-Pac J Oper Res. https:\/\/doi.org\/10.1142\/S0217595923500148","journal-title":"Asia-Pac J Oper Res"},{"key":"2717_CR7","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.3390\/pr11041271","volume":"11","author":"WG Liu","year":"2023","unstructured":"Liu WG, Wang X (2023) Group technology scheduling with due-date assignment and controllable processing times. Processes 11:1271","journal-title":"Processes"},{"key":"2717_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.tcs.2012.03.009","volume":"438","author":"M Liu","year":"2012","unstructured":"Liu M, Zheng F, Chu C, Xu Y (2012) New results on single-machine scheduling with past-sequence-dependent delivery times. Theoret Comput Sci 438:55\u201361","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"2717_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3934\/jimo.2023079","volume":"20","author":"WG Liu","year":"2024","unstructured":"Liu WG, Wang X, Li L, Dai W (2024) Due-window assignment scheduling with job-rejection, truncated learning effects and setup times. J Ind Manag Optim 20(1):313\u2013324","journal-title":"J Ind Manag Optim"},{"key":"2717_CR10","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595924500039","author":"D-Y Lv","year":"2024","unstructured":"Lv D-Y, Wang J-B (2024) No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia-Pac J Oper Res. https:\/\/doi.org\/10.1142\/S0217595924500039","journal-title":"Asia-Pac J Oper Res"},{"key":"2717_CR11","doi-asserted-by":"crossref","first-page":"610","DOI":"10.3390\/math12040610","volume":"12","author":"Z-G Lv","year":"2024","unstructured":"Lv Z-G, Zhang L-H, Wang X-Y, Wang J-B (2024) Single machine scheduling proportionally deteriorating jobs with ready times subject to the total weighted completion time minimization. Mathematics 12:610","journal-title":"Mathematics"},{"key":"2717_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2022.06.006","volume":"928","author":"R Ma","year":"2023","unstructured":"Ma R, Guo SA, Zhang XY (2023) An optimal online algorithm for single-processor scheduling problem with learning effect. Theoret Comput Sci 928:1\u201312","journal-title":"Theoret Comput Sci"},{"key":"2717_CR13","doi-asserted-by":"crossref","first-page":"105999","DOI":"10.1016\/j.cor.2022.105999","volume":"149","author":"S Maecker","year":"2023","unstructured":"Maecker S, Shen LJ, M\u00f6nch L (2023) Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Comput Oper Res 149:105999","journal-title":"Comput Oper Res"},{"key":"2717_CR14","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.3390\/math11183983","volume":"11","author":"R-R Mao","year":"2023","unstructured":"Mao R-R, Wang Y-C, Lv D-Y, Wang J-B, Lu Y-Y (2023) Delivery times scheduling with deterioration effects in due window assignment environments. Mathematics 11:3983","journal-title":"Mathematics"},{"issue":"8","key":"2717_CR15","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1080\/01605682.2019.1621222","volume":"71","author":"B Mor","year":"2020","unstructured":"Mor B, Shapira D (2020) Scheduling with regular performance measures and optional job rejection on a single machine. J Oper Res Soc 71(8):1315\u20131325","journal-title":"J Oper Res Soc"},{"key":"2717_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore JEE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91\u201395","journal-title":"Omega"},{"key":"2717_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/s10878-023-01025-6","volume":"45","author":"L Pan","year":"2023","unstructured":"Pan L, Sun X, Wang J-B, Zhang L-H, Lv D-Y (2023) Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs. J Comb Optim 45:100","journal-title":"J Comb Optim"},{"key":"2717_CR18","doi-asserted-by":"publisher","DOI":"10.1142\/10.1080\/00207543.2023.2204967","author":"YA Paredes-Astudillo","year":"2023","unstructured":"Paredes-Astudillo YA, Botta-Genoulaz V, Montoya-Torrers JR (2023) Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm. Int J Prod Res. https:\/\/doi.org\/10.1142\/10.1080\/00207543.2023.2204967","journal-title":"Int J Prod Res"},{"key":"2717_CR19","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1080\/00207543.2022.2049911","volume":"61","author":"J Pei","year":"2023","unstructured":"Pei J, Zhou Y, Yan P, Pardalos PM (2023) A concise guide to scheduling with learning and deteriorating effects. Int J Prod Res 61:2010\u20132031","journal-title":"Int J Prod Res"},{"key":"2717_CR20","volume-title":"Scheduling theory, algorithms, and systems","author":"ML Pinedo","year":"2015","unstructured":"Pinedo ML (2015) Scheduling theory, algorithms, and systems, 5th edn. Springer, Heidelberg","edition":"5"},{"key":"2717_CR21","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1007\/s12190-021-01607-9","volume":"68","author":"J Qian","year":"2022","unstructured":"Qian J, Han H (2022) The due date assignment scheduling problem with the deteriorating jobs and delivery time. J Appl Math Comput 68:2173\u20132186","journal-title":"J Appl Math Comput"},{"key":"2717_CR22","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.3390\/math10101672","volume":"10","author":"J Qian","year":"2022","unstructured":"Qian J, Zhan Y (2022) The due window assignment problems with deteriorating job and delivery time. Mathematics 10:1672","journal-title":"Mathematics"},{"key":"2717_CR23","doi-asserted-by":"crossref","first-page":"8429","DOI":"10.3934\/jimo.2023045","volume":"19","author":"N Ren","year":"2023","unstructured":"Ren N, Lv D-Y, Wang J-B, Wang X-Y (2023) Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times. J Ind Manag Optim 19:8429\u20138450","journal-title":"J Ind Manag Optim"},{"key":"2717_CR24","doi-asserted-by":"crossref","first-page":"5444","DOI":"10.1016\/j.apm.2012.11.001","volume":"37","author":"L-X Shen","year":"2013","unstructured":"Shen L-X, Wu Y-B (2013) Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects. Appl Math Model 37:5444\u20135451","journal-title":"Appl Math Model"},{"key":"2717_CR25","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1057\/jors.2010.26","volume":"62","author":"L-H Sun","year":"2011","unstructured":"Sun L-H, Sun L-Y, Wang J-B (2011) Single-machine scheduling to minimize total absolute differences in waiting times under simple linear deterioration. J Oper Res Soc 62:768\u2013775","journal-title":"J Oper Res Soc"},{"issue":"12","key":"2717_CR26","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"X Sun","year":"2021","unstructured":"Sun X, Geng X-N, Liu F (2021) Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. J Oper Res Soc 72(12):2674\u20132689","journal-title":"J Oper Res Soc"},{"key":"2717_CR27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10951-022-00756-4","volume":"26","author":"X Sun","year":"2023","unstructured":"Sun X, Liu T, Geng X-N, Hu Y, Xu J-X (2023) Optimization of scheduling problems with deterioration effects and an optional maintenance activity. J Sched 26:251\u2013266","journal-title":"J Sched"},{"key":"2717_CR28","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.3934\/jimo.2021044","volume":"18","author":"MD Toksari","year":"2022","unstructured":"Toksari MD, Aydogan EK, Atalay B, Sari S (2022) Some scheduling problems with sun of logarithm processing times based learning effect and exponential past sequence dependent delivery times. J Ind Manag Optim 18:1795\u20131807","journal-title":"J Ind Manag Optim"},{"key":"2717_CR29","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1057\/jors.2011.40","volume":"63","author":"J-B Wang","year":"2012","unstructured":"Wang J-B, Wang M-Z (2012) Worst-case analysis for flow shop scheduling problems with an exponential learning effect. J Oper Res Soc 63:130\u2013137","journal-title":"J Oper Res Soc"},{"key":"2717_CR30","doi-asserted-by":"crossref","first-page":"3179","DOI":"10.3390\/math11143179","volume":"11","author":"Y-C Wang","year":"2023","unstructured":"Wang Y-C, Wang J-B (2023) Study on convex resource allocation scheduling with a time-dependent learning effect. Mathematics 11:3179","journal-title":"Mathematics"},{"key":"2717_CR31","doi-asserted-by":"crossref","first-page":"1898","DOI":"10.1057\/jors.2010.143","volume":"62","author":"J-J Wang","year":"2011","unstructured":"Wang J-J, Wang J-B, Liu F (2011) Parallel machines scheduling with a deteriorating maintenance activity. J Oper Res Soc 62:1898\u20131902","journal-title":"J Oper Res Soc"},{"key":"2717_CR32","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1057\/jors.2010.120","volume":"62","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, Wang J-J, Ji P (2011) Scheduling jobs with chain precedence constraints and deteriorating jobs. J Oper Res Soc 62:1765\u20131770","journal-title":"J Oper Res Soc"},{"issue":"3","key":"2717_CR33","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1111\/itor.12323","volume":"26","author":"J-B Wang","year":"2019","unstructured":"Wang J-B, Liu F, Wang J-J (2019) Research on m-machine flow shop scheduling with truncated learning effects. Int Trans Oper Res 26(3):1135\u20131151","journal-title":"Int Trans Oper Res"},{"key":"2717_CR34","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/s10878-020-00676-z","volume":"41","author":"J-B Wang","year":"2021","unstructured":"Wang J-B, Cui B, Ji P, Liu W-W (2021) Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times. J Comb Optim 41:290\u2013303","journal-title":"J Comb Optim"},{"issue":"6","key":"2717_CR35","doi-asserted-by":"crossref","first-page":"5957","DOI":"10.3934\/mbe.2022278","volume":"19","author":"X Wang","year":"2022","unstructured":"Wang X, Liu WG, Li L, Zhao P, Zhang R (2022) Resource dependent scheduling with truncated learning effects. Math Biosci Eng 19(6):5957\u20135967","journal-title":"Math Biosci Eng"},{"issue":"8","key":"2717_CR36","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s40314-022-02133-5","volume":"41","author":"J-B Wang","year":"2022","unstructured":"Wang J-B, Zhang L-H, Lv Z-G, Lv D-Y, Geng X-N, Sun X (2022) Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects. Comput Appl Math 41(8):417","journal-title":"Comput Appl Math"},{"key":"2717_CR37","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.3934\/jimo.2022066","volume":"19","author":"S-H Wang","year":"2023","unstructured":"Wang S-H, Lv D-Y, Wang J-B (2023) Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect. J Ind Manag Optim 19:2824\u20132837","journal-title":"J Ind Manag Optim"},{"key":"2717_CR38","doi-asserted-by":"publisher","first-page":"2350039","DOI":"10.1142\/10.1142\/S0217595923500392","volume":"41","author":"J-B Wang","year":"2024","unstructured":"Wang J-B, Bao H, Wang C (2024) Research on multiple slack due-date assignments scheduling with position-dependent weights. Asia-Pac J Oper Res 41:2350039. https:\/\/doi.org\/10.1142\/10.1142\/S0217595923500392","journal-title":"Asia-Pac J Oper Res"},{"key":"2717_CR39","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2024.2314251","author":"D Wang","year":"2024","unstructured":"Wang D, Fang K, Luo W, Ouyang W (2024) Approximation algorithms for mixed batch scheduling on parallel machines. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2024.2314251","journal-title":"J Oper Res Soc"},{"key":"2717_CR40","doi-asserted-by":"publisher","first-page":"2350026","DOI":"10.1142\/S0217595923500264","volume":"41","author":"J-B Wang","year":"2024","unstructured":"Wang J-B, Wang Y-C, Wan C, Lv D-Y, Zhang L (2024) Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia-Pac J Oper Res 41:2350026. https:\/\/doi.org\/10.1142\/S0217595923500264","journal-title":"Asia-Pac J Oper Res"},{"key":"2717_CR41","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1007\/s00521-015-1910-3","volume":"27","author":"Y-B Wu","year":"2016","unstructured":"Wu Y-B, Wang J-J (2016) Single-machine scheduling with truncated sum-of-processing-times based learning effect including proportional delivery times. Neural Comput Appl 27:937\u2013943","journal-title":"Neural Comput Appl"},{"key":"2717_CR42","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1504\/EJIE.2012.047665","volume":"6","author":"C-C Wu","year":"2012","unstructured":"Wu C-C, Yin Y, Wu W-H, Cheng S-R (2012) Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect. Eur J Ind Eng 6:441\u2013453","journal-title":"Eur J Ind Eng"},{"key":"2717_CR43","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1057\/jors.2012.46","volume":"64","author":"C-C Wu","year":"2013","unstructured":"Wu C-C, Yin Y, Cheng S-R (2013) Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J Oper Res Soc 64:147\u2013156","journal-title":"J Oper Res Soc"},{"key":"2717_CR44","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1080\/00207543.2021.2008041","volume":"61","author":"X Xin","year":"2023","unstructured":"Xin X, Jiang Q, Li C, Li S, Chen K (2023) Permutation flow shop energy-efficient scheduling with position-based learning effect. Int J Prod Res 61:382\u2013409","journal-title":"Int J Prod Res"},{"key":"2717_CR45","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1057\/jors.2011.155","volume":"63","author":"S-J Yang","year":"2012","unstructured":"Yang S-J, Yang D-L (2012) Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times. J Oper Res Soc 63:1508\u20131515","journal-title":"J Oper Res Soc"},{"key":"2717_CR46","doi-asserted-by":"crossref","first-page":"105936","DOI":"10.1016\/j.cor.2022.105936","volume":"147","author":"C Zhang","year":"2022","unstructured":"Zhang C, Li Y, Cao J, Yang Z, Coelho LC (2022) Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date. Comput Oper Res 147:105936","journal-title":"Comput Oper Res"},{"key":"2717_CR47","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.3934\/jimo.2023136","volume":"20","author":"L-H Zhang","year":"2024","unstructured":"Zhang L-H, Geng X-N, Xue J, Wang J-B (2024) Single machine slack due window assignment and deteriorating jobs. J Ind Manag Optim 20:1593\u20131614","journal-title":"J Ind Manag Optim"},{"issue":"4","key":"2717_CR48","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","volume":"41","author":"S Zhao","year":"2022","unstructured":"Zhao S (2022) Scheduling jobs with general truncated learning effects including proportional setup times. Comput Appl Math 41(4):146","journal-title":"Comput Appl Math"},{"key":"2717_CR49","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s12190-013-0722-9","volume":"45","author":"C-L Zhao","year":"2014","unstructured":"Zhao C-L, Tang H-Y (2014) Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J Appl Math Comput 45:259\u2013274","journal-title":"J Appl Math Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02717-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02717-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02717-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T02:19:55Z","timestamp":1718072395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02717-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,22]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2717"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02717-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,22]]},"assertion":[{"value":"8 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2024","order":4,"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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"194"}}