Class-based storage allocation in a single command warehouse with space requirement constraints
Year: 1996
Type: article
Abstract: In this paper we consider the class-based storage allocation problem. Class-based storage implies that the storage locations are distributed among a number of classes and products are allocated to the classes based on their turnover. We assume that the storages and retrievals are performed in single command cycles only. We present an efficient dynamic programming algorithm that finds a class allocation that minimizes the mean single command cycle time. The algorithm may be applied to a wide variety of warehousing systems, since it holds for any demand curve, any travel time metric, any warehouse layout and any positions of the input station and output station. The algorithm simultaneously determines the required storage space by imposing a risk-level on stock overflow.
Author: J.P. van den Berg
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2743069077