{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T09:16:08Z","timestamp":1778836568991,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T00:00:00Z","timestamp":1592524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T00:00:00Z","timestamp":1592524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s12652-020-02162-0","type":"journal-article","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T10:02:55Z","timestamp":1592560975000},"page":"1179-1196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Resolution for bounded-splitting jobs scheduling problem on a single machine in available time-windows"],"prefix":"10.1007","volume":"12","author":[{"given":"Trang Hong","family":"Son","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8925-5549","authenticated-orcid":false,"given":"Tran","family":"Van Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen","family":"Huynh-Tuong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameur","family":"Soukhal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,19]]},"reference":[{"key":"2162_CR1","first-page":"41","volume-title":"Getting things done, the art of stress-free productivity","author":"D Allen","year":"2003","unstructured":"Allen D (2003) Getting things done, the art of stress-free productivity. Penguin Books, London, p 41"},{"key":"2162_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10951-008-0092-6","volume":"13","author":"P Baptiste","year":"2010","unstructured":"Baptiste P, Croce FD, Grosso A, Tkindt V (2010) Sequencing a single machine with due dates and deadlines: an ilp-based approach to solve very large instances. J Sched 13:39\u201347. https:\/\/doi.org\/10.1007\/s10951-008-0092-6","journal-title":"J Sched"},{"issue":"3","key":"2162_CR3","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.ejor.2017.05.008","volume":"263","author":"N Brahimi","year":"2017","unstructured":"Brahimi N, Absi N, Dauzre-Prs S, Nordli A (2017) Single-item dynamic lot-sizing problems: an updated survey. Eur J Oper Res 263(3):838\u2013863. https:\/\/doi.org\/10.1016\/j.ejor.2017.05.008","journal-title":"Eur J Oper Res"},{"key":"2162_CR4","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms. Springer, Berlin"},{"key":"2162_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.cie.2017.10.017","volume":"114","author":"S Ceschia","year":"2017","unstructured":"Ceschia S, Gaspero LD, Schaerf A (2017) Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming. Comput Ind Eng 114:235\u2013243. https:\/\/doi.org\/10.1016\/j.cie.2017.10.017","journal-title":"Comput Ind Eng"},{"key":"2162_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G Dosa","year":"2013","unstructured":"Dosa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for first fit decreasing bin-packing: Ffd(l) $$\\le$$ 11\/9 opt(l) + 6\/9. Theor Comput Sci 510:13\u201361. https:\/\/doi.org\/10.1016\/j.tcs.2013.09.007","journal-title":"Theor Comput Sci"},{"issue":"45","key":"2162_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2010.09.017","volume":"412","author":"B Fan","year":"2011","unstructured":"Fan B, Li S, Zhou L, Zhang L (2011) Scheduling resumable deteriorating jobs on a single machine with non-availability constraints. Theor Comput Sci 412(45):275\u2013280. https:\/\/doi.org\/10.1016\/j.tcs.2010.09.017","journal-title":"Theor Comput Sci"},{"key":"2162_CR8","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s12652-018-0903-3","volume":"10","author":"B Fan","year":"2019","unstructured":"Fan B, Yang W, Zhang Z (2019) Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm. J Ambient Intell Humaniz Comput 10:979\u2013990. https:\/\/doi.org\/10.1007\/s12652-018-0903-3","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"2162_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B Fleischmann","year":"1997","unstructured":"Fleischmann B, Meyr H (1997) The general lot-sizing and scheduling problem. Oper Res Spektrum 19:11\u201321. https:\/\/doi.org\/10.1007\/BF01539800","journal-title":"Oper Res Spektrum"},{"key":"2162_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404. https:\/\/doi.org\/10.4153\/CJM-1956-045-5","journal-title":"Can J Math"},{"issue":"1","key":"2162_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ejor.2008.12.014","volume":"200","author":"S Gawiejnowicz","year":"2010","unstructured":"Gawiejnowicz S, Kononov A (2010) Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur J Oper Res 200(1):305\u2013308. https:\/\/doi.org\/10.1016\/j.ejor.2008.12.014","journal-title":"Eur J Oper Res"},{"key":"2162_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham R, Lawler E, Lenstra J, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","journal-title":"Ann Discrete Math"},{"issue":"12","key":"2162_CR13","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1287\/mnsc.40.12.1712","volume":"40","author":"AMA Hariri","year":"1994","unstructured":"Hariri AMA, Potts CN (1994) Single machine scheduling with deadlines to minimize the weighted number of tardy jobs. Manag Sci 40(12):1579\u20131763. https:\/\/doi.org\/10.1287\/mnsc.40.12.1712","journal-title":"Manag Sci"},{"issue":"4","key":"2162_CR14","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.cie.2010.08.005","volume":"59","author":"M Ji","year":"2010","unstructured":"Ji M, Cheng T (2010) Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan. Comput Ind Eng 59(4):794\u2013798. https:\/\/doi.org\/10.1016\/j.cie.2010.08.005","journal-title":"Comput Ind Eng"},{"key":"2162_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12652-016-0425-9","volume":"9","author":"X Liang","year":"2018","unstructured":"Liang X, Huang M, Ning T (2018) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Humaniz Comput 9:165\u2013171. https:\/\/doi.org\/10.1007\/s12652-016-0425-9","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"12","key":"2162_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R Linn","year":"1999","unstructured":"Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37(12):57\u201361. https:\/\/doi.org\/10.1016\/S0360-8352(99)00023-6","journal-title":"Comput Ind Eng"},{"key":"2162_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.cor.2017.02.011","volume":"90","author":"C Liu","year":"2018","unstructured":"Liu C, Wang C, Zhang Z-H, Zheng L (2018) Scheduling with job-splitting considering learning and the vital-few law. Comput Oper Res 90:264\u2013274. https:\/\/doi.org\/10.1016\/j.cor.2017.02.011","journal-title":"Comput Oper Res"},{"key":"2162_CR18","doi-asserted-by":"publisher","first-page":"105954","DOI":"10.1016\/j.asoc.2019.105954","volume":"87","author":"M Liu","year":"2020","unstructured":"Liu M, Yao X, Li Y (2020) Hybrid whale optimization algorithm enhanced with lvy flight and differential evolution for job shop scheduling problems. Appl Soft Comput 87:105954. https:\/\/doi.org\/10.1016\/j.asoc.2019.105954","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2162_CR19","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.apm.2009.04.014","volume":"34","author":"C Low","year":"2010","unstructured":"Low C, Ji M, Hsu C-J, Su C-T (2010) Minimizing the makespan in a single machine scheduling problems with exible and periodic maintenance. Appl Math Model 34(2):334\u2013342. https:\/\/doi.org\/10.1016\/j.apm.2009.04.014","journal-title":"Appl Math Model"},{"key":"2162_CR20","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.procs.2020.02.061","volume":"166","author":"X Luo","year":"2020","unstructured":"Luo X, Qian Q, Fu YF (2020) Improved genetic algorithm for solving exible job shop scheduling problem. Proc Comput Sci 166:480\u2013485. https:\/\/doi.org\/10.1016\/j.procs.2020.02.061","journal-title":"Proc Comput Sci"},{"issue":"2","key":"2162_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma Y, Chu C, Zuo C (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58(2):199\u2013211. https:\/\/doi.org\/10.1016\/j.cie.2009.04.014","journal-title":"Comput Ind Eng"},{"issue":"2","key":"2162_CR22","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2020.02.010","volume":"285","author":"G Mejia","year":"2020","unstructured":"Mejia G, Yuraszeck F (2020) A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel\/setup times. Eur J Oper Res 285(2):484\u2013496. https:\/\/doi.org\/10.1016\/j.ejor.2020.02.010","journal-title":"Eur J Oper Res"},{"key":"2162_CR23","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.procs.2016.09.324","volume":"95","author":"V Nguyen","year":"2016","unstructured":"Nguyen V, Bao H (2016) An efficient solution to the mixed shop scheduling problem using a modified genetic algorithm. Proc Comput Sci 95:475\u2013482. https:\/\/doi.org\/10.1016\/j.procs.2016.09.324","journal-title":"Proc Comput Sci"},{"issue":"12","key":"2162_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21553\/rev-jec.51","volume":"3","author":"VH Nguyen","year":"2013","unstructured":"Nguyen VH, Tuong NH, Nguyen HP, Nguyen TH (2013) Single-machine scheduling with splitable jobs and availability constraints. REV J Electron Commun 3(12):21\u201327. https:\/\/doi.org\/10.21553\/rev-jec.51","journal-title":"REV J Electron Commun"},{"key":"2162_CR25","doi-asserted-by":"publisher","unstructured":"Nguyen VH, Tuong NH, Tran VH, Thoai N (2013) An milp-based makespan minimization model for single-machine scheduling problem with splitable jobs and availability constraints. In: 2013 international conference on computing, management and telecommunications (commantel). IEEE, Ho Chi Minh City, pp 397\u2013400. https:\/\/doi.org\/10.1109\/ComManTel.2013.6482427","DOI":"10.1109\/ComManTel.2013.6482427"},{"issue":"3","key":"2162_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.35940\/ijeat.B3430.029320","volume":"9","author":"P Nikhil","year":"2020","unstructured":"Nikhil P, Phanindra KN, Chalapathi P, Ikram M, Akhil B (2020) Flexible job shop scheduling using software. Int J Eng Adv Technol 9(3):67\u201370. https:\/\/doi.org\/10.35940\/ijeat.B3430.029320","journal-title":"Int J Eng Adv Technol"},{"key":"2162_CR27","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s12652-016-0370-7","volume":"7","author":"T Ning","year":"2016","unstructured":"Ning T, Huang M, Liang X, Jin H (2016) A novel dynamic scheduling strategy for solving exible job-shop problems. J Ambient Intell Humaniz Comput 7:721\u2013729. https:\/\/doi.org\/10.1007\/s12652-016-0370-7","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"2162_CR28","doi-asserted-by":"publisher","first-page":"442449","DOI":"10.1016\/j.promfg.2020.02.051","volume":"42","author":"B Rolf","year":"2020","unstructured":"Rolf B, Reggelin T, Nahhas A, Lang S, Mller M (2020) Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem. Proc Manuf 42:442449. https:\/\/doi.org\/10.1016\/j.promfg.2020.02.051","journal-title":"Proc Manuf"},{"issue":"1","key":"2162_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, Vazquez-Rodriguez JA (2010) The hybrid ow shop scheduling problem. Eur J Oper Res 205(1):1\u201318. https:\/\/doi.org\/10.1016\/j.ejor.2009.09.024","journal-title":"Eur J Oper Res"},{"key":"2162_CR30","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s002360050143","volume":"35","author":"E Sanlaville","year":"1998","unstructured":"Sanlaville E, Schmidt G (1998) Machine scheduling with availability constraints. Acta Inform 35:795\u2013811. https:\/\/doi.org\/10.1007\/s002360050143","journal-title":"Acta Inform"},{"issue":"15","key":"2162_CR31","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","volume":"50","author":"V Sels","year":"2012","unstructured":"Sels V, Gheysen N, Vanhoucke M (2012) A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. Int J Prod Res 50(15):4255\u20134270. https:\/\/doi.org\/10.1080\/00207543.2011.611539","journal-title":"Int J Prod Res"},{"issue":"4","key":"2162_CR32","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P Serafini","year":"1996","unstructured":"Serafini P (1996) Scheduling jobs on several machines with job splitting property. Oper Res 44(4):531\u2013659. https:\/\/doi.org\/10.1287\/opre.44.4.617","journal-title":"Oper Res"},{"issue":"2","key":"2162_CR33","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0377-2217(99)00161-7","volume":"120","author":"NV Shakhlevich","year":"2000","unstructured":"Shakhlevich NV, Sotskov YN, Werner F (2000) Complexity of mixed shop scheduling problems: a survey. Eur J Oper Res 120(2):343\u2013351. https:\/\/doi.org\/10.1016\/S0377-2217(99)00161-7","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2162_CR34","doi-asserted-by":"publisher","first-page":"97","DOI":"10.15625\/1813-9663\/34\/2\/12667","volume":"34","author":"TH Son","year":"2018","unstructured":"Son TH, Lang TV, Huynh-Tuong N (2018) Minimizing makespan of personal scheduling problem in available time-windows with split-min and setup-time constraints. J Comput Sci Cybern 34(2):97\u2013111. https:\/\/doi.org\/10.15625\/1813-9663\/34\/2\/12667","journal-title":"J Comput Sci Cybern"},{"issue":"5","key":"2162_CR35","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.orl.2005.06.005","volume":"34","author":"F Sourd","year":"2006","unstructured":"Sourd F (2006) Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. Oper Res Lett 34(5):591\u2013598. https:\/\/doi.org\/10.1016\/j.orl.2005.06.005","journal-title":"Oper Res Lett"},{"key":"2162_CR36","doi-asserted-by":"crossref","unstructured":"Swamidass PM (2000) Encyclopedia of produc tion and manufacturing management. Springer US, pp 527\u2013528","DOI":"10.1007\/1-4020-0612-8"},{"key":"2162_CR37","doi-asserted-by":"publisher","unstructured":"Ta QC, Billaut J-C, Bouquard J-L (2015) Heuristic algorithms to minimize the total tardiness in a ow shop production and outbound distribution scheduling problem. In: 2015 international conference on industrial engineering and systems management (iesm). IEEE, Seville, pp 128\u2013134. https:\/\/doi.org\/10.1109\/IESM.2015.7380147","DOI":"10.1109\/IESM.2015.7380147"},{"issue":"12","key":"2162_CR38","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ijpe.2004.12.007","volume":"99","author":"DN Tahar","year":"2006","unstructured":"Tahar DN, Yalaoui F, Chu C, Amodeo L (2006) A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. Int J Prod Econ 99(12):63\u201373. https:\/\/doi.org\/10.1016\/j.ijpe.2004.12.007","journal-title":"Int J Prod Econ"},{"key":"2162_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.08.008","volume":"125","author":"K Tamssaouet","year":"2018","unstructured":"Tamssaouet K, Dauzre-Prs S, Yugma C (2018) Metaheuristics for the job-shop scheduling problem with machine availability constraints. Comput Ind Eng 125:1\u20138. https:\/\/doi.org\/10.1016\/j.cie.2018.08.008","journal-title":"Comput Ind Eng"},{"key":"2162_CR40","unstructured":"Tran DQ, Huynh-Tuong N, Ngoc GLH, Mai TL, Tran TL, Mai QT, Quan TT (2010) A personal scheduling system using genetic algorithm and simple natural language processing for usability. In: The 4th Mahasarakham international workshop on artificial intelligence (miwai\u2019 2010). Mahasarakham University, Mahasarakham, pp 23\u201333"},{"issue":"5","key":"2162_CR41","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1016\/j.cor.2012.12.007","volume":"40","author":"W-L Wang","year":"2013","unstructured":"Wang W-L, Wang H-Y, Zhao Y-W, Zhang L-P, Xu X-L (2013) Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm. Comput Oper Res 40(5):1196\u20131206. https:\/\/doi.org\/10.1016\/j.cor.2012.12.007","journal-title":"Comput Oper Res"},{"key":"2162_CR42","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.cie.2016.05.001","volume":"97","author":"C Wang","year":"2016","unstructured":"Wang C, Liu C, Hai Zhang Z, Zheng L (2016) Minimizing the total completion time for parallel machine scheduling with job splitting and learning. Comput Ind Eng 97:170\u2013182. https:\/\/doi.org\/10.1016\/j.cie.2016.05.001","journal-title":"Comput Ind Eng"},{"key":"2162_CR43","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.procs.2018.10.157","volume":"141","author":"S-J Wang","year":"2018","unstructured":"Wang S-J, Tsai C-W, Chiang M-C (2018) A high performance search algorithm for job-shop scheduling problem. Proc Comput Sci 141:119\u2013126. https:\/\/doi.org\/10.1016\/j.procs.2018.10.157","journal-title":"Proc Comput Sci"},{"issue":"13","key":"2162_CR44","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W Xing","year":"2000","unstructured":"Xing W, Zhang J (2000) Parallel machine scheduling with spliting jobs. Discrete Appl Math 103(13):259\u2013269. https:\/\/doi.org\/10.1016\/S0166-218X(00)00176-1","journal-title":"Discrete Appl Math"},{"key":"2162_CR45","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.procir.2019.04.119","volume":"83","author":"Z Zhuang","year":"2019","unstructured":"Zhuang Z, Huang Z, Lu Z, Guo L, Cao Q, Qin W (2019) An improved artificial bee colony algorithm for solving open shop scheduling problem with two sequence-dependent setup times. Proc CIRP 83:563\u2013568. https:\/\/doi.org\/10.1016\/j.procir.2019.04.119","journal-title":"Proc CIRP"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02162-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-020-02162-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02162-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T23:42:47Z","timestamp":1624059767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-020-02162-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,19]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2162"],"URL":"https:\/\/doi.org\/10.1007\/s12652-020-02162-0","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,19]]},"assertion":[{"value":"21 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}