A simple heuristic for maximizing service of carousel storage

DOI10.1016/S0305-0548(99)00089-1MaRDI QIDQ1582692zbMATH OpenOpenAlexFDO

Authors David P. Jacobs, John C. Peck, J. Steve Davis

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

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A note on ``a simple heuristic for maximizing service of carousel storage
• Order picking in carusel systems under the nearest item heuristic
• Maximizing service of carousel storage
• Improved algorithm for maximizing service of carousel storage
• A two-carousel storage location problem

Cited in

(13)

• 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
• A two-carousel storage location problem
• Improved algorithm for maximizing service of carousel storage
• Storage space allocation to maximize inter-replenishment times
• A non-increasing Lindley-type equation
• 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
• A survey on performance analysis of warehouse carousel systems
• Maximizing service of carousel storage

This page was built for publication: A simple heuristic for maximizing service of carousel storage

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