Deriving the optimal boundaries for class-based automatic storage/retrieval systems

The optimal boundaries for class-based AS/RS systems are determined. A solution procedure is developed which requires only a one-dimensional search procedure. It is shown that most of the potential improvement in the expected one-way travel time can be obtained when the warehouse is divided into a relatively small number of regions. Thus, there is no need to use the full-turnover approach, which is difficult to implement.