In this paper, we provide some fundamental properties and basic theoretical results of K-class-based dedicated storage policy in a unit load system assuming the constant-space assumption that the number of storage locations for a class is not the maximum aggregate inventory position for a class but the sum of space requirement for products assigned to the class. The main theorem is that there exists a (K+1) -class-based storage layout whose expexted single command (SC) travel time is not greater than that of a K-class-based storage layout, i.e, $E(SC^*_{K+1}){leq}E(SC^*_K);for;K=1,{cdots}$, (n-1).