CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>of</strong> Operations Research, 108, 2002, 175–192.<br />
Abstract. Motivated by a problem facing the Police Communication Centre in Auckl<strong>and</strong>, New<br />
Zeal<strong>and</strong>, we consider the setting <strong>of</strong> staffing levels in a call centre with priority customers. The<br />
choice <strong>of</strong> staffing level over any particular time period (e.g., Monday from 8am–9am) relies on<br />
accurate arrival rate information. The usual method for identifying the arrival rate based on historical<br />
data can, in some cases, lead to considerable errors in performance estimates for a given<br />
staffing level. We explain why, identify three potential causes <strong>of</strong> the difficulty, <strong>and</strong> describe a<br />
method for detecting <strong>and</strong> addressing such a problem.<br />
112. Garnet, O., A. M<strong>and</strong>elbaum <strong>and</strong> M. Reiman. Designing a call center with impatient customers,<br />
Manufacturing & Service Operations Management, 4 (3), 2002, 208–227. Available<br />
at http://ie.technion.ac.il/serveng.<br />
Abstract. The most common model to support work force management <strong>of</strong> telephone call centers<br />
is the M/M/N/B model, in particular its special cases M/M/N (Erlang C, which models out<br />
busy-signals) <strong>and</strong> M/M/N/N (Erlang B, disallowing waiting). All <strong>of</strong> these models lack a central<br />
prevalent feature, namely that impatient customers might decide to leave (ab<strong>and</strong>on) before their<br />
service begins.<br />
In this paper we analyze the simplest ab<strong>and</strong>onment model, in which customers’ patience is exponentially<br />
distributed <strong>and</strong> the system’s waiting capacity is unlimited (M/M/N + M). Such a<br />
model is both rich <strong>and</strong> analyzable enough to provide information that is practically important<br />
for call center managers. We first outline a method for exact analysis <strong>of</strong> the M/M/N + M<br />
model, that while numerically tractable is not very insightful. We then proceed with an asymptotic<br />
analysis <strong>of</strong> the M/M/N + M model, in a regime that is appropriate for large call centers<br />
(many agents, high efficiency, high service level). Guided by the asymptotic behavior, we derive<br />
approximations for performance measures <strong>and</strong> propose “rules-<strong>of</strong>-thumb” for the design <strong>of</strong> large<br />
call centers. We thus add support to the growing acknowledgment that insights from diffusion<br />
approximations are directly applicable to management practice.<br />
113. Koole, Ger <strong>and</strong> A. M<strong>and</strong>elbaum. Queueing models <strong>of</strong> call centers: An introduction, Annals<br />
<strong>of</strong> Operations Research, 113, 2002, 41–59. Special volume dedicated to a selection <strong>of</strong> papers<br />
presented at the “First Madrid Conference on Queueing Theory” (MCQT ’02), July 2–5, 2002.<br />
Abstract. This is a survey <strong>of</strong> some academic research on telephone call centers. The surveyed<br />
research has its origin in, or is related to, queueing theory. Indeed, the “queueing-view” <strong>of</strong> call<br />
centers is both natural <strong>and</strong> useful. Accordingly, queueing models have served as prevalent st<strong>and</strong>ard<br />
support tools for call center management. However, the modern call center is a complex<br />
socio-technical system. It thus enjoys central features that challenge existing queueing theory<br />
to its limits, <strong>and</strong> beyond.<br />
114. M<strong>and</strong>elbaum, A., W.A. Massey, M.I. Reiman <strong>and</strong> B. Rider. Queue lengths <strong>and</strong> waiting times<br />
for multiserver queues with ab<strong>and</strong>onment <strong>and</strong> retrials, Telecommunication Systems, 21 (2–4),<br />
2002, 149–171.<br />
42