A Fast Algorithm for Shelf Optimization

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 collect...

Full description

Saved in:
Bibliographic Details
Published in:Research Journal of Textile and Apparel 2000-05, Vol.4 (2), p.47-52
Main Authors: Jacobs, David P., Peck, John C., Davis, J. Steve
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1560-6074
DOI:10.1108/RJTA-04-02-2000-B006