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

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 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 PACS PACS code1 · PACS code2 · more Mathematics Subject Classification (2000) 60K25 · 68M20 · 90B22

Peer-to-Peer Lending: a Growth-Collapse Model and its Steady-State Analysis

“…Just like for the latter equation, we attempt an iteration. This approach bears some similarity to the approach of Adan et al (2019) of the following recursion, with ψ(s) the unknown LST: ψ(s) = p 0 + 2 i=1 H i (s)ψ(s +θ i ); see also Adan et al (2022) where functional equations with multiple recursive terms are treated in more generality. To keep the overview in our somewhat complicated iteration, we introduce the following shorthand notation.…”

Functional equations with multiple recursive terms

“…In that case, the function f (z) represents the pgf of the steady-state distribution of the number of individuals and the function α(z) the pgf of the offspring distribution. If in all states except state 0 the pgf of the immigration distribution is given by g(z) while in the special state 0 the pgf of the immigration distribution is given by g 0 (z), then the function f (z) satisfies (1) with K (z) = f (0) (g 0 (z) − g(z)). Remark that in the special case that g 0 (z) = g(z), we have that K (z) = 0.…”

“…( 13) later on in this paper) which is obtained after iteration of Eq. (1). Branching processes with immigration appear for example in the analysis of the M/G/1 queue with (single or multiple) gated vacations (see Takagi [18], Sect.…”

“…In Adan et al [1], a specific example of (2) was analyzed in detail in the study of a queueing system with two classes of impatient customers. The main goal of the present paper is to give a general treatment of Eq.…”

Some Special Features of Finite-Source Retrial Queues with Collisions, an Unreliable Server and Impatient Customers in the Orbit

“…Impatience of the customers is a natural phenomenon and an interesting topic in queueing theory. The process of reneging and balking is extensively studied by many researchers, for example in [1][2][3][4][5][6][7][8][9][10]13,14,20,24]. Whenever an arriving customer decides not to enter the system, which is called balking while in reneging a customer in the system after waiting for some time leaves the system without being served.…”