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

Optimal repairable M x /G/1 queue with multi-optional services and Bernoulli vacation

Author

Listed:
  • Madhu Jain
  • Shweta Upadhyaya

Abstract

This article deals with the modified Bernoulli vacation schedule for the unreliable server batch arrival queueing system with essential and multi-optional services under N-policy. The server is subject to breakdown while rendering service to the customers. At the completion of service of the customer, the server has the option to take a vacation or to remain idle in the system waiting for the next customer to arrive. The server follows N-policy, i.e. the server will not initiate the service until the queue size reaches or exceeds N. All customers demand for the first 'essential' service whereas only some of them demand for other 'optional' services. After getting first essential service, the customer may demand for the second optional phase service with some probability; if the customer completes its second optional phase service, he may demand for the next optional phase services with some other probabilities and so on. We derive the system size distribution at random points and at departure points and other performance indices by employing generating function and supplementary variable techniques. By taking numerical illustration, the sensitivity analysis is also conducted to determine the effects of the system parameters on various performance measures.

Suggested Citation

  • Madhu Jain & Shweta Upadhyaya, 2010. "Optimal repairable M x /G/1 queue with multi-optional services and Bernoulli vacation," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(1), pages 109-132.
    • Handle: RePEc:ids:ijores:v:7:y:2010:i:1:p:109-132
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=29520
    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:7:y:2010:i:1:p:109-132. 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.