CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
st<strong>and</strong>ing in the queue during their waiting period. Such circumstances apply, for example, in<br />
telephone centers or other remote service facilities, to which we refer as tele-queues. We analyze<br />
this decision model within a multi-server queue with impatient customers, <strong>and</strong> seek to characterize<br />
the Nash equilibria <strong>of</strong> this system. These equilibria may be viewed as stable operating points<br />
<strong>of</strong> the system, <strong>and</strong> determine the customer ab<strong>and</strong>onment pr<strong>of</strong>ile along with other system-wide<br />
performance measures. We provide conditions for the existence <strong>and</strong> uniqueness <strong>of</strong> the equilibrium,<br />
<strong>and</strong> suggest procedures for its computation. We also suggest a notion <strong>of</strong> an equilibrium<br />
based on sub-optimal decisions, the myopic equilibrium, which enjoys favorable analytical properties.<br />
Some concrete examples are provided to illustrate the modeling approach <strong>and</strong> analysis.<br />
The present paper supplements previous ones which were restricted to linear waiting costs or<br />
heterogeneous customer population.<br />
Keywords: Tele-queues or invisible queues, Ab<strong>and</strong>onment, Impatient customers, Nash equilibrium,<br />
Telephone call centers, Contact centers, Multi-server queues<br />
141. Shumsky, Robert A. Approximation <strong>and</strong> analysis <strong>of</strong> a call center with flexible <strong>and</strong> specialized<br />
servers, OR Spectrum, 26 (3), 2004, 307–330.<br />
Abstract. This paper describes a decomposition algorithm to estimate the performance <strong>of</strong> a<br />
call center with two types <strong>of</strong> customers <strong>and</strong> two server categories. In this system, specialized<br />
servers can process only one customer type, while flexible servers h<strong>and</strong>le both types. The algorithm<br />
divides the systems state space into regions, <strong>and</strong> simple approximate models find the<br />
conditional system performance within each region. While the procedure described here is tailored<br />
for a system with a priority queue discipline <strong>and</strong> two customer classes, it can be adapted<br />
for systems with FCFS queue disciplines <strong>and</strong> for systems with more than two customer types.<br />
Performance measures generated by the procedure are sufficiently accurate for many service system<br />
design decisions, such as setting telephone call center staffing levels <strong>and</strong> long-term capacity<br />
planning. The procedure is also extremely fast, <strong>and</strong> its computational requirements do not grow<br />
with system congestion. Numerical tests demonstrate that its running time is significantly lower<br />
than traditional numerical methods for generating approximations. As an example <strong>of</strong> its use, we<br />
employ the procedure to demonstrate the benefits <strong>of</strong> server flexibility in a particular telephone<br />
call center.<br />
Keywords: Servers, Call centers, Studies, Algorithms, Queueing<br />
142. Sisselman, Michael E. <strong>and</strong> Ward Whitt. Empowering customer-contact agents via preferencebased<br />
routing. SeatLink Working paper, 2004. Available at:<br />
.<br />
Abstract. SeatLink improves the overall performance <strong>of</strong> a contact center, by allowing agents<br />
to influence the routing <strong>of</strong> inbound interactions based on their personal preferences.<br />
143. Steckley, Samuel G., Shane G. Henderson <strong>and</strong> Vijay Mehrotra. Service system planning in the<br />
presence <strong>of</strong> a r<strong>and</strong>om arrival rate. Working paper, School <strong>of</strong> Operations Research <strong>and</strong> <strong>Industrial</strong><br />
<strong>Engineering</strong>, Cornell University, November 1, 2004.<br />
53