{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:51:28Z","timestamp":1780602688748,"version":"3.54.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002717","name":"Minist\u00e8re de l\u2019Enseignement Sup\u00e9rieur et de la Recherche Scientifique","doi-asserted-by":"publisher","award":["97\/PNE\/enseignant\/France\/2018-2019"],"award-info":[{"award-number":["97\/PNE\/enseignant\/France\/2018-2019"]}],"id":[{"id":"10.13039\/501100002717","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SurferLab","award":["NP0001628"],"award-info":[{"award-number":["NP0001628"]}]},{"DOI":"10.13039\/501100005307","name":"Direction G\u00e9n\u00e9rale de la Recherche Scientifique et du D\u00e9veloppement Technologique","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005307","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts\u2019 transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.<\/jats:p>","DOI":"10.1007\/s11590-020-01674-0","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T17:02:52Z","timestamp":1606410172000},"page":"255-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8078-6696","authenticated-orcid":false,"given":"Moussa","family":"Abderrahim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdelghani","family":"Bekrar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Trentesaux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nassima","family":"Aissani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karim","family":"Bouamrane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,26]]},"reference":[{"key":"1674_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1108\/01439911011063281","volume":"37","author":"H Martinez-Barbera","year":"2010","unstructured":"Martinez-Barbera, H., Herrero-Perez, D.: Development of a flexible AGV for flexible manufacturing systems. Ind. Robot 37, 459\u2013468 (2010)","journal-title":"Ind. Robot"},{"key":"1674_CR2","unstructured":"Pu, P., Hughes, J., Integrating AGV schedules in a scheduling system for a flexible manufacturing environment, In: Proceedings of the 1994 IEEE International Conference on Robotics and Automation, pp 3149\u20133154 (1994)"},{"key":"1674_CR3","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2019","unstructured":"Zhang, J., Ding, G., Zou, Y., Qin, S., Fu, J.: Review of job shop scheduling research and its new perspectives under Industry 4.0. J. Intell. Manuf 30, 1809\u20131830 (2019)","journal-title":"J. Intell. Manuf"},{"key":"1674_CR4","unstructured":"Wojakowski, P.: Research study of state-of-the-art algorithms for flexible job-shop scheduling problem. Czasopismo Techniczne. 1-M (5) 2013, 381\u2013388 (2013). https:\/\/doi.org\/10.4467\/2353737XCT.14.048.1974"},{"key":"1674_CR5","volume-title":"Wiley Encyclopedia of Electrical and Electronics Engineering W3352","author":"A Jones","year":"1999","unstructured":"Jones, A., Rabelo, L.C., Sharawi, A.T.: Survey of Job Shop Scheduling Techniques. In: Webster, J.G. (ed.) Wiley Encyclopedia of Electrical and Electronics Engineering W3352. Wiley, USA, Hoboken, NJ (1999)"},{"key":"1674_CR6","doi-asserted-by":"crossref","unstructured":"Sevaux, M., S\u00f6rensen, K., A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates. 4OR. 2, 129\u2013147 (2004). https:\/\/doi.org\/10.1007\/s10288-003-0028-0","DOI":"10.1007\/s10288-003-0028-0"},{"key":"1674_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23, 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"1674_CR8","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1674_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/11730095_22","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Sevkli","year":"2006","unstructured":"Sevkli, M., Aydin, M.E.: A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems. In: Gottlieb, J., Raidl, G.R. (eds.) Evolutionary Computation in Combinatorial Optimization, pp. 261\u2013271. Springer, Berlin (2006)"},{"key":"1674_CR10","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"Roshanaei, V., Naderi, B., Jolai, F., Khalili, M.: A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future. Gener. Comp. Sy 25, 654\u2013661 (2009)","journal-title":"Future. Gener. Comp. Sy"},{"key":"1674_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.knosys.2012.04.001","volume":"36","author":"H Karimi","year":"2012","unstructured":"Karimi, H., Rahmati, S.H.A., Zandieh, M.: An efficient knowledge-based algorithm for the flexible job shop scheduling problem. Knowl. Based. Syst 36, 236\u2013244 (2012)","journal-title":"Knowl. Based. Syst"},{"key":"1674_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, G., Zhang, L., Song, X., Wang, Y., Zhou, C.: A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Cluster Comput. 22, 11561\u201311572 (2019). https:\/\/doi.org\/10.1007\/s10586-017-1420-4","DOI":"10.1007\/s10586-017-1420-4"},{"key":"1674_CR13","doi-asserted-by":"publisher","first-page":"76313","DOI":"10.1109\/ACCESS.2018.2877791","volume":"6","author":"F Zhao","year":"2018","unstructured":"Zhao, F., Qin, S., Yang, G., Ma, W., Zhang, C., Song, H.: A differential-based harmony search algorithm with variable neighborhood search for job shop scheduling problem and its runtime analysis. IEEE Access 6, 76313\u201376330 (2018)","journal-title":"IEEE Access"},{"key":"1674_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness, 236\u2013244","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, 236\u2013244. Bell telephone Laboratories Inc, USA (1979)"},{"key":"1674_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(01)00273-6","volume":"119","author":"J Hurink","year":"2002","unstructured":"Hurink, J., Knust, S.: A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete. Appl. Math 119, 181\u2013203 (2002)","journal-title":"Discrete. Appl. Math"},{"key":"1674_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejor.2003.10.034","volume":"162","author":"J Hurink","year":"2005","unstructured":"Hurink, J., Knust, S.: Tabu search algorithms for job-shop problems with a single transport robot. Eur. J. Oper. Res 162, 99\u2013111 (2005)","journal-title":"Eur. J. Oper. Res"},{"key":"1674_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021149204501","volume":"115","author":"P Brucker","year":"2002","unstructured":"Brucker, P., Knust, S.: Lower bounds for scheduling a single robot in a job-shop environment. Ann. Oper. Res 115, 147\u2013172 (2002)","journal-title":"Ann. Oper. Res"},{"key":"1674_CR18","unstructured":"Job-shop scheduling with transportation. [Online]. Available: http:\/\/www2.informatik.uni-osnabrueck.de\/kombopt\/data\/robot\/. [Accessed: 24-May-2019]"},{"key":"1674_CR19","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1287\/opre.43.6.1058","volume":"43","author":"\u00dc Bilge","year":"1995","unstructured":"Bilge, \u00dc., Ulusoy, G.: A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper. Res. 43, 1058\u20131070 (1995)","journal-title":"Oper. Res."},{"key":"1674_CR20","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.ejor.2008.03.051","volume":"199","author":"A Caumond","year":"2009","unstructured":"Caumond, A., Lacomme, P., Moukrim, A., Tchernev, N.: An MILP for scheduling problems in an FMS with one vehicle. Eur. J. Oper. Res. 199, 706\u2013722 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1674_CR21","doi-asserted-by":"crossref","unstructured":"Ham, A.: Transfer-robot task scheduling in job shop. Int. J. Prod. Res. (2020). https:\/\/doi.org\/10.1080\/00207543.2019.1709671","DOI":"10.1007\/s10845-020-01537-6"},{"key":"1674_CR22","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.asoc.2014.08.028","volume":"24","author":"C Zeng","year":"2014","unstructured":"Zeng, C., Tang, J., Yan, C.: Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles. Appl. Soft Comput. 24, 1033\u20131046 (2014)","journal-title":"Appl. Soft Comput."},{"key":"1674_CR23","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s10878-014-9723-3","volume":"31","author":"R B\u00fcrgy","year":"2016","unstructured":"B\u00fcrgy, R., Gr\u00f6flin, H.: The blocking job shop with rail-bound transportation. J. Comb. Optim. 31, 152\u2013181 (2016)","journal-title":"J. Comb. Optim."},{"key":"1674_CR24","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1080\/00207540600818286","volume":"46","author":"L Deroussi","year":"2008","unstructured":"Deroussi, L., Gourgand, M., Tchernev, N.: A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Res 46, 2143\u20132164 (2008)","journal-title":"Int. J. Prod. Res"},{"key":"1674_CR25","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","volume":"39","author":"Q Zhang","year":"2012","unstructured":"Zhang, Q., Manier, H., Manier, M.-A.: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput. Oper. Res. 39, 1713\u20131723 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1674_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-12970-9_13","volume-title":"Swarm Intelligence Based Optimization","author":"L Deroussi","year":"2014","unstructured":"Deroussi, L.: A Hybrid PSO Applied to the Flexible Job Shop with Transport. In: Siarry, P., Idoumghar, L., Lepagnot, J. (eds.) Swarm Intelligence Based Optimization, pp. 115\u2013122. Springer International Publishing, Cham (2014)"},{"key":"1674_CR27","doi-asserted-by":"publisher","first-page":"113096","DOI":"10.1016\/j.eswa.2019.113096","volume":"144","author":"ES Hern\u00e1ndez-Gress","year":"2020","unstructured":"Hern\u00e1ndez-Gress, E.S., Seck-Tuoh-Mora, J.C., Hern\u00e1ndez-Romero, N., Medina-Mar\u00edn, J., Lagos-Eulogio, P., Ort\u00edz-Perea, J.: The solution of the concurrent layout scheduling problem in the job-shop environment through a local neighborhood search algorithm. Expert Syst. Appl. 144, 113096 (2020)","journal-title":"Expert Syst. Appl."},{"key":"1674_CR28","doi-asserted-by":"publisher","first-page":"106295","DOI":"10.1016\/j.cie.2020.106295","volume":"141","author":"A Ebrahimi","year":"2020","unstructured":"Ebrahimi, A., Jeon, H.W., Lee, S., Wang, C.: Minimizing total energy cost and tardiness penalty for a scheduling-layout problem in a flexible job shop system: a comparison of four metaheuristic algorithms. Comp. Ind. Eng. 141, 106295 (2020)","journal-title":"Comp. Ind. Eng."},{"key":"1674_CR29","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven, C., \u00d6zbak\u0131r, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model 34, 1539\u20131548 (2010)","journal-title":"Appl. Math. Model"},{"key":"1674_CR30","unstructured":"Logical constraints for CPLEX. https:\/\/www.ibm.com\/support\/knowledgecenter\/en\/SSSA5P_12.9.0\/ilog.odms.ide.help\/OPL_Studio\/opllangref\/topics\/opl_langref_constraints_types_logical.html (accessed Aug. 21, 2020)"},{"key":"1674_CR31","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R Cheng","year":"1996","unstructured":"Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Comput. Ind. Eng. Represent. 30, 983\u2013997 (1996)","journal-title":"Comput. Ind. Eng. Represent."},{"key":"1674_CR32","doi-asserted-by":"crossref","unstructured":"Dhaenens, C., Jourdan, L.: Optimization and big data. In: Metaheuristics for Big Data. ISTE Ltd and Wiley, Inc., London, UK and Hoboken, USA, pp 1\u201321 (2016)","DOI":"10.1002\/9781119347569.ch1"},{"key":"1674_CR33","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/imaman\/dpm009","volume":"18","author":"M Sevkli","year":"2007","unstructured":"Sevkli, M., Aydin, M.E.: Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA J. Manag. Math. 18, 117\u2013133 (2007)","journal-title":"IMA J. Manag. Math."},{"key":"1674_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic, T.G., Gendreau, M., Hansen, P., Mladenovi\u0107, N.: Cooperative parallel variable neighborhood search for the p-median. J. Heuristics. 10, 293\u2013314 (2004)","journal-title":"J. Heuristics."},{"key":"1674_CR35","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.asoc.2016.02.002","volume":"42","author":"A Djeni\u0107","year":"2016","unstructured":"Djeni\u0107, A., Radoji\u010di\u0107, N., Mari\u0107, M., Mladenovi\u0107, M.: Parallel VNS for bus terminal location problem. Appl. Soft Comput. 42, 448\u2013458 (2016)","journal-title":"Appl. Soft Comput."},{"key":"1674_CR36","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1080\/00207543.2014.962113","volume":"53","author":"A T\u00fcrky\u0131lmaz","year":"2015","unstructured":"T\u00fcrky\u0131lmaz, A., Bulkan, S.: A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution. Int. J. Prod. Res. 53, 1832\u20131848 (2015). https:\/\/doi.org\/10.1080\/00207543.2014.962113","journal-title":"Int. J. Prod. Res."},{"key":"1674_CR37","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez, F., Meli\u00e1n-Batista, B., Moreno-P\u00e9rez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heuristics. 8, 375\u2013388 (2002)","journal-title":"J. Heuristics."},{"key":"1674_CR38","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-78985-7_6","volume-title":"Metaheuristics for Scheduling in Industrial and Manufacturing Applications","author":"ME Aydin","year":"2008","unstructured":"Aydin, M.E., Sevkli, M.: Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling. In: Xhafa, F., Abraham, A. (eds.) Metaheuristics for Scheduling in Industrial and Manufacturing Applications, pp. 125\u2013144. Springer, Berlin (2008)"},{"key":"1674_CR39","volume-title":"A Tutorial on Variable Neighborhood Search","author":"P Hansen","year":"2003","unstructured":"Hansen, P., Mladenovic, N.: A Tutorial on Variable Neighborhood Search. Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions, HEC Montr\u00e9al (2003)"},{"key":"1674_CR40","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","volume":"154","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N.: First versus best improvement. An emp. study Discrete App. Math. 154, 802\u2013817 (2006)","journal-title":"An emp. study Discrete App. Math."},{"key":"1674_CR41","volume-title":"Search Methodologies, 211\u2013238","author":"P Hansen","year":"2005","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighborhood Search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, 211\u2013238. Springer, US, Boston, MA (2005)"},{"key":"1674_CR42","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0305-0548(96)00061-5","volume":"24","author":"G Ulusoy","year":"1997","unstructured":"Ulusoy, G., Sivrikaya-\u015eerifo\u01e7lu, F., Bilge, \u00dc.: A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Comput. Oper. Res. 24, 335\u2013351 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1674_CR43","doi-asserted-by":"publisher","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","volume":"52","author":"Y Zheng","year":"2014","unstructured":"Zheng, Y., Xiao, Y., Seo, Y.: A tabu search algorithm for simultaneous machine\/AGV scheduling problem. Int. J. Prod. Res. 52, 5748\u20135763 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"1674_CR44","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ijpe.2010.07.012","volume":"143","author":"P Lacomme","year":"2013","unstructured":"Lacomme, P., Larabi, M., Tchernev, N.: Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Econ. 143, 24\u201334 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"1674_CR45","unstructured":"Bennett, J., Briggs, W.: Chapter 3 Numbers in the real world. In: Using & Understanding Mathematics: A Quantitative Reasoning Approach. Pearson. Boston, MA, p. 160 (2019)"},{"key":"1674_CR46","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jmsy.2015.08.002","volume":"37","author":"A Giret","year":"2015","unstructured":"Giret, A., Trentesaux, D., Prabhu, V.: Sustainability in manufacturing operations scheduling: a state of the art review. J. Manuf. Syst 37, 126\u2013140 (2015)","journal-title":"J. Manuf. Syst"},{"key":"1674_CR47","doi-asserted-by":"publisher","first-page":"4948","DOI":"10.3390\/en13184948","volume":"13","author":"M Abderrahim","year":"2020","unstructured":"Abderrahim, M., Bekrar, A., Trentesaux, D., Aissani, N., Bouamrane, K.: Manufacturing 4.0 operations scheduling with AGV battery management constraints. Energies 13, 4948 (2020)","journal-title":"Energies"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01674-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01674-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01674-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:41:42Z","timestamp":1641814902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01674-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,26]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1674"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01674-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,26]]},"assertion":[{"value":"12 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}