Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach

被引:70
作者
Gurvich, Itai [1 ]
Luedtke, James [2 ]
Tezcan, Tolga [3 ]
机构
[1] Northwestern Univ, Kellogg Sch Management, Evanston, IL 60208 USA
[2] Univ Wisconsin, Madison, WI 53706 USA
[3] Univ Illinois, Urbana, IL 61801 USA
关键词
call centers; chance-constrained optimization; queueing; SERVICE-LEVEL DIFFERENTIATION; DISCRETE-DISTRIBUTIONS; TIME-SERIES; SYSTEMS;
D O I
10.1287/mnsc.1100.1173
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of staffing call centers with multiple customer classes and agent types operating under quality-of-service (QoS) constraints and demand rate uncertainty. We introduce a formulation of the staffing problem that requires that the QoS constraints are met with high probability with respect to the uncertainty in the demand rate. We contrast this chance-constrained formulation with the average-performance constraints that have been used so far in the literature. We then propose a two-step solution for the staffing problem under chance constraints. In the first step, we introduce a random static planning problem (RSPP) and discuss how it can be solved using two different methods. The RSPP provides us with a first-order (or fluid) approximation for the true optimal staffing levels and a staffing frontier. In the second step, we solve a finite number of staffing problems with known arrival rates-the arrival rates on the optimal staffing frontier. Hence, our formulation and solution approach has the important property that it translates the problem with uncertain demand rates to one with known arrival rates. The output of our procedure is a solution that is feasible with respect to the chance constraint and nearly optimal for large call centers.
引用
收藏
页码:1093 / 1115
页数:23
相关论文
共 47 条
[1]  
AKSIN Z, 2008, PRODUCTION OPER MANA, V16, P655
[2]  
[Anonymous], 2009, Lectures on stochastic programming: modeling and theory
[3]   Dynamic routing in large-scale service systems with heterogeneous servers [J].
Armony, M .
QUEUEING SYSTEMS, 2005, 51 (3-4) :287-329
[4]  
ARMONY M, 2010, OPER RES IN PRESS
[5]   Optimizing call center staffing using simulation and analytic center cutting-plane methods [J].
Atlason, Julius ;
Epelman, Marina A. ;
Henderson, Shane G. .
MANAGEMENT SCIENCE, 2008, 54 (02) :295-309
[6]   Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits [J].
Bassamboo, A ;
Harrison, JM ;
Zeevi, A .
QUEUEING SYSTEMS, 2005, 51 (3-4) :249-285
[7]  
Bassamboo A., 2008, STAFFING TELEPHONE C
[8]  
BASSAMBOO A, 2008, CAPACITY PLANNING SE
[9]   Design and control of a large call center: Asymptotic analysis of an LP-based method [J].
Bassamboo, Achal ;
Harrison, J. Michael ;
Zeevi, Assaf .
OPERATIONS RESEARCH, 2006, 54 (03) :419-435
[10]  
BERTSIMAS D, 2009, DATA DRIVEN ROBUST O