Allocating Items to an Automated Storage and Retrieval System

Abstract To reduce material handling costs, distribution centers purchase automated storage and retrieval systems (AS/RS). It is often the case that the capacity of the AS/RS is insufficient to store all items. The distribution center must then decide which items to assign to the AS/RS and in what quantities they will be stored. In this paper, we develop a heuristic procedure to solve this problem. A priori and a posteriori tests of the data for the optimality of this heuristic procedure are provided. The proposed procedure is testedwith data gathered fr oma naval supply center.

[1]  Stephen C. Graves,et al.  Optimal Storage Assignment in Automatic Warehousing Systems , 1976 .

[2]  Meir J. Rosenblatt,et al.  Warehouse design with storage policy considerations , 1984 .

[3]  Hirotaka Nakayama,et al.  Trade-off analysis for optimal design of automated warehouses , 1980 .

[4]  Farhad Azadivar.  Maximization of the throughput of a computerized automated warehousing system under system constraints , 1986 .

[5]  Loren K. Platzman,et al.  Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities , 1990, Oper. Res..

[6]  Meir J. Rosenblatt,et al.  Note-Deriving the Optimal Boundaries for Class-Based Automatic Storage/Retrieval Systems , 1989 .

[7]  Paul H. Zipkin,et al.  Simple Ranking Methods for Allocation of One Resource , 1980 .

[8]  Y. Roll,et al.  Random versus grouped storage policies and their effect on warehouse capacity , 1983 .

[9]  Ludo Gelders,et al.  A microcomputer-based optimization model for the design of automated warehouses , 1985 .

[10]  Meir J. Rosenblatt,et al.  Internal Layout Design of a Warehouse , 1980 .

[11]  K. Srikantan.  A Problem in Optimum Allocation , 1963 .

[12]  Rene Victor Valqui Vidal,et al.  A Simple Method to Solve Some Simple Allocation Problems , 1987 .

[13]  Stephen C. Graves,et al.  Storage-Retrieval Interleaving in Automatic Warehousing Systems , 1977 .

[14]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[15]  Meir J. Rosenblatt,et al.  The dynamics of plant layout , 1986 .