A quorum queueing system with unreliable server and restricted admission
We consider in this paper a bulk service, or quorum, queueing system. The server is unreliable and may break down while providing service. The admission to the system is controlled and some arrivals may be denied admission. The queueing process is studied and relevant performance measures, such as the mean number of customers in the system, the mean duration of the idle period, busy period, and busy cycle, are obtained. These measures are then used to design an optimal management policy for the system where the optimal quorum size is sought. The effect of relevant system parameters on the optimal quorum size and optimal expected total cost per unit of time are shown in a numerical example.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 3 (2011)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=286|
When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:3:y:2011:i:2:p:174-185. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.