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

DOI10.1016/j.dam.2013.07.002zbMath1294.90032OpenAlexW2078638564MaRDI QIDQ2446876

Nils Boysen, Konrad Stephan

Publication date: 23 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.07.002

zbMATH Keywords

order pickingwarehousinglogisticsproduct location

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Related Items (3)

Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges ⋮ See the light: Optimization of put‐to‐light order picking systems ⋮ On an ordering problem in weighted hypergraphs

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• Research on warehouse operation: a comprehensive review
• Design and control of warehouse order picking: a literature review
• A survey of literature on automated storage and retrieval systems
• Research on warehouse design and performance evaluation: a comprehensive review
• Performance approximation of pick-to-belt orderpicking systems
• A Dynamic Programming Approach to Sequencing Problems
• Improving product location and order picking activities in a distribution centre
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: The deterministic product location problem under a pick-by-order policy