Task scheduling in a full roaming shuttle system

I.J.B.F. Adan, M.P.O.J. Gootzen, Jorine W.E. Heling, Bruno van Wijngaarden

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
3 Downloads (Pure)

Abstract

A new concept in automated storage and retrieval systems is the full roaming shuttle system, the distinguishing feature of which is that its material handling shuttles are not aisle-captive, but can easily switch aisles and levels in the storage area. A consequence of this flexibility is that shuttles more often overtake each other and deliver product totes in a different sequence than they are requested. In case of strict sequence requirements for delivered totes, this leads to more waiting time of shuttles and thus to loss of throughput capacity. In this paper we propose heuristics to assign tasks to shuttles that aim at minimizing the number of out-of-sequence occurrences and at maximizing the throughput capacity. These heuristics are evaluated through simulation. The results suggest that, in comparison to first-in first-out task assignment, substantial throughput improvement can be achieved by employing smart task assignment heuristics.
Original languageEnglish
Title of host publicationWSC '16, Proceedings of the 2016 Winter Simulation Conference, 11-14 December 2016, Washington D.C.
EditorsT.M.K. Roeder, P.I. Frazier, R. Szechtman, E. Zhou, T. Huschka, S.E. Chick
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages2844-2854
Number of pages11
ISBN (Electronic)978-1-5090-4486-3
ISBN (Print)978-1-5090-4487-0
DOIs
Publication statusPublished - 2016

Fingerprint

Dive into the research topics of 'Task scheduling in a full roaming shuttle system'. Together they form a unique fingerprint.

Cite this