IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v331y2023i2d10.1007_s10479-022-05107-2.html
   My bibliography  Save this article

Design of a class-based order picking system with stochastic demands and priority consideration

Author

Listed:
  • Jingming Liu

    (Hebei University of Technology)

  • Haitao Liao

    (University of Arkansas)

  • John A. White

    (University of Arkansas)

Abstract

An MIAPP-NALT system is an order picking system in which cases are picked at multiple in-the-aisle pick positions (MIAPP) and storage and retrieval operations are performed by a narrow aisle lift truck (NALT). In this paper, the operation of such a system involving three classes of stock keeping units with random demands for storage and retrieval operations is modeled as an M/G/1 queue, where “customers” are storage and retrieval requests, the “server” is the NALT, and retrieval requests have non-preemptive priority over storage requests. Our goal is to explore a methodology and solution method to obtain the optimal layout design of a class-based MIAPP-NALT system with stochastic demands and priority service. To this end, an operation time model of the system is developed and the first two moments for the operation time are derived. To overcome the challenge in finding the desired optimal layout, a near-optimal layout obtained via a heuristic approach is obtained at first and is improved afterwards. Based on the optimal layout, some valuable queueing results demonstrate the benefit of using a priority-based discipline. Moreover, some useful insights regarding the selection of dedicated versus random storage policies are obtained.

Suggested Citation

  • Jingming Liu & Haitao Liao & John A. White, 2023. "Design of a class-based order picking system with stochastic demands and priority consideration," Annals of Operations Research, Springer, vol. 331(2), pages 923-962, December.
  • Handle: RePEc:spr:annopr:v:331:y:2023:i:2:d:10.1007_s10479-022-05107-2
    DOI: 10.1007/s10479-022-05107-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05107-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-022-05107-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:annopr:v:331:y:2023:i:2:d:10.1007_s10479-022-05107-2. 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.