IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v53y2024i12p4407-4427.html
   My bibliography  Save this article

Stochastic decomposition in a queueing-inventory system with batch demands, randomized order policy and multiple vacations

Author

Listed:
  • Linhong Li
  • Liwei Liu
  • Wei Xu
  • Zhen Wang

Abstract

This article studied a queueing-inventory system with batch demands, randomized order policy, and multiple vacations. Customers arrive in this system according to a Poisson process and take away batch items after a service time. The system sends a replenishment order and starts multiple vacations simultaneously once the on-hand inventory level drops to zero. The replenishment is based on a random order size policy. Customers arriving during this period are assumed to be lost. Under the assumption that all the underlying random variables are exponential, the stationary joint probability is obtained in product form. Based on the stationary distribution, the expected sojourn time of a permitted entering customer is derived in recursive form. Several numerical examples are processed to analyze the effect of variant parameters on the performance measures. The numerical results show that the expected total cost function is a convex function with respect to the maximum allowable inventory. The influence of various parameters on the optimal value is also displayed visually.

Suggested Citation

  • Linhong Li & Liwei Liu & Wei Xu & Zhen Wang, 2024. "Stochastic decomposition in a queueing-inventory system with batch demands, randomized order policy and multiple vacations," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(12), pages 4407-4427, June.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:12:p:4407-4427
    DOI: 10.1080/03610926.2023.2179886
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2179886
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2023.2179886?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:lstaxx:v:53:y:2024:i:12:p:4407-4427. 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/lsta .

    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.