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

Steady state analysis of a non-Markovian bulk queue with restricted vacations

Author

Listed:
  • S. Jeyakumar
  • R. Arumuganathan

Abstract

A MX/G(a, b)/1 queueing system with restricted number of vacations is considered here. After completing a bulk service, if the queue size is less than 'a' then the server leaves for a vacation of random length. When he returns from a vacation, if queue length is still less than 'a', he avails another vacation and so on until he completes M number of vacations in successions or he finds at least 'a' customers wait for service. After M vacations, if the queue size is less than 'a' then the server will remain in the system until he finds 'a' customers in the queue. After a vacation or service completion if the server finds at least 'a' customers waiting for service then the server serves according to Neut's bulk service rule. The probability generating function of queue size at an arbitrary time and some important system performance measures are obtained. Cost model is discussed with numerical illustration.

Suggested Citation

  • S. Jeyakumar & R. Arumuganathan, 2011. "Steady state analysis of a non-Markovian bulk queue with restricted vacations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 10(3), pages 307-332.
    • Handle: RePEc:ids:ijores:v:10:y:2011:i:3:p:307-332
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=38904
    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.

    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:10:y:2011:i:3:p:307-332. 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.