Retrieval optimization in a warehouse with multiple input/output-points

DOI10.1007/S00291-024-00775-XMaRDI QIDQ6995303zbMATH OpenFDO

Authors J. Buckow, Marc Goerigk, Sigrid Knust

Publication date 22 April 2025

Published in OR Spectrum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00291-024-00775-X

zbMATH Keywords

logisticsmultiple input/output-pointsretrieval optimizationwarehouse

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• A note on the polytope of bipartite TSP
• A survey of literature on automated storage and retrieval systems
• A survey on single crane scheduling in automated storage/retrieval systems
• An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
• An exact method for scheduling a yard crane
• Branch and bound algorithms for the bus evacuation problem
• Construction heuristics for the asymmetric TSP.
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Interleaving models for the analysis of twin shuttle automated storage and retrieval systems
• Polynomially solvable cases of the bipartite traveling salesman problem
• Scheduling of container storage and retrieval
• Solution of a Large-Scale Traveling-Salesman Problem

Cited in

(1)

• Integrated pallet retrieval and processing in warehouses under uncertainty

This page was built for publication: Retrieval optimization in a warehouse with multiple input/output-points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995303)