IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v27y2025i3d10.1007_s11009-025-10184-4.html
   My bibliography  Save this article

Discrete-Time Geo/Geo/1 Queueing System Associated with (s, S) Inventory Policy

Author

Listed:
  • S. K. Samanta

    (National Institute of Technology Raipur)

  • A. Verma

    (National Institute of Technology Raipur)

Abstract

This paper investigates a discrete-time Geo/Geo/1 queueing-inventory system with (s,S) inventory policy. Assume that demand occurs to the system according to the Bernoulli process and every demand needs single item for service. The service time is assumed to be geometric distribution. An external vendor replenishes the items and the replenishment of items requires positive random time which follows geometric distribution. There are a limited number of places available for demands to wait. We obtain the joint probability distributions for the number of demands and the inventory position at the outside observer’s and random epochs. We compute the waiting time distribution for an arrival demand who are able to join the queue. Various performance measures are obtained to establish a suitable cost function for the system. Moreover, numerical experiments are used to highlight the minimum value of the cost function with respect to the optimal parameter values. We validate the accuracy of discrete-time results through a simulation study. It is demonstrated that the results from this paper tend toward their continuous-time counterpart in the limiting case.

Suggested Citation

  • S. K. Samanta & A. Verma, 2025. "Discrete-Time Geo/Geo/1 Queueing System Associated with (s, S) Inventory Policy," Methodology and Computing in Applied Probability, Springer, vol. 27(3), pages 1-28, September.
    • Handle: RePEc:spr:metcap:v:27:y:2025:i:3:d:10.1007_s11009-025-10184-4
    DOI: 10.1007/s11009-025-10184-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-025-10184-4
    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-025-10184-4?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:27:y:2025:i:3:d:10.1007_s11009-025-10184-4. 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.