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

Maximum likelihood and Bayesian estimation on M/M/1 queueing model with balking

Author

Listed:
  • Gulab Singh Bura
  • Himanshi Sharma

Abstract

In this article, a single-server Markovian queueing model with balking is closely considered. Balking refers to a particular behavior of an impatient customer. Upon arrival, if the queue is too long, a customer may join the queue or leave the system without getting served. If he decides not to join the queue and leaves the system without getting served, this phenomenon is called as balking. In this article, balking probability is treated as a function rather than a constant, which depends on the number of customers present in the system. The emphasis of this article will mainly be placed on maximum likelihood and Bayesian estimation of traffic intensity (ρ), average size of system (Ls), and average size of queue (Lq). In addition, a simulation study has also been performed to support our findings.

Suggested Citation

  • Gulab Singh Bura & Himanshi Sharma, 2024. "Maximum likelihood and Bayesian estimation on M/M/1 queueing model with balking," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(14), pages 5117-5145, April.
    • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:14:p:5117-5145
    DOI: 10.1080/03610926.2023.2208695
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2208695
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2023.2208695?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:14:p:5117-5145. 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.