{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T16:11:18Z","timestamp":1778170278983,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T00:00:00Z","timestamp":1523923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00291-018-0517-3","type":"journal-article","created":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T00:45:11Z","timestamp":1523925911000},"page":"1109-1139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Integrated order picking and vehicle routing with due dates"],"prefix":"10.1007","volume":"40","author":[{"given":"Daniel","family":"Schubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1768-1602","authenticated-orcid":false,"given":"Andr\u00e9","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"W\u00e4scher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"key":"517_CR1","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/S0305-0548(96)00080-9","volume":"24","author":"B Alidaee","year":"1997","unstructured":"Alidaee B, Rosa D (1997) Scheduling parallel machines to minimize total weighted and unweighted tardiness. Comput Oper Res 24:775\u2013788","journal-title":"Comput Oper Res"},{"key":"517_CR2","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","volume":"78","author":"N Azi","year":"2007","unstructured":"Azi N, Gendreau M, Potvin J-Y (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 78:755\u2013766","journal-title":"Eur J Oper Res"},{"key":"517_CR3","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","volume":"202","author":"N Azi","year":"2010","unstructured":"Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur J Oper Res 202:756\u2013763","journal-title":"Eur J Oper Res"},{"key":"517_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","volume":"41","author":"N Azi","year":"2014","unstructured":"Azi N, Gendreau M, Potvin J-Y (2014) An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput Oper Res 41:167\u2013173","journal-title":"Comput Oper Res"},{"key":"517_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0925-5273(98)00034-6","volume":"55","author":"M Azizoglu","year":"1998","unstructured":"Azizoglu M, Kirca O (1998) Tardiness minimization on parallel machines. Int J Prod Econ 55:163\u2013168","journal-title":"Int J Prod Econ"},{"key":"517_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0272-6963(81)90014-0","volume":"1","author":"KR Baker","year":"1981","unstructured":"Baker KR, Bertrand JWM (1981) An investigation of due-date assignment rules with constrained tightness. J Oper Manag 1:109\u2013120","journal-title":"J Oper Manag"},{"key":"517_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"KR Baker","year":"1982","unstructured":"Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due-dates. J Oper Manag 3:37\u201342","journal-title":"J Oper Manag"},{"key":"517_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ijpe.2008.04.011","volume":"115","author":"D Biskup","year":"2008","unstructured":"Biskup D, Herrmann J, Gupta JND (2008) Scheduling identical parallel machines to minimize total tardiness. Int J Prod Econ 115:134\u2013142","journal-title":"Int J Prod Econ"},{"key":"517_CR9","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/09537289608930364","volume":"7","author":"SA Brah","year":"1996","unstructured":"Brah SA (1996) A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod Plan Controls 7:362\u2013373","journal-title":"Prod Plan Controls"},{"key":"517_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/S0377-2217(97)00010-6","volume":"100","author":"J Brand\u00e3o","year":"1997","unstructured":"Brand\u00e3o J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Oper Res 100:180\u2013191","journal-title":"Eur J Oper Res"},{"key":"517_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(95)00030-U","volume":"65","author":"P Brucker","year":"1996","unstructured":"Brucker P, Hurink J, Werner F (1996) Improving local search heuristics for some scheduling problems. Part I. Discrete Appl Math 65:97\u2013122","journal-title":"Discrete Appl Math"},{"key":"517_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0166-218X(96)00036-4","volume":"72","author":"P Brucker","year":"1997","unstructured":"Brucker P, Hurink J, Werner F (1997) Improving local search heuristics for some scheduling problems. Part II. Discrete Appl Math 72:47\u201369","journal-title":"Discrete Appl Math"},{"key":"517_CR13","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1287\/trsc.2015.0608","volume":"50","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza D, Absi N, Feillet D (2016) The multi-trip vehicle routing problem with time windows and release dates. Transport Sci 50:676\u2013693","journal-title":"Transport Sci"},{"key":"517_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"Z-L Chen","year":"2010","unstructured":"Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extension. Oper Res 58:130\u2013148","journal-title":"Oper Res"},{"key":"517_CR15","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"Z-L Chen","year":"2005","unstructured":"Chen Z-L, Vairaktarakis GL (2005) Integrated scheduling of production and distribution operations. Manag Sci 51:614\u2013628","journal-title":"Manag Sci"},{"key":"517_CR16","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1057\/palgrave.jors.2601791","volume":"55","author":"W-C Chiang","year":"2004","unstructured":"Chiang W-C, Russell RA (2004) A metaheuristic for the vehicle-routeing problem with soft time windows. J Oper Res Soc 55:1298\u20131310","journal-title":"J Oper Res Soc"},{"key":"517_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14:52\u201367","journal-title":"INFORMS J Comput"},{"key":"517_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/1.9781611973594.ch5","volume-title":"Vehicle routing: problems, methods and applications","author":"G Desaulniers","year":"2014","unstructured":"Desaulniers G, Madsen OBG, Ropke S (2014) The vehicle routing problem with time windows. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods and applications, 2nd edn. Society for Industrial and Applied Mathematics and the Mathematical Optimization Society, Philadelphia, pp 119\u2013160","edition":"2"},{"key":"517_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"1","author":"G Dueck","year":"1990","unstructured":"Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 1:161\u2013175","journal-title":"J Comput Phys"},{"key":"517_CR20","unstructured":"DVZ\u2014Deutsche Verkehrszeitung (2013) Wir liefern k\u00fcnftig im 24-Stunden-Rhythmus. \n                    http:\/\/www.dvz.de\/rubriken\/logistik-verlader\/single-view\/nachricht\/24-stunden-belieferung-ueber-alle-sortimente.html\n                    \n                  . Accessed 22 Mar 2017"},{"key":"517_CR21","unstructured":"EDEKA Minden-Hannover. (2017) \n                    http:\/\/www.edekaverbund.de\/Unternehmen\/de\/edeka_minden_hannover\/unternehmen_minden_hannover\/zahlen_daten_fakten\/zahlen_daten_fakten_minden_hannover.jsp\n                    \n                  . Accessed 22 Mar 2017"},{"key":"517_CR22","unstructured":"Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Working paper, Fachbereich Wirtschaftswissenschaften, Universit\u00e4t Hamburg"},{"key":"517_CR23","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1057\/palgrave.jors.2602371","volume":"59","author":"Z Fu","year":"2008","unstructured":"Fu Z, Eglese R, Li LYO (2008) A unified tabu search algorithm for vehicle routing problems with soft time windows. J Oper Res Soc 59:663\u2013673","journal-title":"J Oper Res Soc"},{"key":"517_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ijpe.2014.08.017","volume":"160","author":"S Gao","year":"2015","unstructured":"Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13\u201325","journal-title":"Int J Prod Econ"},{"key":"517_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0167-6377(03)00064-6","volume":"32","author":"A Grosso","year":"2004","unstructured":"Grosso A, Della Croce F, Tadei R (2004) An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper Res Lett 32:68\u201372","journal-title":"Oper Res Lett"},{"key":"517_CR26","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1111\/j.1540-5915.1973.tb00572.x","volume":"4","author":"JND Gupta","year":"1973","unstructured":"Gupta JND, Maykut AR (1973) Concepts, theory, and techniques\u2014scheduling jobs on parallel processors with dynamic programming. Decis Sci 4:447\u2013457","journal-title":"Decis Sci"},{"key":"517_CR27","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449\u2013467","journal-title":"Eur J Oper Res"},{"key":"517_CR28","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.ejor.2015.05.020","volume":"246","author":"T Henke","year":"2015","unstructured":"Henke T, Speranza MG, W\u00e4scher G (2015) The multi-compartment vehicle routing problem with flexible compartment sizes. Eur J Oper Res 246:730\u2013743","journal-title":"Eur J Oper Res"},{"key":"517_CR29","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s10696-012-9164-1","volume":"27","author":"S Henn","year":"2015","unstructured":"Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex Serv Manuf 27:86\u2013114","journal-title":"Flex Serv Manuf"},{"key":"517_CR30","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.cie.2013.07.003","volume":"66","author":"S Henn","year":"2013","unstructured":"Henn S, Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput Indus Eng 66:338\u2013351","journal-title":"Comput Indus Eng"},{"key":"517_CR31","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I","volume":"38","author":"JC Ho","year":"1991","unstructured":"Ho JC, Chang Y-L (1991) Heuristic for minimizing mean tardiness of m parallel machines. Naval Res Logist 38:367\u2013381","journal-title":"Naval Res Logist"},{"key":"517_CR32","unstructured":"H\u00fcbner A, Ostermeier M (2016) A multi-compartment vehicle routing problem with loading and unloading costs. Working Paper, Catholic University Eichst\u00e4tt-Ingolstadt"},{"key":"517_CR33","first-page":"85","volume":"17","author":"AP Hurter","year":"1996","unstructured":"Hurter AP, Van Buer MG (1996) The newspaper production\/distribution problem. J Bus Logist 17:85\u2013107","journal-title":"J Bus Logist"},{"key":"517_CR34","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1016\/j.dam.2007.04.022","volume":"156","author":"T Ibaraki","year":"2008","unstructured":"Ibaraki T, Imahori S, Nonobe K, Sobue K, Uno T, Yagiura M (2008) An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Appl Math 156:2050\u20132069","journal-title":"Discrete Appl Math"},{"key":"517_CR35","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E","volume":"44","author":"C Koulamas","year":"1997","unstructured":"Koulamas C (1997) Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Res Logist 44:109\u2013125","journal-title":"Naval Res Logist"},{"key":"517_CR36","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2003.11.022","volume":"164","author":"C-L Li","year":"2005","unstructured":"Li C-L, Vairaktarakis GL, Lee C-Y (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Oper Res 164:39\u201351","journal-title":"Eur J Oper Res"},{"key":"517_CR37","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.eswa.2016.02.033","volume":"57","author":"K Li","year":"2016","unstructured":"Li K, Zhou C, Leung JY-T, Ma Y (2016) Integrated production and delivery with single machine and multiple vehicles. Expert Syst Appl 57:12\u201320","journal-title":"Expert Syst Appl"},{"key":"517_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10288-010-0136-6","volume":"9","author":"F Liberatore","year":"2011","unstructured":"Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9:49\u201382","journal-title":"4OR"},{"key":"517_CR39","series-title":"International series in operations research and management science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, vol 146, 2nd edn. International series in operations research and management science. Springer, New York, pp 363\u2013397","edition":"2"},{"key":"517_CR40","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1080\/00207543.2012.677071","volume":"51","author":"C Low","year":"2013","unstructured":"Low C, Li R-K, Chang C-M (2013) Integrated scheduling of production and delivery with time windows. Int J Prod Res 51:897\u2013909","journal-title":"Int J Prod Res"},{"key":"517_CR41","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ijpe.2014.02.014","volume":"153","author":"C Low","year":"2014","unstructured":"Low C, Chang C-M, Li R-K, Huang C-L (2014) Coordination of production scheduling and delivery problems with heterogeneous fleet. Int J Prod Res 153:139\u2013148","journal-title":"Int J Prod Res"},{"key":"517_CR42","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.cor.2005.02.044","volume":"34","author":"A Olivera","year":"2007","unstructured":"Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34:28\u201347","journal-title":"Comput Oper Res"},{"key":"517_CR43","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(03)00434-7","volume":"133","author":"R Petch","year":"2004","unstructured":"Petch R, Salhi S (2004) A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl Math 133:69\u201392","journal-title":"Discrete Appl Math"},{"key":"517_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems, 5th edn. Springer, Cham","edition":"5"},{"key":"517_CR45","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek M, Hartl RF, Doerner K (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10:613\u2013627","journal-title":"J Heuristics"},{"key":"517_CR46","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1100.0328","volume":"44","author":"E Prescott-Gagnon","year":"2010","unstructured":"Prescott-Gagnon E, Desaulniers G, Drexl M, Rousseau L-M (2010) European driver rules in vehicle routing with time windows. Transport Sci 44:455\u2013473","journal-title":"Transport Sci"},{"key":"517_CR47","volume-title":"Layout and routing methods for warehouses","author":"KJ Roodbergen","year":"2001","unstructured":"Roodbergen KJ (2001) Layout and routing methods for warehouses. Trial, Rotterdam"},{"key":"517_CR48","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid V, Doerner KF, Laporte G (2013) Rich routing problems arising in supply chain management. Eur J Oper Res 224:435\u2013448","journal-title":"Eur J Oper Res"},{"key":"517_CR49","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2017.04.038","volume":"263","author":"A Scholz","year":"2017","unstructured":"Scholz A, Schubert D, W\u00e4scher G (2017) Order picking with multiple pickers and due dates\u2014simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur J Oper Res 263:461\u2013478","journal-title":"Eur J Oper Res"},{"key":"517_CR50","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ejor.2005.09.038","volume":"177","author":"S-O Shim","year":"2007","unstructured":"Shim S-O, Kim Y-D (2007) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177:135\u2013146","journal-title":"Eur J Oper Res"},{"key":"517_CR51","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1057\/jors.1996.133","volume":"47","author":"D Taillard","year":"1996","unstructured":"Taillard D, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47:1065\u20131070","journal-title":"J Oper Res Soc"},{"key":"517_CR52","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"D Taillard","year":"1997","unstructured":"Taillard D, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31:170\u2013186","journal-title":"Transport Sci"},{"key":"517_CR53","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/S0377-2217(02)00669-0","volume":"152","author":"CD Tarantilis","year":"2004","unstructured":"Tarantilis CD, Kiranoudis CT, Vassiliadis VS (2004) A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152:148\u2013158","journal-title":"Eur J Oper Res"},{"key":"517_CR54","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ejor.2012.11.049","volume":"227","author":"CA Ullrich","year":"2013","unstructured":"Ullrich CA (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227:152\u2013165","journal-title":"Eur J Oper Res"},{"key":"517_CR55","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0377-2217(98)00300-2","volume":"115","author":"MG Buer Van","year":"1999","unstructured":"Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production\/distribution problem. Eur J Oper Res 115:237\u2013253","journal-title":"Eur J Oper Res"},{"key":"517_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231:1\u201321","journal-title":"Eur J Oper Res"},{"key":"517_CR57","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0925-5273(01)00175-X","volume":"76","author":"F Yalaoui","year":"2002","unstructured":"Yalaoui F, Chu C (2002) Parallel machine scheduling to minimize total tardiness. Int J Prod Econ 76:265\u2013279","journal-title":"Int J Prod Econ"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0517-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0517-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0517-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:07:54Z","timestamp":1555445274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0517-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,17]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["517"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0517-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,17]]},"assertion":[{"value":"26 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}