Note—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.