Retrieval Strategies for a Carousel Conveyor

Abstract

We analyze algorithms that sequence the retrieval of items from a carousel conveyor, and show how the appropriate algorithm depends on the load to which the carousel is subjected. In general, as the load increases, so does the quality of solutions produced by simple heuristics. We conclude by recommending certain greedy heuristics for the problems of sequencing the retrieval of orders and for sequencing the retrieval of the items within each order.