Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse

DOI10.1007/978-3-540-92944-4_9zbMath1178.90094OpenAlexW1516997188MaRDI QIDQ5850935

René de Koster Gong, Yeming 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Travel time analysis for general item location assignment in a rectangular warehouse
• Feature Article: Optimization for simulation: Theory vs. Practice
• Efficient Design and Sensitivity Analysis of Control Charts Using Monte Carlo Simulation
• Generalized Dynamic Programming for Stochastic Combinatorial Optimization
• Infinitesimal Perturbation Analysis: A Tool for Simulation
• Convergence Properties of Infinitesimal Perturbation Analysis Estimates
• Sample Path Derivatives for (s, S) Inventory Systems
• Efficient orderbatching methods in warehouses
• Routing methods for warehouses with multiple cross aisles
• A Stochastic Approximation Method

This page was built for publication: Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse