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

A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy

Author

Listed:
  • Gautam Choudhury
  • Kailash C. Madan

Abstract

We consider a batch arrival queue with a Bernoulli vacation bschedule, where, after completion of a service, the server either goes for a vacation of random length with probability θ(0 ≤ θ ≤ 1) or may continue to serve the next unit, if any, with probability (1−θ), under a Restricted Admissibility (RA) policy of arriving batches with a random Setup Time (SET). Unlike the usual batch arrival queueing system, the RA-policy differs during a busy period and a vacation period and hence all arriving batches are not allowed to join the system at all times. We derive the steady state queue size distributions at a random point of time as well as at a departure epoch. Also, we obtain some important performance measures of this model. Further, we demonstrate the existence of stochastic decomposition result for this type of model.

Suggested Citation

  • Gautam Choudhury & Kailash C. Madan, 2007. "A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 2(1), pages 81-97.
    • Handle: RePEc:ids:ijores:v:2:y:2007:i:1:p:81-97
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=11445
    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. K. Sikdar & S. K. Samanta, 2016. "Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server’s vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 553-583, September.

    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:2:y:2007:i:1:p:81-97. 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.