Expected Travel Time and Class Layout for Class-based Automated Storage/Retrieval Systems

등급별 저장방식 자동창고에서의 평균 이동시간과 등급할당

We study n-class-based storage policy for an automated storage/retrieval system (AS/RS) and derive the closed form expressions of expected travel times under single command cycle. In order to confirm the correctness of the derivations, we consider both discrete and continuous storage racks, and show that the expressions for expected travel times of discrete rack converge to those of continuous one. We also derive the expected travel times when the coordinate locations for storages or retrievals are triangularly distributed and we try to solve class layout problem using the obtained results. Numerical examples are given in case of 3-class-based storage policy.