A quorum queueing system with unreliable server and restricted admission
Abstract
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.Download Info
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.
Bibliographic Info
Article provided by Inderscience Enterprises Ltd in its journal International Journal of Applied Management Science.
Volume (Year): 3 (2011)
Issue (Month): 2 (January)
Pages: 174-185
Contact details of provider:
Web page: http://inderscience.metapress.com/link.asp?target=journal&id=121170
Related research
Keywords: bulk service queueing; quorum size; unreliable servers; breakdown; restricted admission; optimal management policy;References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:3:y:2011:i:2:p:174-185For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ian Winship) or (Christopher F. Baum).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.