In this paper, we develop procedures for dividing rectangular warehous
es into classes. We describe three types of classes and develop their
corresponding traveling time models. A solution procedure involving a
one-dimensional (or at most two-dimensional) search is developed. We s
how that the one-dimensional search procedure is very effective in sol
ving most practical problems. Additionally, we show that most of the s
avings obtained by a full-turnover policy can be obtained with a relat
ively few classes-a result similar to the one obtained for the square
AS/RS.