A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
From MaRDI portal
Publication:6620469
DOI10.1007/s10951-024-00811-2zbMATH Open1548.90058MaRDI QIDQ6620469
Giovanni Righini, Alberto Ceselli, Michele Barbato
Publication date: 16 October 2024
Published in: Journal of Scheduling (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
- A survey on single crane scheduling in automated storage/retrieval systems
- Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- A survey of literature on automated storage and retrieval systems
- Scheduling a batching machine
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- Warehousing in the e-commerce era: a survey
- On solving the order processing in picking workstations
- Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
- Advances in Optimization and Decision Science for Society, Services and Enterprises
This page was built for publication: A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
