IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v344y2025i2d10.1007_s10479-023-05648-0.html
   My bibliography  Save this article

A queueing-inventory system with a repeated-orbit policy during the service

Author

Listed:
  • Gabi Hanukov

    (Ariel University)

Abstract

We consider a service system in which customers who arrive at a service station and place an order, are not involved in the processing of their order, which can therefore be executed in their absence. Consequently, customers may leave the service station for some period of time during the processing of their order (i.e., go to orbit), and then return. While the customers are in orbit, they can utilize their time efficiently. If the service is completed before the customer's return from orbit, the ready service (RS) is stored in a designated storage facility until the customer returns and retrieves the RS from the inventory. If, however, the service is not yet completed when the customer returns, the customer can leave to orbit again. Accordingly, the policy is called "repeated orbit" (during the service). We formulate and analyze the queueing-inventory-repeated-orbit (QIRO) system using the matrix geometric method. The optimal orbiting time is calculated by maximizing the customer's expected utility. In addition, the optimal RS storage capacity and the optimal investment in preservation technologies (to store the RSs) are derived, both of which serve to increase demand and thus maximize the system's expected profit.

Suggested Citation

  • Gabi Hanukov, 2025. "A queueing-inventory system with a repeated-orbit policy during the service," Annals of Operations Research, Springer, vol. 344(2), pages 877-909, January.
  • Handle: RePEc:spr:annopr:v:344:y:2025:i:2:d:10.1007_s10479-023-05648-0
    DOI: 10.1007/s10479-023-05648-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05648-0
    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-023-05648-0?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:344:y:2025:i:2:d:10.1007_s10479-023-05648-0. 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.