Retrieval Time Performance in Puzzle-Based Storage Systems

摘要

One manifestation of very high density storage systems is the so-called 'puzzle-based' system, in which unit loads are moved through the system by manipulating the location of empty (escort) locations to retrieve desired items. Previous research has focused on the analytical determination of retrieval time when one or more escorts are initially located near the system input/output location, and on simulation results for more complex situations. Herein, the analytical results are extended to determine retrieval time performance when escorts are randomly placed within the system, and an integer programming formulation is offered to find retrieval time for general cases with multiple escorts.