IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04325530.html
   My bibliography  Save this paper

Performance estimation of a passing-crane automated storage and retrieval system

Author

Listed:
  • Wanying Amanda Chen

    (ZJSU - Zhejiang Gongshang University [Hangzhou])

  • Yeming Gong

    (EM - EMLyon Business School)

  • René de Koster

    (Erasmus University Rotterdam)

Abstract

Storage and retrieval automation has progressed rapidly. One such popular storage and retrieval system deploys two passing aisle-bound cranes. Each crane can access every location in the rack. To pass the other crane and prevent collision, each crane has to timely move the platform to an appropriate level and simultaneously rotate it. We develop a queuing model with preemptive-resume interrupted service to estimate the system response time (and hence throughput capacity) while considering two I/O point positions, random storage, and a crane assignment policy where all requests are shared between the cranes. The analytical models are validated with simulation based on the data from real cases. We find that a design with I/O points located in the middle of the rack will increase the interference, but it has a high relative throughput because of the reduced expected travel time. Compared with a system with one crane, a two-crane system has interference, but it can improve the system efficiency, especially in large systems with high job arrival rates. The model can be extended to other systems where multiple cranes are used in a single travel aisle with crane interference, e.g. passing cranes operating in a container stack lane.

Suggested Citation

  • Wanying Amanda Chen & Yeming Gong & René de Koster, 2022. "Performance estimation of a passing-crane automated storage and retrieval system," Post-Print hal-04325530, HAL.
    • Handle: RePEc:hal:journl:hal-04325530
    DOI: 10.1080/00207543.2020.1854886
    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:hal:journl:hal-04325530. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.