IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v62y2025i4d10.1007_s12597-024-00877-8.html
   My bibliography  Save this article

A new admission control scheme in queueing-inventory system with two priority classes of demands

Author

Listed:
  • Srinivas Chakravarthy

    (Kettering University)

  • Agassi Melikov

    (Baku Engineering University)

Abstract

Queueing-inventory system (QIS) plays an important role in practice. Here, such a system with two types of demands needing servicing with inventory items is studied. Both the demands share a common waiting space if the services cannot be offered immediately. We look at both finite and infinite waiting spaces. While Type 2 demands are admitted as long as the requirement of at least one waiting space and at least one inventory is met; however, Type 1 demands are admitted under an admission control scheme involving a threshold. Under the assumptions of an all-around point process to describe the demands, exponential processing and exponential replenishment times, and with an $$(s, S)-$$ ( s , S ) - type inventory policy, we analyze the QIS. Representative numerical examples are discussed.

Suggested Citation

  • Srinivas Chakravarthy & Agassi Melikov, 2025. "A new admission control scheme in queueing-inventory system with two priority classes of demands," OPSEARCH, Springer;Operational Research Society of India, vol. 62(4), pages 2076-2109, December.
    • Handle: RePEc:spr:opsear:v:62:y:2025:i:4:d:10.1007_s12597-024-00877-8
    DOI: 10.1007/s12597-024-00877-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00877-8
    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/s12597-024-00877-8?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:spr:opsear:v:62:y:2025:i:4:d:10.1007_s12597-024-00877-8. 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.