One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations

DOI10.3138/INFOR.47.2.81MaRDI QIDQ6160198zbMATH OpenFDO

Authors Elkafi Hassini

Publication date 9 May 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationquadratic assignment problemcarousel applicationsstorage space location

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• A two-carousel storage location problem
• Optimal storage locations in a carousel storage and retrieval system
• Maximizing service of carousel storage
• Order picking optimization in carousels storage system
• PICKING CLUMPY ORDERS ON A CAROUSEL

Cites work

• scientific article; zbMATH DE number 3147953 (Why is no real title available?)
• scientific article; zbMATH DE number 3147954 (Why is no real title available?)
• scientific article; zbMATH DE number 3854475 (Why is no real title available?)
• scientific article; zbMATH DE number 4051072 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 1487918 (Why is no real title available?)
• scientific article; zbMATH DE number 3330693 (Why is no real title available?)
• A Lindley-type equation arising from a carousel problem
• A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
• A note on ``a simple heuristic for maximizing service of carousel storage
• A simple heuristic for maximizing service of carousel storage
• A two-carousel storage location problem
• Assignment Problems and the Location of Economic Activities
• Cardes—carousel design
• Carousel system performance
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• Near-Optimal Solutions to a 2-Dimensional Placement Problem
• On a class of order pick strategies in paternosters
• On the minimal travel time needed to collect \(n\) items on a circle.
• Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
• Optimal product and server locations in one-dimensional storage racks
• Optimal storage locations in a carousel storage and retrieval system
• Order picking in carusel systems under the nearest item heuristic
• Performance of carousel systems with ‘organ-pipe’ storage
• Positioning of automated guided vehicles in a loop layout to improve response time
• The Efficiency of Two Groups of N Machines Served by a Single Robot
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• The travel time in carousel systems under the nearest item heuristic

Cited in

(6)

• The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension
• A two-carousel storage location problem
• A Benders decomposition approach to product location in carousel storage systems
• Order sequencing on a unidirectional cyclical picking line
• Automated or manual storage systems: do throughput and storage capacity matter?
• SKU arrangement on a unidirectional picking line

This page was built for publication: One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations

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