Article ID: | iaor20082072 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 6 |
Start Page Number: | 1616 |
End Page Number: | 1645 |
Publication Date: | Jun 2007 |
Journal: | Computers and Operations Research |
Authors: | LEcuyer Pierre, Avramidis Athanassios N., Pichitlamken Juta, Ingolfsson Armann, Deslauriers Alexandre |
Keywords: | markov processes, simulation: applications |
Motivated by a Bell Canada call center operating in blend mode, we consider a system with two types of traffic and two types of agents. Outbound calls are served only by blend agents, whereas inbound calls can be served by either inbound-only or blend agents. Inbound callers may balk or abandon. There are several performance measures of interest, including the rate of outbound calls and the proportion of inbound calls waiting more than some fixed number of seconds. We present a collection of continuous-time Markov chain (CTMC) models which capture many real-world characteristics while maintaining parsimony that results in fast computation. We discuss and explore the tradeoffs between model fidelity and efficacy and compare our different CTMC models with a realistic simulation model of a Bell Canada call center, used as a benchmark.