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

Analysis of MAP/M/1 queue with working breakdowns

Author

Listed:
  • Qingqing Ye
  • Liwei Liu

Abstract

In this paper, we analyze the MAP/M/1 queue with working breakdowns. The number of customers in the system in the steady state is obtained by the matrix geometric solution method. Then, several useful performance measures are provided. Furthermore, we show a recursive formula to obtain an approximation of stationary sojourn time. At last, we present several numerical examples.

Suggested Citation

  • Qingqing Ye & Liwei Liu, 2018. "Analysis of MAP/M/1 queue with working breakdowns," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(13), pages 3073-3084, July.
    • Handle: RePEc:taf:lstaxx:v:47:y:2018:i:13:p:3073-3084
    DOI: 10.1080/03610926.2017.1346808
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chakravarthy, Srinivas R. & Shruti, & Kulshrestha, Rakhee, 2020. "A queueing model with server breakdowns, repairs, vacations, and backup server," Operations Research Perspectives, Elsevier, vol. 7(C).
    2. Miaomiao Yu & Yinghui Tang, 2022. "Analysis of a renewal batch arrival queue with a fault-tolerant server using shift operator method," Operational Research, Springer, vol. 22(3), pages 2831-2858, July.

    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:47:y:2018:i:13:p:3073-3084. 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.