Throughput bounds for miniload automated storage/retrieval systems

Throughput bounds for miniload automated storage/retrieval systems

To compute miniload system throughput, the distribution of the pick times is needed. Unfortunately, during the design phase, only partial information may be available such as the mean pick time. In this paper, we determine tight upper and lower bounds on throughput for several different types of par...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IIE transactions 2002-10, Vol.34 (10), p.915-920
Hauptverfasser: FOLEY, ROBERT D., FRAZELLE, EDWARD H., PARK, BYUNG CHUN
Format: Artikel
Sprache:eng
Schlagworte:
Automated storage retrieval systems
Automation
Design
Industrial engineering
Inventory control
Logistics
Materials handling
Mathematical models
Order picking
Random variables
Studies
Systems engineering
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To compute miniload system throughput, the distribution of the pick times is needed. Unfortunately, during the design phase, only partial information may be available such as the mean pick time. In this paper, we determine tight upper and lower bounds on throughput for several different types of partial information. We also give numerical examples to show how to apply the bounds.
ISSN:0740-817X
2472-5854
1545-8830
2472-5862
DOI:10.1080/07408170208928922