A Multiserver Queueing System with Impatient Customers
AbstractMany real-world situations involve queueing systems in which customers wait for service for a limited time only and leave the system if service has not begun within that time. This paper considers a multiserver queueing system with impatient customers, where the customers arrive according to a Poisson process and the service requirements have a general distribution. A simple and insightful solution is presented for the loss probability. The solution is exact for exponential services and is an excellent heuristic for general service times.
Download InfoIf 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.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 45 (1999)
Issue (Month): 3 (March)
M/G/c queue; impatience; loss probability; heuristic;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Wang, Qinan, 2004. "Modeling and analysis of high risk patient queues," European Journal of Operational Research, Elsevier, vol. 155(2), pages 502-515, June.
- Slotnick, Susan A. & Sobel, Matthew J., 2005. "Manufacturing lead-time rules: Customer retention versus tardiness costs," European Journal of Operational Research, Elsevier, vol. 163(3), pages 825-856, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.