IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v7y2010i2p240-256.html
   My bibliography  Save this article

Bernoulli schedule vacation queue with batch arrivals and random system breakdowns having general repair time distribution

Author

Listed:
  • Farzana A. Maraghi
  • Kailash C. Madan
  • Ken Darby-Dowman

Abstract

We analyse a single server queue with general service time distribution, random system breakdowns and Bernoulli schedule server vacations where after a service completion, the server may decide to leave the system with probability p, or to continue serving customers with probability 1−p. It is assumed that the customers arrive to the system in batches of variable size, but served one by one. If the system breaks down, it enters a repair process immediately. It is assumed that the repair time has general distribution, while the vacation time has exponential distribution. The purpose is to find the steady-state results in explicit and closed form in terms of the probability-generating functions for the number of customers in the queue, the average number of customers and the average waiting time in the queue. Some special cases of interest are discussed and a numerical illustration is provided.

Suggested Citation

  • Farzana A. Maraghi & Kailash C. Madan & Ken Darby-Dowman, 2010. "Bernoulli schedule vacation queue with batch arrivals and random system breakdowns having general repair time distribution," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(2), pages 240-256.
    • Handle: RePEc:ids:ijores:v:7:y:2010:i:2:p:240-256
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=30805
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. G. Ayyappan & S. Karpagam, 2018. "An M [ X ] / G ( a , b )/1 Queueing System with Breakdown and Repair, Stand-By Server, Multiple Vacation and Control Policy on Request for Re-Service," Mathematics, MDPI, vol. 6(6), pages 1-18, June.

    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:ids:ijores:v:7:y:2010:i:2:p:240-256. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.