In this paper, We determine the expected travel time for several forks Storage/Retrieval machine which is allowed multiple stops in aisle. When throughput is increased, We propose adding to fork number of each S/R machine rather than adding to number of S/R machine, We also describe such a model which determines the optimal number of each several forks S/R machine subject to constraints on the hourly throughput and warehouse dimensions. Numerical example is presented to compare warehouse shapes against each single fork, twin forks, triple forks S/R machine for various throughput values.