A two-carousel storage location problem

Authors:
Elkafi Hassini;Raymond G. Vickson
Affiliations:
Department of Management Sciences, University of Waterloo, Waterloo, Ont., Canada N2L 3G1;Department of Management Sciences, University of Waterloo, Waterloo, Ont., Canada N2L 3G1
Venue:
Computers and Operations Research
Year:
2003

Citing 6
Cited 1

Structured partitioning problems

Operations Research
A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system

Computers and Operations Research
Placement of Records on a Secondary Storage Device to Minimize Access Time

Journal of the ACM (JACM)
On the Optimality of the Probability Ranking Scheme in Storage Applications

Journal of the ACM (JACM)
Automation, Production Systems, and Computer-Integrated Manufacturing

Automation, Production Systems, and Computer-Integrated Manufacturing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Optimal picking of large orders in carousel systems

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe a problem of storing products in carousels that are grouped in pods of two. Each pod is served by one operator. The aim is to minimize the long-run average rotational time per retrieval operation. We formulate the problem as a new type of nonlinear partitioning problem and discuss several heuristic solution procedures.