A shift-based sequencing method for twin-shuttle automated storage and retrieval systems

Abstract

The continuing need for high-throughput Automated Storage and Retrieval Systems (AS/RS) has lead to the introduction of storage/retrieval machines that can carry more than one unit-load. However, this technology involves a large capital investment so careful operating methods are desired to make the most of its capabilities. In this paper, we study a shift-based sequencing problem for twin-shuttle AS/RS, where depletion (retrieval operations) and replenishment (storage operations) of items occur over different shifts. For example, certain warehouses or distribution depots deplete their items in stock during morning shifts and replenish during later shifts. We show that this problem can be transformed into the minimum-cost perfect matching problem and present an efficient polynomial-time optimum method that can achieve a large throughput gain over other methods. We also provide average-case and lower bound analyses for this problem.