IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v350y2025i3d10.1007_s10479-025-06645-1.html
   My bibliography  Save this article

A queueing model for time-dependent rental systems with phase-type distributed rentals and substitutions of items

Author

Listed:
  • Anders Reenberg Andersen

    (Technical University of Denmark)

Abstract

Society currently experiences a growing interest in renting as an alternative to exclusive ownership (Fota et al., 2019; Yeganeh, 2021). This paper supports rental companies in this transition by providing a method to evaluate rental system occupancy. The method considers time-dependent systems in which customers rent substitutes during stockouts. Specifically, the paper provides a queueing model based on a continuous-time Markov chain for systems where rentals occur according to Poisson processes and rental times follow phase-type distributions. Additionally, the paper provides a heuristic optimization algorithm to minimize inventory capacity while maintaining an upper stockout probability limit. The paper evaluates these methods through numerical experiments, including a company case. The results indicate that the queueing model adequately reflects the occupancy distributions of the investigated items, and that the optimization algorithm minimizes the inventory capacity to near-optimality. In the company case, these methods reduce the inventory capacity while simultaneously improving the maximum stockout probability.

Suggested Citation

  • Anders Reenberg Andersen, 2025. "A queueing model for time-dependent rental systems with phase-type distributed rentals and substitutions of items," Annals of Operations Research, Springer, vol. 350(3), pages 1143-1167, July.
  • Handle: RePEc:spr:annopr:v:350:y:2025:i:3:d:10.1007_s10479-025-06645-1
    DOI: 10.1007/s10479-025-06645-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06645-1
    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-025-06645-1?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:annopr:v:350:y:2025:i:3:d:10.1007_s10479-025-06645-1. 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.