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

M/M/1 queue with bi-level network process and bi-level vacation policy with balking

Author

Listed:
  • Anshul Kumar
  • Madhu Jain

Abstract

In this article, an M/M/1 queueing model with bi-level network service provider, balking process and bi-level vacation policy that comprises of working vacation and complete vacation after fixed service, is developed. Matrix form expressions have been derived for the distributions of the queued customers with some performance metrics with the help of matrix geometric method. The maximum entropy principle is also used to derive the distributions of the steady state probabilities of queue size. The cost function has been formed to optimize the decision variables of the system. We perform the cost optimization by employing the steepest descent search method. Numerical illustrations along with the sensitivity analysis have been drawn to validate the model. Finally, the conclusions of the investigation done are drawn by mentioning the novel features and future scope.

Suggested Citation

  • Anshul Kumar & Madhu Jain, 2023. "M/M/1 queue with bi-level network process and bi-level vacation policy with balking," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(15), pages 5502-5526, August.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:15:p:5502-5526
    DOI: 10.1080/03610926.2021.2012197
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.2012197
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.2012197?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:52:y:2023:i:15:p:5502-5526. 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.