{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:06:49Z","timestamp":1776114409276,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009882","name":"Regione Lombardia","doi-asserted-by":"publisher","award":["E97F17000000009"],"award-info":[{"award-number":["E97F17000000009"]}],"id":[{"id":"10.13039\/501100009882","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider an optimization problem arising when a set of items must be selected and picked up from given locations in an automated storage and retrieval system by a crane of given capacity, minimizing the overall distance traveled. The problem has been classified as open in a recent taxonomy of optimal picking problems in automated warehouses. In this paper, we analyze some non-trivial properties of the problem and we describe a polynomial-time dynamic programming algorithm to solve it to proven optimality.<\/jats:p>","DOI":"10.1007\/s10951-024-00811-2","type":"journal-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T20:21:41Z","timestamp":1721161301000},"page":"393-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8521-896X","authenticated-orcid":false,"given":"Michele","family":"Barbato","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0983-2706","authenticated-orcid":false,"given":"Alberto","family":"Ceselli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9830-7454","authenticated-orcid":false,"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"issue":"4","key":"811_CR1","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1287\/trsc.2018.0873","volume":"53","author":"K Azadeh","year":"2019","unstructured":"Azadeh, K., De Koster, R., & Roy, D. (2019). Robotized and automated warehouse systems: Review and recent developments. Transportation Science, 53(4), 917\u2013945. https:\/\/doi.org\/10.1287\/trsc.2018.0873","journal-title":"Transportation Science"},{"key":"811_CR2","doi-asserted-by":"crossref","unstructured":"Barbato, M., Ceselli, A., & Righini, G. (2019). Paths and matchings in an automated warehouse. In: M. Paolucci, A. Sciomachen, & P. Uberti (Eds.), Advances in Optimization and Decision Science for Society, Services and Enterprises (pp. 151\u2013159). AIRO Springer Series, vol 3. Springer.","DOI":"10.1007\/978-3-030-34960-8_14"},{"issue":"2","key":"811_CR3","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2018.08.023","volume":"277","author":"N Boysen","year":"2019","unstructured":"Boysen, N., de Koster, R., & Weidinger, F. (2019). Warehousing in the e-commerce era: A survey. European Journal of Operational Research, 277(2), 396\u2013411. https:\/\/doi.org\/10.1016\/j.ejor.2018.08.023","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"811_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.ejor.2016.04.008","volume":"254","author":"N Boysen","year":"2016","unstructured":"Boysen, N., & Stephan, K. (2016). A survey on single crane scheduling in automated storage\/retrieval systems. European Journal of Operational Research, 254(3), 691\u2013704. https:\/\/doi.org\/10.1016\/j.ejor.2016.04.008","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"811_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M., Potts, C., Tautenhahn, T., & van de Velde, S. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"811_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R de Koster","year":"2007","unstructured":"de Koster, R., Le-Duc, T., & Roodbergen, K. (2007). Design and control of warehouse order picking: A literature review. European Journal of Operational Research, 182, 481\u2013501. https:\/\/doi.org\/10.1016\/j.ejor.2006.07.009","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"811_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1080\/07408170701730776","volume":"40","author":"DR Dooly","year":"2008","unstructured":"Dooly, D. R., & Lee, H. F. (2008). A shift-based sequencing method for twin-shuttle automated storage and retrieval systems. IIE Transactions, 40(6), 586\u2013594. https:\/\/doi.org\/10.1080\/07408170701730776","journal-title":"IIE Transactions"},{"issue":"24","key":"811_CR8","doi-asserted-by":"publisher","first-page":"8777","DOI":"10.3390\/app10248777","volume":"10","author":"JR Fontin","year":"2020","unstructured":"Fontin, J. R., & Lin, S. W. (2020). A joint comparative analysis of routing heuristics and paperless picking technologies using simulation and data envelopment analysis. Applied Sciences, 10(24), 8777.","journal-title":"Applied Sciences"},{"issue":"1","key":"811_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/trsc.2014.0562","volume":"51","author":"AH Gharehgozli","year":"2017","unstructured":"Gharehgozli, A. H., Yu, Y., Zhang, X., & Koster, Rd. (2017). Polynomial time algorithms to minimize total travel time in a two-depot automated storage\/retrieval system. Transportation Science, 51(1), 19\u201333. https:\/\/doi.org\/10.1287\/trsc.2014.0562","journal-title":"Transportation Science"},{"issue":"2","key":"811_CR10","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1287\/ijoc.2020.1040","volume":"33","author":"D Goeke","year":"2021","unstructured":"Goeke, D., & Schneider, M. (2021). Modeling single-picker routing problems in classical and modern warehouses. INFORMS Journal on Computing, 33(2), 436\u2013451. https:\/\/doi.org\/10.1287\/ijoc.2020.1040","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"811_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2006.02.025","volume":"177","author":"J Gu","year":"2007","unstructured":"Gu, J., Goetschalckx, M., & McGinnis, L. F. (2007). Research on warehouse operation: A comprehensive review. European Journal of Operational Research, 177(1), 1\u201321. https:\/\/doi.org\/10.1016\/j.ejor.2006.02.025","journal-title":"European Journal of Operational Research"},{"key":"811_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11590-020-01640-w","volume":"16","author":"A Ouzidan","year":"2022","unstructured":"Ouzidan, A., Sevaux, M., Olteanu, A., Pardo, E., & Duarte, A. (2022). On solving the order processing in picking workstations. Optimization Letters, 16, 5\u201335. https:\/\/doi.org\/10.1007\/s11590-020-01640-w","journal-title":"Optimization Letters"},{"issue":"2","key":"811_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ejor.2008.01.038","volume":"194","author":"K Roodbergen","year":"2009","unstructured":"Roodbergen, K., & Vis, I. (2009). A survey of literature on automated storage and retrieval systems. European Journal of Operational Research, 194(2), 343\u2013362. https:\/\/doi.org\/10.1016\/j.ejor.2008.01.038","journal-title":"European Journal of Operational Research"},{"key":"811_CR14","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.cor.2009.05.011","volume":"37","author":"L Tang","year":"2010","unstructured":"Tang, L., & Ren, H. (2010). Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem. Computers and Operations Research, 37, 368\u2013375. https:\/\/doi.org\/10.1016\/j.cor.2009.05.011","journal-title":"Computers and Operations Research"},{"key":"811_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/S0925-5273(98)00114-5","volume":"59","author":"J van den Berg","year":"1999","unstructured":"van den Berg, J., & Zijm, W. (1999). Models for warehouse management: Classification and examples. International Journal on Production Economics, 59, 519\u2013528. https:\/\/doi.org\/10.1016\/S0925-5273(98)00114-5","journal-title":"International Journal on Production Economics"},{"key":"811_CR16","doi-asserted-by":"publisher","unstructured":"Weidinger, F., Boysen, N., & Schneider, M. (2019). Picker routing in the mixed-shelves warehouses of e-commerce retailers. European Journal of Operational Research, 274, 501\u2013515. https:\/\/doi.org\/10.1016\/j.ejor.2018.10.021","DOI":"10.1016\/j.ejor.2018.10.021"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00811-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00811-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00811-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T13:35:44Z","timestamp":1723210544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00811-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["811"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00811-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"29 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}