IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v26y2024i1d10.1007_s11009-023-10071-w.html
   My bibliography  Save this article

Queueing Inventory System with Multiple Service Nodes and Addressed Retrials from a Common Orbit

Author

Listed:
  • Rasmi K

    (National Institute of Technology Calicut)

  • Jacob M J

    (National Institute of Technology Calicut)

  • Alexander Dudin

    (Belarusian State University)

  • A. Krishnamoorthy

    (Department of Mathematics, CMS College
    Central University of Kerala)

Abstract

In this paper, we consider a queueing inventory model with K service nodes located apart making it impossible to know the status of the other service nodes. The primary arrival of customers follows Marked Markovian Arrival Process and the service times are exponentially distributed. If a customer arriving at a node finds the server busy or the inventory level to be zero, he joins a common orbit with infinite capacity. An orbital customer shall choose a service node at random according to some predetermined probability distribution dependent on the orbit size. Each service node is assigned with a continuous review inventory replenished according to an (s, S) policy with lead time. This scenario is modeled as a level dependent quasi birth and death process which belongs to the class of asymptotically quasi-Teoplitz Markov chains. Steady-state probabilities and some important performance measures are obtained. A cost function is introduced and employed for computing the optimal values of reorder levels and replenishment rates.

Suggested Citation

  • Rasmi K & Jacob M J & Alexander Dudin & A. Krishnamoorthy, 2024. "Queueing Inventory System with Multiple Service Nodes and Addressed Retrials from a Common Orbit," Methodology and Computing in Applied Probability, Springer, vol. 26(1), pages 1-15, March.
    • Handle: RePEc:spr:metcap:v:26:y:2024:i:1:d:10.1007_s11009-023-10071-w
    DOI: 10.1007/s11009-023-10071-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-023-10071-w
    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/s11009-023-10071-w?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:metcap:v:26:y:2024:i:1:d:10.1007_s11009-023-10071-w. 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.