IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i7p2606-2639.html
   My bibliography  Save this article

Travel time model for multiple-deep shuttle-based storage and retrieval systems

Author

Listed:
  • Nenad Kosanić
  • Jakob Marolt
  • Nenad Zrnić
  • Tone Lerher

Abstract

The paper presents an analytical model for travel time evaluation in double-deep, triple-deep, quadruple-deep and fivefold-deep tier-captive shuttle-based storage and retrieval system (SBS/RS). Under the assumption of the deepest location rule for the storage process and the nearest neighbour rule for the retrieval process, the expressions for single-command and dual-command cycle times of the shuttle vehicle and elevator are developed, from which the SBS/RS performance can be estimated. The model based on the probability theory enables the evaluation of all individual times that make up the cycle times and assessment of the average number of totes relocated during a retrieval process. Special attention is devoted to the modelling of the relocation of totes which block access to the requested tote during the retrieval process. The validity of the analytical model is examined via the developed simulation model. The given case study shows that the proposed analytical travel time model results match the results of the simulation model. The presented modelling strategy could be applied to bigger system racking depths following the same modelling logic.

Suggested Citation

  • Nenad Kosanić & Jakob Marolt & Nenad Zrnić & Tone Lerher, 2024. "Travel time model for multiple-deep shuttle-based storage and retrieval systems," International Journal of Production Research, Taylor & Francis Journals, vol. 62(7), pages 2606-2639, April.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:7:p:2606-2639
    DOI: 10.1080/00207543.2023.2221750
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2221750
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2221750?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:62:y:2024:i:7:p:2606-2639. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.