A note on ``a simple heuristic for maximizing service of carousel storage
From MaRDI portal
Publication:1603349
DOI10.1016/S0305-0548(01)00112-5zbMath1005.90019OpenAlexW2079693439MaRDI QIDQ1603349
Publication date: 11 July 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00112-5
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)
Related Items (5)
Improved algorithm for maximizing service of carousel storage ⋮ SKU arrangement on a unidirectional picking line ⋮ One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations ⋮ Storage space allocation to maximize inter-replenishment times ⋮ Maximizing service of carousel storage
Cites Work
This page was built for publication: A note on ``a simple heuristic for maximizing service of carousel storage
