The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking

DOI10.1016/j.ejor.2013.02.047zbMath1317.90168OpenAlexW1966960619MaRDI QIDQ2355889

Rico Walter, Nils Boysen, Armin Scholl

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.02.047

zbMATH Keywords

assignmentorder pickingwarehousinglogisticsforward-reserve problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (5)

Scheduling the replenishment of just-in-time supermarkets in assembly plants ⋮ Ergonomic workplace design in the fast pick area ⋮ A computational software system to design order picking warehouses ⋮ 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

Cites Work

• Exact methods for the knapsack problem and its generalizations
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Forward-reserve allocation in a warehouse with unit-load replenishments
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• Solving the forward-reserve allocation problem in warehouse order picking systems
• Reducibility among Combinatorial Problems
• Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities
• Technical Note—Comment on an Integer Maximization Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking