A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses

Michele Barbato (), Alberto Ceselli () and Giovanni Righini ()
Additional contact information
Michele Barbato: Università degli Studi di Milano
Alberto Ceselli: Università degli Studi di Milano
Giovanni Righini: Università degli Studi di Milano

Journal of Scheduling, 2024, vol. 27, issue 4, No 6, 393-407

Abstract: Abstract 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.

Keywords: Combinatorial optimization; Crane scheduling; Polynomial-time algorithm; Dynamic programming (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-024-00811-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:27:y:2024:i:4:d:10.1007_s10951-024-00811-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-024-00811-2

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().