Efficiency-driven heavy-traffic approximations for many-server queues with abandonments

被引:87
|
作者
Whitt, W [1 ]
机构
[1] Columbia Univ, Dept Ind Engn & Operat Res, New York, NY 10027 USA
关键词
call centers; contact centers; queues; multiserver queues; queues with customer abandonment; multiserver queues with customer abandorunent; Erlang-A model heavy-traffic limits; many-server; heavy-traffic limits; efficiency-driven limiting regime;
D O I
10.1287/mnsc.1040.0279
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
To provide useful practical insight into the performance of service-oriented (non-revenue-generating) call centers, which often provide low-to-moderate quality of service, this paper investigates the efficiency-driven (ED), many-server heavy-traffic limiting regime for queues with abandonments. Attention is focused on the M/M/s/r + M model, having a Poisson arrival process, exponential service times, s servers, r extra waiting spaces, exponential abandon times (the final +M), and the first-come-first-served service discipline. Both the number of servers and the arrival rate are allowed to increase, while the individual service and abandonment rates are held fixed. The key is how the two limits are related: In the now common quality-and-efficiency-driven (QED) or Halfin-Whitt limiting regime, the probability of initially being delayed approaches a limit strictly between 0 and 1, while the probability of eventually being served (not abandoning) approaches 1. In contrast, in the ED limiting regime, the probability of eventually being served approaches a limit strictly between 0 and 1, while the probability of initially being delayed approaches 1. To obtain the ED regime, it suffices to let the arrival rate and the number of servers increase with the traffic intensity rho held fixed with p > 1 (so that the arrival rate exceeds the maximum possible service rate). The ED regime can be realistic because with the abandonments, the delays need not be extraordinarily large. When the ED appropriations are appropriate, they are appealing because they are remarkably simple.
引用
收藏
页码:1449 / 1461
页数:13
相关论文
共 50 条
  • [1] Validity of heavy-traffic steady-state approximations in many-server queues with abandonment
    J. G. Dai
    A. B. Dieker
    Xuefeng Gao
    [J]. Queueing Systems, 2014, 78 : 1 - 29
  • [2] Validity of heavy-traffic steady-state approximations in many-server queues with abandonment
    Dai, J. G.
    Dieker, A. B.
    Gao, Xuefeng
    [J]. QUEUEING SYSTEMS, 2014, 78 (01) : 1 - 29
  • [3] Heavy-traffic limits for many-server queues with service interruptions
    Pang, Guodong
    Whitt, Ward
    [J]. QUEUEING SYSTEMS, 2009, 61 (2-3) : 167 - 202
  • [4] Heavy-traffic limits for many-server queues with service interruptions
    Guodong Pang
    Ward Whitt
    [J]. Queueing Systems, 2009, 61 : 167 - 202
  • [5] HEAVY-TRAFFIC LIMITS FOR WAITING TIMES IN MANY-SERVER QUEUES WITH ABANDONMENT
    Talreja, Rishi
    Whitt, Ward
    [J]. ANNALS OF APPLIED PROBABILITY, 2009, 19 (06): : 2137 - 2175
  • [6] A NEW HEAVY-TRAFFIC LIMIT-THEOREM FOR MANY-SERVER QUEUES
    HALFIN, S
    WHITT, W
    [J]. ADVANCES IN APPLIED PROBABILITY, 1980, 12 (02) : 295 - 295
  • [7] Martingale proofs of many-server heavy-traffic limits for Markovian queues
    Pang, Guodong
    Talreja, Rishi
    Whitt, Ward
    [J]. PROBABILITY SURVEYS, 2007, 4 : 193 - 267
  • [8] ON MANY-SERVER QUEUES IN HEAVY TRAFFIC
    Puhalskii, Anatolii A.
    Reed, Josh E.
    [J]. ANNALS OF APPLIED PROBABILITY, 2010, 20 (01): : 129 - 195
  • [9] LIGHT TRAFFIC APPROXIMATIONS IN MANY-SERVER QUEUES
    DALEY, DJ
    ROLSKI, T
    [J]. ADVANCES IN APPLIED PROBABILITY, 1992, 24 (01) : 202 - 218
  • [10] MANY-SERVER HEAVY-TRAFFIC LIMIT FOR QUEUES WITH TIME-VARYING PARAMETERS
    Liu, Yunan
    Whitt, Ward
    [J]. ANNALS OF APPLIED PROBABILITY, 2014, 24 (01): : 378 - 421