The static sequencing problem for randomized and class-based storage is believed to be NP-hard, and most algorithms for this problem use a nearest-neighbor heuristic or one of its variations Han rt al. (1987) proposed a match of a storage location with a retrieval location that has the minimum travel distance between them