On first-come, first-served queues with two classes of impatient customers

Ivo Adan (), Brett Hathaway () and Vidyadhar G. Kulkarni ()
Additional contact information
Ivo Adan: Eindhoven University of Technology
Brett Hathaway: University of North Carolina at Chapel Hill
Vidyadhar G. Kulkarni: University of North Carolina at Chapel Hill

Queueing Systems: Theory and Applications, 2019, vol. 91, issue 1, No 5, 113-142

Abstract: Abstract We study systems with two classes of impatient customers who differ across the classes in their distribution of service times and patience times. The customers are served on a first-come, first-served basis (FCFS) regardless of their class. Such systems are common in customer call centers, which often segment their arrivals into classes of callers whose requests differ in their complexity and criticality. We first consider an M/G/1 + M queue and then analyze the M/M/k + M case. Analyzing these systems using a queue length process proves intractable as it would require us to keep track of the class of each customer at each position in the queue. Consequently, we introduce a virtual waiting time process where the service times of customers who will eventually abandon the system are not considered. We analyze this process to obtain performance measures such as the percentage of customers receiving service in each class, the expected waiting times of customers in each class, and the average number of customers waiting in queue. We use our characterization to perform a numerical analysis of the M/M/k + M system and find several managerial implications of administering a FCFS system with multiple classes of impatient customers. Finally, we compare the performance a system based on data from a call center with the steady-state performance measures of a comparable M/M/k + M system. We find that the performance measures of the M/M/k + M system serve as good approximations of the system based on real data.

Keywords: Call centers; Impatient customers; Virtual queueing time process; M/M/k + M queue; M/G/1 + M queue; 60K25; 68M20; 90B22 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-018-9592-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:91:y:2019:i:1:d:10.1007_s11134-018-9592-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-018-9592-z

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().