A simple heuristic for maximizing service of carousel storage
From MaRDI portal
Publication:1582692
DOI10.1016/S0305-0548(99)00089-1zbMath0967.90004MaRDI 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
90C59: Approximation methods and heuristics in mathematical programming
90B05: Inventory, storage, reservoirs
Related Items
A Lindley-type equation arising from a carousel problem, Design and storage cycle time analysis for the automated storage system with a conveyor and a rotary rack, SKU arrangement on a unidirectional picking line, One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations, Maximizing service of carousel storage, A note on ``a simple heuristic for maximizing service of carousel storage, Comments on a note by Jacobs, Peck and Davis, Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems, Improved algorithm for maximizing service of carousel storage, Storage space allocation to maximize inter-replenishment times, A non-increasing Lindley-type equation
Cites Work