IJPAM: Volume 97, No. 3 (2014)

WAITING TIME IN THE M/M/$m$ FCFS NONPREEMPTIVE
PRIORITY QUEUE WITH IMPATIENT CUSTOMERS

Hideaki Takagi
Faculty of Engineering, Information and Systems
University of Tsukuba
Tsukuba Science City, Ibaraki 305-8573, JAPAN


Abstract. As a possible model for a service center with multiple servers and prioritized impatient customers, we study an M/M/$m$ nonpreemptive priority (first-come, first-served within the same class) queueing system with impatient customers in the steady state. We analyze the waiting time for those customers who are served successfully and the time to abandonment for those customers who leave the system while waiting. Explicit formulas are given for the probabilities of service and abandonment as well as the mean and second moment of the waiting time for customers of each class. The distribution of the waiting time is derived only for customers of the highest priority class. Numerical examples are shown in order to demonstrate the feasibility of computation from theoretical formulas.

Received: June 28, 2014

AMS Subject Classification: 60K25, 68M20, 90B22

Key Words and Phrases: queue, waiting time, multiserver, nonpreemptive priority, impatient customers, abandonment

Download paper from here.




DOI: 10.12732/ijpam.v97i3.5 How to cite this paper?

Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2014
Volume: 97
Issue: 3
Pages: 311 - 344


$m$ FCFS NONPREEMPTIVE PRIORITY QUEUE WITH IMPATIENT CUSTOMERS%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; zbMATH; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).