A note on a bulk arrivals quorum queuing system with an unreliable server
This paper considers a service system with bulk service and an unreliable server, generalising the work of Tadj and Choudhury [Applied Mathematics Letters, 22 (2009) 1710-1714]. While Tadj and Choudhury assume single arrivals, we allow arrivals to occur in bulk, which increases the analytical challenge. The first objective is to derive the probability generating function of the number of customers in the system at a service completion epoch and at an arbitrary instant of time as well as the performance characteristics of the system. The second objective is to develop an optimal management policy to obtain the optimal value of the parameter which minimises a suitable cost structure. This model is useful in different real-world operational management problems to minimise the organisation costs while keeping a high customer satisfaction level.
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): 3 ()
|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:3:p:316-325. 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.