{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:24:11Z","timestamp":1783160651514,"version":"3.54.6"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71171130"],"award-info":[{"award-number":["71171130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473211"],"award-info":[{"award-number":["61473211"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01542-x","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T15:02:46Z","timestamp":1581433366000},"page":"2161-2195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9546-506X","authenticated-orcid":false,"given":"Yifei","family":"Ren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9357-610X","authenticated-orcid":false,"given":"Zhiqiang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,11]]},"reference":[{"key":"1542_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.eswa.2016.03.017","volume":"57","author":"BF Almeida","year":"2016","unstructured":"Almeida, B.F., Correia, I., Saldanha-da-Gama, F.: Priority-based heuristics for the multi-skill resource constrained project scheduling problem. Expert Syst. Appl. 57, 91\u2013103 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"1542_CR2","doi-asserted-by":"crossref","first-page":"9637","DOI":"10.1016\/j.eswa.2008.10.007","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian, J., Zandieh, M., Ghomi, S.F.: Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Syst. Appl. 36(6), 9637\u20139644 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"1542_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1051\/ro:2007015","volume":"41","author":"O Bellenguez-Morineau","year":"2007","unstructured":"Bellenguez-Morineau, O., N\u00e9ron, E.: A branch-and-bound method for solving multi-skill project scheduling problem. RAIRO-Oper. Res. 41(2), 155\u2013170 (2007)","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"1542_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J.K., Kan, A.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1542_CR5","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., Thiele, O.: A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107(2), 272\u2013288 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1542_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.ejor.2005.04.030","volume":"175","author":"J Buddhakulsomsiri","year":"2006","unstructured":"Buddhakulsomsiri, J., Kim, D.S.: Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. Eur. J. Oper. Res. 175(1), 279\u2013295 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"1542_CR7","doi-asserted-by":"crossref","unstructured":"Cai, Z., Li, X.: A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time. In: 2012 IEEE International Conference on Automation Science and Engineering (CASE), pp. 569\u2013574. IEEE (2012)","DOI":"10.1109\/CoASE.2012.6386457"},{"issue":"1","key":"1542_CR8","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1016\/j.asoc.2010.03.003","volume":"11","author":"PC Chang","year":"2011","unstructured":"Chang, P.C., Chen, S.H.: Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl. Soft Comput. 11(1), 1263\u20131274 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"12","key":"1542_CR9","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E Demeulemeester","year":"1992","unstructured":"Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manag. Sci. 38(12), 1803\u20131818 (1992)","journal-title":"Manag. Sci."},{"issue":"1","key":"1542_CR10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0377-2217(97)00305-6","volume":"111","author":"B De Reyck","year":"1998","unstructured":"De Reyck, B., Herroelen, W.: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res. 111(1), 152\u2013174 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1542_CR11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s001860000091","volume":"52","author":"U Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., Phan-Huy, T.: A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math. Method Oper. Res. 52(3), 413\u2013439 (2000)","journal-title":"Math. Method Oper. Res."},{"issue":"1","key":"1542_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0377-2217(99)00205-2","volume":"125","author":"A Drexl","year":"2000","unstructured":"Drexl, A., Nissen, R., Patterson, J.H., Salewski, F.: ProGen\/\u03c0x\u2014an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. Eur. J. Oper. Res. 125(1), 59\u201372 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1542_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2009.12.014","volume":"205","author":"S Elloumi","year":"2010","unstructured":"Elloumi, S., Fortemps, P.: A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 205(1), 31\u201341 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1542_CR14","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11590-014-0761-7","volume":"9","author":"I Hamdi","year":"2015","unstructured":"Hamdi, I., Loukil, T.: Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. Optim. Lett. 9(3), 465\u2013482 (2015)","journal-title":"Optim. Lett."},{"issue":"1\u20134","key":"1542_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S Hartmann","year":"2001","unstructured":"Hartmann, S.: Project scheduling with multiple modes: a genetic algorithm. Ann. Oper. Res. 102(1\u20134), 111\u2013135 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1542_CR16","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.ejor.2006.07.053","volume":"189","author":"Z He","year":"2008","unstructured":"He, Z., Xu, Y.: Multi-mode project payment scheduling problems with bonus\u2013penalty structure. Eur. J. Oper. Res. 189(3), 1191\u20131207 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20134","key":"1542_CR17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J J\u00f3zefowska","year":"2001","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Simulated annealing for multi-mode resource-constrained project scheduling. Ann. Oper. Res. 102(1\u20134), 137\u2013155 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1542_CR18","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.ejor.2017.07.027","volume":"265","author":"RL Kadri","year":"2018","unstructured":"Kadri, R.L., Boctor, F.F.: An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case. Eur. J. Oper. Res. 265(2), 454\u2013462 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1542_CR19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.asoc.2014.06.020","volume":"23","author":"V Kaplano\u011flu","year":"2014","unstructured":"Kaplano\u011flu, V.: Multi-agent based approach for single machine scheduling with sequence-dependent setup times and machine maintenance. Appl. Soft Comput. 23, 165\u2013179 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"1542_CR20","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0377-2217(99)00347-1","volume":"127","author":"R Klein","year":"2000","unstructured":"Klein, R.: Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. Eur. J. Oper. Res. 127(3), 619\u2013638 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1542_CR21","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur. J. Oper. Res. 90(2), 320\u2013333 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1542_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB\u2014a project scheduling problem library: OR software\u2014ORSEP operations research software exchange program. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1542_CR23","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.ejor.2008.07.036","volume":"197","author":"D Kr\u00fcger","year":"2009","unstructured":"Kr\u00fcger, D., Scholl, A.: A heuristic solution framework for the resource constrained (multi-) project scheduling problem with sequence-dependent transfer times. Eur. J. Oper. Res. 197(2), 492\u2013508 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1542_CR24","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00291-008-0144-5","volume":"32","author":"D Kr\u00fcger","year":"2010","unstructured":"Kr\u00fcger, D., Scholl, A.: Managing and modelling general resource transfers in (multi-) project scheduling. OR Spectr. 32(2), 369\u2013394 (2010)","journal-title":"OR Spectr."},{"issue":"1","key":"1542_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s11590-012-0481-9","volume":"8","author":"WC Lee","year":"2014","unstructured":"Lee, W.C.: Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning. Optim. Lett. 8(1), 135\u2013144 (2014)","journal-title":"Optim. Lett."},{"key":"1542_CR26","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.autcon.2013.05.030","volume":"35","author":"H Li","year":"2013","unstructured":"Li, H., Zhang, H.: Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints. Autom. Constr. 35, 431\u2013438 (2013)","journal-title":"Autom. Constr."},{"key":"1542_CR27","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","volume":"170","author":"CD Liou","year":"2015","unstructured":"Liou, C.D., Hsieh, Y.C.: A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. Int. J. Prod. Econ. 170, 258\u2013267 (2015)","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"1542_CR28","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.ijpe.2008.11.002","volume":"117","author":"A Lova","year":"2009","unstructured":"Lova, A., Tormos, P., Cervantes, M., Barber, F.: An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int. J. Prod. Econ. 117(2), 302\u2013316 (2009)","journal-title":"Int. J. Prod. Econ."},{"key":"1542_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-018-1322-2","author":"S Lu","year":"2018","unstructured":"Lu, S., Liu, X., Pei, J., Pardalos, P.M.: Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines. Optim. Lett. (2018). https:\/\/doi.org\/10.1007\/s11590-018-1322-2","journal-title":"Optim. Lett."},{"key":"1542_CR30","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.cie.2019.06.044","volume":"135","author":"ZQ Lu","year":"2019","unstructured":"Lu, Z.Q., Ren, Y.F., Wang, L., Zhu, H.W.: A resource investment problem based on project splitting with time windows for aircraft moving assembly line. Comput. Ind. Eng. 135, 568\u2013581 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"1542_CR31","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag. Sci. 44(5), 714\u2013729 (1998)","journal-title":"Manag. Sci."},{"issue":"3","key":"1542_CR32","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1016\/j.ejor.2006.06.069","volume":"187","author":"M Mika","year":"2008","unstructured":"Mika, M., Waligora, G., W\u0119glarz, J.: Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. Eur. J. Oper. Res. 187(3), 1238\u20131250 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"1542_CR33","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1007\/s11590-013-0692-8","volume":"8","author":"C Montoya","year":"2014","unstructured":"Montoya, C., Bellenguez-Morineau, O., Pinson, E., Rivreau, D.: Branch-and-price approach for the multi-skill project scheduling problem. Optim. Lett. 8(5), 1721\u20131734 (2014)","journal-title":"Optim. Lett."},{"key":"1542_CR34","volume-title":"Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions","author":"K Neumann","year":"2012","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions. Springer, Berlin (2012)"},{"key":"1542_CR35","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/978-1-4615-1507-4_25","volume-title":"Essays and Surveys in Metaheuristics","author":"K Nonobe","year":"2002","unstructured":"Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 557\u2013588. Springer, Boston (2002)"},{"issue":"2","key":"1542_CR36","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s00291-015-0402-2","volume":"38","author":"J Poppenborg","year":"2016","unstructured":"Poppenborg, J., Knust, S.: A flow-based tabu search algorithm for the RCPSP with transfer times. OR Spectr. 38(2), 305\u2013334 (2016)","journal-title":"OR Spectr."},{"issue":"4","key":"1542_CR37","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1108\/AA-09-2018-0126","volume":"39","author":"YF Ren","year":"2019","unstructured":"Ren, Y.F., Lu, Z.Q.: A flexible resource investment problem based on project splitting for aircraft moving assembly line. Assem. Autom. 39(4), 532\u2013547 (2019)","journal-title":"Assem. Autom."},{"key":"1542_CR38","volume-title":"Resource Allocation in Project Management","author":"C Schwindt","year":"2006","unstructured":"Schwindt, C.: Resource Allocation in Project Management. Springer, Berlin (2006)"},{"issue":"2","key":"1542_CR39","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(01)00320-4","volume":"142","author":"EF Stafford Jr","year":"2002","unstructured":"Stafford Jr., E.F., Tseng, F.T.: Two models for a family of flowshop sequencing problems. Eur. J. Oper. Res. 142(2), 282\u2013293 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"1542_CR40","doi-asserted-by":"crossref","first-page":"2635","DOI":"10.1016\/j.cor.2006.12.021","volume":"35","author":"G Stecco","year":"2008","unstructured":"Stecco, G., Cordeau, J.F., Moretti, E.: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times. Comput. Oper. Res. 35(8), 2635\u20132655 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"06","key":"1542_CR41","doi-asserted-by":"crossref","first-page":"1550048","DOI":"10.1142\/S0217595915500487","volume":"32","author":"M Suresh","year":"2015","unstructured":"Suresh, M., Dutta, P., Jain, K.: Resource constrained multi-project scheduling problem with resource transfer times. Asia Pac. J. Oper. Res. 32(06), 1550048 (2015)","journal-title":"Asia Pac. J. Oper. Res."},{"issue":"2","key":"1542_CR42","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V Valls","year":"2008","unstructured":"Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 185(2), 495\u2013508 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1542_CR43","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Van Peteghem","year":"2010","unstructured":"Van Peteghem, V., Vanhoucke, M.: A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 201(2), 409\u2013418 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"20","key":"1542_CR44","doi-asserted-by":"crossref","first-page":"4804","DOI":"10.1016\/j.ins.2011.06.014","volume":"181","author":"L Wang","year":"2011","unstructured":"Wang, L., Fang, C.: An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Inf. Sci. 181(20), 4804\u20134822 (2011)","journal-title":"Inf. Sci."},{"key":"1542_CR45","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.swevo.2017.06.001","volume":"38","author":"L Wang","year":"2018","unstructured":"Wang, L., Zheng, X.: A knowledge-guided multi-objective fruit fly optimization algorithm for the multi-skill resource constrained project scheduling problem. Swarm Evol. Comput. 38, 54\u201363 (2018)","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"1542_CR46","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/ijoc.1040.0121","volume":"18","author":"G Zhu","year":"2006","unstructured":"Zhu, G., Bard, J.F., Yu, G.: A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. Inf. J. Comput. 18(3), 377\u2013390 (2006)","journal-title":"Inf. J. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01542-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01542-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01542-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T07:02:41Z","timestamp":1612940561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01542-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,11]]},"references-count":46,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1542"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01542-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,11]]},"assertion":[{"value":"13 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}