Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

被引:20
作者
Armony, Mor [1 ]
Mandelbaum, Avishai [2 ]
机构
[1] NYU, Stern Sch Business, New York, NY 10012 USA
[2] Technion Israel Inst Technol, Dept Ind Engn & Management, IL-32000 Haifa, Israel
关键词
CALL CENTER; ASYMPTOTIC ANALYSIS; MULTISERVER QUEUES; QUEUING SYSTEM; APPROXIMATIONS; ABANDONMENTS; CENTERS; DESIGN; LIMITS;
D O I
10.1287/opre.1100.0878
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Motivated by call centers, we study large-scale service systems with homogeneous impatient customers and heterogeneous servers; the servers differ with respect to their speed of service. For this model, we propose staffing and routing rules that are jointly asymptotically optimal in the heavy-traffic many-server QED, ED, and ED + QED regimes, respectively. For the QED regime, our proposed routing rule is FSF, that assigns customers to the fastest server available first. In the ED and ED + QED regimes, all work-conserving policies perform (asymptotically) equally well. In all these regimes, the form of the asymptotically optimal staffing is consistent with the asymptotically optimal staffing in the same regimes in the single-pool case, respectively. In particular, the total service capacity is (asymptotically) equal to a term that is proportional to the arrival rate plus, possibly, a term that is proportional to the square-root of the arrival rate, with both terms being regime dependent. Our specific proposed approximation for the optimal staffing vector is obtained via a straightforward solution to a deterministic optimization problem subject to a linear feasible region.
引用
收藏
页码:50 / 65
页数:16
相关论文
共 43 条
[1]  
Aksin ZN, 2007, PROD OPER MANAG, V16, P665, DOI 10.1111/j.1937-5956.2007.tb00288.x
[2]   Dynamic routing in large-scale service systems with heterogeneous servers [J].
Armony, M .
QUEUEING SYSTEMS, 2005, 51 (3-4) :287-329
[3]   Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems [J].
Armony, Mor ;
Ward, Amy R. .
OPERATIONS RESEARCH, 2010, 58 (03) :624-637
[4]  
ATAR R, 2011, QUEUEING SY IN PRESS
[5]   Central limit theorem for a many-server queue with random service rates [J].
Atar, Rami .
ANNALS OF APPLIED PROBABILITY, 2008, 18 (04) :1548-1568
[6]   The cμ/θ Rule for Many-Server Queues with Abandonment [J].
Atar, Rami ;
Giat, Chanit ;
Shimkin, Nahum .
OPERATIONS RESEARCH, 2010, 58 (05) :1427-1439
[7]   Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times [J].
Atar, Rami ;
Shwartz, Adam .
MATHEMATICS OF OPERATIONS RESEARCH, 2008, 33 (04) :899-909
[8]   Simplified Control Problems for Multiclass Many-Server Queueing Systems [J].
Atar, Rami ;
Mandelbaum, Avi ;
Shaikhet, Gennady .
MATHEMATICS OF OPERATIONS RESEARCH, 2009, 34 (04) :795-812
[9]   Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements [J].
Baron, Opher ;
Milner, Joseph .
OPERATIONS RESEARCH, 2009, 57 (03) :685-700
[10]   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