The deterministic product location problem under a pick-by-order policy

Authors:
Nils Boysen;Konrad Stephan
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 3
Cited 0

Correlated assignment strategy can improve any order-picking operation

Industrial Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A branch-and-bound algorithm for the single-row equidistant facility layout problem

OR Spectrum

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper treats the product location problem in warehouses, i.e., stock keeping units (SKUs) are to be assigned to storage positions in order to minimize the resulting picking effort when retrieving SKUs in a pick-by-order environment. We restrict our view on warehouses having a single cross aisle and show that already very simple layouts consisting of only a single rack lead to NP-hard optimization problems. In addition to a complexity analysis for different layouts, elementary solution procedures are introduced and tested. Finally, we investigate the robustness of our deterministic problem when facing erroneous input data.