Approximate optimal order batch sizes in a parallel aisle warehouse

DOI10.1007/978-3-540-92944-4_9MaRDI QIDQ5850935zbMATH OpenOpenAlexFDO

Authors Yeming (Yale) Gong, René de Koster Gong

Publication date 20 January 2010

Published in Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92944-4_9

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• A comparison of heuristics for the problem of batching orders for warehouse selection
• Order batching using an approximation for the distance travelled by pickers
• Efficient orderbatching methods in warehouses
• Parallel variable neighborhood search for the min-max order batching problem
• Travel time estimation and order batching in a 2-block warehouse

Cites work

• A Stochastic Approximation Method
• Convergence Properties of Infinitesimal Perturbation Analysis Estimates
• Efficient design and sensitivity analysis of control charts using Monte Carlo simulation
• Efficient orderbatching methods in warehouses
• Generalized Dynamic Programming for Stochastic Combinatorial Optimization
• scientific article; zbMATH DE number 996999 (Why is no real title available?)
• scientific article; zbMATH DE number 1002915 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 4099041 (Why is no real title available?)
• scientific article; zbMATH DE number 50675 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Infinitesimal Perturbation Analysis: A Tool for Simulation
• Optimization for simulation: theory vs. practice
• Routing methods for warehouses with multiple cross aisles
• Sample Path Derivatives for (s, S) Inventory Systems
• Travel time analysis for general item location assignment in a rectangular warehouse

Cited in

(2)

• Travel time estimation and order batching in a 2-block warehouse
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse

This page was built for publication: Approximate optimal order batch sizes in a parallel aisle warehouse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5850935)