Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 46, Issue 8, Pages 2215-2228Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540601118462
Keywords
randomized storage; closest open location; load dispatching; automated storage and retrieval systems
Ask authors/readers for more resources
A heuristic method is proposed for estimating travel times in unit load random storage systems where incoming loads are dispatched to the closest available storage positions. A queuing model representation is used where servers correspond to storage positions and the service rate is based on the turnover distribution of stored loads. The resultant state distribution is applied to approximate storage position occupancy probabilities useful for generating storage and retrieval travel time estimates. Computational results suggest that the heuristic procedure yields smaller errors in random storage travel time estimates than alternative models.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available