A simple heuristic for maximizing service of carousel storage
From MaRDI portal
Publication:1582692
DOI10.1016/S0305-0548(99)00089-1zbMath0967.90004OpenAlexW1963574198MaRDI QIDQ1582692
J. Steve Davis, John C. Peck, David P. Jacobs
Publication date: 3 September 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00089-1
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (11)
Improved algorithm for maximizing service of carousel storage ⋮ A non-increasing Lindley-type equation ⋮ Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems ⋮ SKU arrangement on a unidirectional picking line ⋮ One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations ⋮ Storage space allocation to maximize inter-replenishment times ⋮ A Lindley-type equation arising from a carousel problem ⋮ Maximizing service of carousel storage ⋮ Design and storage cycle time analysis for the automated storage system with a conveyor and a rotary rack ⋮ A note on ``a simple heuristic for maximizing service of carousel storage ⋮ Comments on a note by Jacobs, Peck and Davis
Cites Work
This page was built for publication: A simple heuristic for maximizing service of carousel storage
