To read this content please select one of the options below:

A Fast Algorithm for Shelf Optimization

David P. Jacobs (Department of Management, Clemson University, USA)
John C. Peck (Department of Management, Clemson University, USA)
J. Steve Davis (Department of Management, Clemson University, USA (Corresponding author - Email: , Fax 864-656-2015))

Research Journal of Textile and Apparel

ISSN: 1560-6074

Article publication date: 1 May 2000



Performance of an automated storage and retrieval system such as a carousel depends upon the way it is loaded. Commonly a carousel will be loaded with cases of items that will be removed in groups. A group is a specified number of items of each type. For example, a group might constitute the collection of parts needed to manufacture one garment. Typically the storage system operator wants to retrieve as many groups as possible without running out of items of any type. We present a fast algorithm that prescribes how many cases of each item type should be loaded, yielding a maximal number of groups.



Jacobs, D.P., Peck, J.C. and Davis, J.S. (2000), "A Fast Algorithm for Shelf Optimization", Research Journal of Textile and Apparel, Vol. 4 No. 2, pp. 47-52.



Emerald Group Publishing Limited

Copyright © 2000 Emerald Group Publishing Limited

Related articles