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

Abstract In this paper we focus on the problems of one-dimensional storage location and order picking in a single carousel. We illustrate several applications, review the literature and list some open problems, and present a general model that includes the one-dimensional carousel storage location problem as well as other well-known combinatorial optimization problems as special cases.

[1]  Hark Hwang,et al.  Class-based storage assignment policy in carousel system , 1994 .

[2]  Pius J. Egbelu,et al.  Positioning of automated guided vehicles in a loop layout to improve response time , 1993 .

[3]  Brian D. Bunday,et al.  The efficiency of M groups of N machines served by a travelling robot: comparison of two models , 1988 .

[4]  Nelly Litvak,et al.  Optimal picking of large orders in carousel systems , 2006, Oper. Res. Lett..

[5]  Julia Kallrath.  Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions , 2004 .

[6]  John J. Bartholdi,et al.  Retrieval Strategies for a Carousel Conveyor , 1986 .

[7]  J. Trevino,et al.  Cardes : carousel design , 1994 .

[8]  Gerhard J. Woeginger,et al.  The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases , 1996, Math. Program..

[9]  Nelly Litvak,et al.  The travel time in carousel systems under the nearest item heuristic , 2001, Journal of Applied Probability.

[10]  Nelly Litvak,et al.  Order picking in carousel systems under the nearest item heuristic , 2000 .

[11]  Hark Hwang,et al.  Cycle time models for single/double carousel system , 1991 .

[12]  Han P. Bao,et al.  Simulation modeling of robotic assembly cell incorporating carousel , 1986 .

[13]  C. K. Wong,et al.  Near-Optimal Solutions to a 2-Dimensional Placement Problem , 1975, SIAM J. Comput..

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[15]  Kenneth B. Ackerman,et al.  Practical handbook of warehousing , 1983 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Raymond A. Kulwiec.  Materials Handling Handbook , 1985 .

[18]  Din-Horng Yeh.  A note on "a simple heuristic for maximizing service of carousel storage" , 2002, Comput. Oper. Res..

[19]  Vaughan R. Pratt,et al.  An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File , 1972, Complexity of Computer Computations.

[20]  Young Rhee,et al.  Performance of carousel systems with ‘organ-pipe’ storage , 2005 .

[21]  J. Kenneth Klitz.  Simulation of an automated logistics and manufacturing system , 1983 .

[22]  Layek Abdel-Malek,et al.  A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system , 1994, Comput. Oper. Res..

[23]  Arie Segev,et al.  Optimal Arrangements of Cartridges in Carousel Type Mass Storage Systems , 1994, Comput. J..

[24]  Patrick P. Bergmans.  Minimizing Expected Travel Time on Geometrical Patterns by Optimal Probability Rearrangements , 1972, Inf. Control..

[25]  Hark Hwang,et al.  AN APPROACH IN THE DESIGN OF A UNIT-LOAD AUTOMATED CAROUSEL STORAGE SYSTEM , 1988 .

[26]  R. G. Vickson,et al.  Optimal product and server locations in one-dimensional storage racks , 1998, Eur. J. Oper. Res..

[27]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[28]  N. Litvak,et al.  On the minimal travel time needed to collect n items on a circle , 2002, math/0405294.

[29]  Byung Chun Park,et al.  Carousel system performance , 2003, Journal of Applied Probability.

[30]  Golgen Bengu.  An optimal storage assignment for automated rotating carousels , 1995 .

[31]  G. H. Hardy,et al.  The Maximum of a Certain Bilinear Form , 1926 .

[32]  C. Mack,et al.  THE EFFICIENCY OF N MACHINES UNI-DIRECTIONALLY PATROLLED BY ONE OPERATIVE WHEN WALKING TIME AND REPAIR TIMES ARE CONSTANTS , 1957 .

[33]  Russell D. Meller,et al.  A throughput model for carousel/VLM pods , 2004 .

[34]  Horst W. Hamacher,et al.  Modelling ROTASTORE — A Highly Parallel, Short Term Storage System , 1999 .

[35]  E. Koenigsberg,et al.  The analysis of production systems , 1982 .

[36]  C. Mack,et al.  Efficiency of Bi-Directionally Traversed Machines , 1973 .

[37]  Todd LeBaron,et al.  Using simulation to optimize a horizontal carousel storage system , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[38]  Chwen-Tzeng Su.  Performance evaluations of carousel operation , 1998 .

[39]  Pius J. Egbelu,et al.  Relative positioning of a load extractor for a storage carousel , 1998 .

[40]  Ivo J. B. F. Adan,et al.  On a class of order pick strategies in paternosters , 2002, Oper. Res. Lett..

[41]  Hark Hwang,et al.  Performance analysis of carousel systems with double shuttle , 1999 .

[42]  L. R. Foulds,et al.  Formulation and solution of problems of tool positioning on a single machining centre , 1993 .

[43]  Kenneth B. Ackerman.  Warehousing and Corporate Strategy , 1997 .

[44]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[45]  C. Mack,et al.  The Efficiency of N Machines Uni‐Directionally Patrolled by One Operative When Walking Time is Constant and Repair Times are Variable , 1957 .

[46]  Chak-Kuen Wong,et al.  Algorithmic Studies in Mass Storage Systems , 1983, Springer Berlin Heidelberg.

[47]  Geert-Jan van Houtum,et al.  Performance analysis of a carousel system , 1996 .

[48]  Ivo J.B.F. Adan,et al.  A LINDLEY-TYPE EQUATION ARISING FROM A CAROUSEL PROBLEM , 2004 .

[49]  Ernest Koenigsberg,et al.  The Efficiency of Two Groups of N Machines Served by a Single Robot , 1987 .

[50]  Elkafi Hassini,et al.  A two-carousel storage location problem , 2003, Comput. Oper. Res..

[51]  Raymond G. Vickson,et al.  Optimal storage locations in a carousel storage and retrieval system , 1996 .

[52]  Gilbert Laporte,et al.  Optimal Sequencing Rules for Some Large-Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics , 1995 .

[53]  David Pokrass Jacobs,et al.  A simple heuristic for maximizing service of carousel storage , 2000, Comput. Oper. Res..