Solving the forward-reserve allocation problem in warehouse order picking systems
From MaRDI portal
Publication:4933628
DOI10.1057/jors.2009.39zbMath1196.90065OpenAlexW2049052342MaRDI QIDQ4933628
Goetschalckx, Marc, Leon F. McGinnis, Jinxiang Gu
Publication date: 14 October 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.39
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Case-oriented studies in operations research (90B90)
Related Items (6)
Scheduling the replenishment of just-in-time supermarkets in assembly plants ⋮ Prioritizing replenishments of the piece picking area ⋮ Inventory routing in a warehouse: the storage replenishment routing problem ⋮ Order Picking with Heterogeneous Technologies: An Integrated Article-to-Device Assignment and Manpower Allocation Problem ⋮ Part logistics in the automotive industry: decision problems, literature review and research agenda ⋮ The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
This page was built for publication: Solving the forward-reserve allocation problem in warehouse order picking systems
