IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v3y2008i1-2p219-234.html
   My bibliography  Save this article

The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations

Author

Listed:
  • K. Sikdar
  • U.C. Gupta
  • R.K. Sharma

Abstract

Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-buffer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals, i.e. we consider a batch arrival single-server queue with renewal input and multiple exponential vacations. Using the imbedded Markov chain and supplementary variable techniques we obtain steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs. The Laplace-Stieltjes transforms of the actual waiting-time distribution of the first-, arbitrary- and last-customer of a batch under First-Come-First-Serve discipline have been derived. Finally, we present useful performance measures of interest such as probability of blocking, average queue (system) length. Some tables and graphs showing the effect of model parameters on key performance measures are presented.

Suggested Citation

  • K. Sikdar & U.C. Gupta & R.K. Sharma, 2008. "The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 3(1/2), pages 219-234.
  • Handle: RePEc:ids:ijores:v:3:y:2008:i:1/2:p:219-234
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=16162
    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:3:y:2008:i:1/2:p:219-234. 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.