IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-92944-4_9.html
   My bibliography  Save this book chapter

Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse

In: Innovations in Distribution Logistics

Author

Listed:
  • Yeming Gong

    (RSM Erasmus University)

  • René de Koster Gong

    (RSM Erasmus University)

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.

Suggested Citation

  • Yeming Gong & René de Koster Gong, 2009. "Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse," Lecture Notes in Economics and Mathematical Systems, in: Jo A.E.E. Nunen & M. Grazia Speranza & Luca Bertazzi (ed.), Innovations in Distribution Logistics, chapter 9, pages 175-194, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-92944-4_9
    DOI: 10.1007/978-3-540-92944-4_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnechp:978-3-540-92944-4_9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.