Optimal scheduling in call centers with a callback option

Abstract

International audienceWe consider a call center model with a callback option, which allows to transform an inbound call into an outbound one. A delayed call, with a long anticipated waiting time, receives the option to be called back. We assume a probabilistic customer reaction to the callback offer (option). The objective of the system manager is to characterize the optimal call scheduling that minimizes the expected waiting and abandonment costs. For the single-server case, we prove that non-idling is optimal. Using a Markov decision process approach, we prove for the two-server case that a threshold policy on the number of queued outbound calls is optimal. For the multi-server case, we numerically characterize a switching curve of the number of agents reserved for inbound calls. It is a function of the number of queued outbound calls, the number of busy agents and the identity of jobs in service. We also develop a Markov chain method to evaluate the system performance measures under the optimal policy. We next conduct a numerical study to examine the impact of the policy parameters on the system performance. We observe that the value of the callback offer is especially important for congested situations. It also appears that the benefits of a reservation policy are more apparent in large call centers, while they almost disappear in the extreme situations of light or heavy workloads. We moreover observe in most cases that the callback offer should be given upon arrival to any delayed call. However, if balking and abandonment are very high (which helps to reduce the workload) or if the overall treatment time spent to serve an outbound call is too large compared to that of an inbound one, there is a value in delaying the proposition of the callback offer

Stationary analysis of a single queue with remaining service time-dependent arrivals

“…is the 0 increment probability of the embedded Markov chain N , given in (10). That for some c > 0 where q is the stationary measure given in (13). In particular, Integration by parts on the first integral gives:…”

“…Then, under the stability condition (14), q(0) can be chosen so that ∞ i=0 q(i) = 1. and, with this choice, q will be the unique stationary measure of the process N . To determine the value of q(0) for which q is a proper probability measure, following [16, page 239], one sums both sides of (13)…”

“…Modern call centers call out customers to connect them with a server even when all servers are busy [17]; the decision to initiate an outbound call can use estimates of the remaining service time of the busy servers. New approaches to call center modeling also allow the control of the arrival process of inbound calls by postponing their routing to an agent or by giving incentives to callback later [13]; such approaches can make use of estimates of the remaining service time of servers. Generalizations of the rM/G/1 model may be useful in the analysis of these systems.…”

An Overview for Markov Decision Processes in Queues and Networks

“…Browne and Yechiali [48], Gandhi and Cassandras [131], Koole and Nain [195] and Gaujal et al [136]. Koole [194], Bhulai [37], Legros et al [214], Gans et al [132] and Koole and Mandelbaum [191].…”

Bir çağrı merkezindeki bekleme sürelerinin kuyruk modelleri ile iyileştirilmesi

“…Legros vd. [11], gelen aramayı giden çağrıya dönüştürme olanağı sağlayan bir geri arama seçeneği olan bir çağrı merkezi modeli için sistemin performansını değerlendiren bir markov zinciri metodu geliştirmişlerdir. Ramasamy vd.…”