Approximate optimal order batch sizes in a parallel-aisle warehouse

Yeming Gong*, René de Koster

*Corresponding author for this work

Research output: Chapter/Conference proceedingChapterAcademic

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.

Original languageEnglish
Title of host publicationInnovations in Distribution Logistics
Editors[email protected] van Nunen, M. Grazia Speranza, Luca Bertazzi
Pages175-194
Number of pages20
DOIs
Publication statusPublished - 2010

Publication series

SeriesLecture Notes in Economics and Mathematical Systems
Volume619
ISSN0075-8442

Fingerprint

Dive into the research topics of 'Approximate optimal order batch sizes in a parallel-aisle warehouse'. Together they form a unique fingerprint.

Cite this