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

An M [ X ] / G ( a , b )/1 queueing system with unreliable server, stand-by server, restricted arrivals and variant threshold policy for vacations

Author

Listed:
  • G. Ayyappan
  • S. Karpagam

Abstract

We studied the behaviour of an M[X]/G(a, b)/1 queueing system with unreliable server, stand-by server, restricted admissibility and variant threshold policy for vacations in this paper. The stand-by server is utilised only during main server's repair period. At the moment of main server's busy completion or repair completion, if the number of customers in the queue is less than 'a', the main server avails type-I vacation repeatedly until the queue length reaches at least 'a'. While getting back from vacation of type-I, if the queue has its length of value as at least 'a' then the server performs the type-II vacation continuously, until it reaches at least N(a < b ≤ N). When both types of vacation gets completed, and the length queue is at least 'N', then the server starts service to the batch of 'b' customers. The PGF of queue size and some important performance measures are derived. An extensive numerical result is illustrated.

Suggested Citation

  • G. Ayyappan & S. Karpagam, 2021. "An M [ X ] / G ( a , b )/1 queueing system with unreliable server, stand-by server, restricted arrivals and variant threshold policy for vacations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 41(3), pages 299-323.
    • Handle: RePEc:ids:ijores:v:41:y:2021:i:3:p:299-323
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=116253
    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:41:y:2021:i:3:p:299-323. 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.