Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse

Yeming Gong () and René de Koster Gong ()
Additional contact information
Yeming Gong: RSM Erasmus University
René de Koster Gong: RSM Erasmus University

Chapter 9 in Innovations in Distribution Logistics, 2009, pp 175-194 from Springer

Abstract: Summary The past warehousing literature dealing with order picking and batching assumes batch sizes are given. However, selecting a suitable batch size can significantly enhance the system performance. This paper is one of the earliest to search optimal batch sizes in a general parallel-aisle warehouse with stochastic order arrivals.We employ a sample path optimization and perturbation analysis algorithm to search the optimal batch size for a warehousing service provider facing a stochastic demand, and a central finite difference algorithm to search the optimal batch sizes from the perspectives of customers and total systems.We show the existence of optimal batch sizes, and find past researches underestimate the optimal batch size.

Keywords: Batch Size; Perturbation Analysis; Throughput Time; Order Batch; Total Service Time (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-92944-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9783540929444

DOI: 10.1007/978-3-540-92944-4_9

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().