A queueing-inventory system with a repeated-orbit policy during the service.
Saved in:
| Title: | A queueing-inventory system with a repeated-orbit policy during the service. |
|---|---|
| Authors: | Hanukov, Gabi1 (AUTHOR) gabih@ariel.ac.il |
| Source: | Annals of Operations Research. Jan2025, Vol. 344 Issue 2, p877-909. 33p. |
| Subjects: | Matrix analytic methods, Industrial capacity, Orbits (Astronomy), Expected utility, Order picking systems |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| 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. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 02545330 |
| DOI: | 10.1007/s10479-023-05648-0 |
