Approximations for the M/GI/N+GI type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.

[1]  Tayfur Altiok,et al.  Performance analysis of manufacturing systems , 1996 .

[2]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[3]  Henk C. Tijms,et al.  Approximations for the waiting time distribution of the M/G/c queue , 1982, Perform. Evaluation.

[4]  D. Daley.  General customer impatience in the queue GI/G/ 1 , 1965 .

[5]  Per Hokstad,et al.  Approximations for the M/G/m Queue , 1978, Oper. Res..

[6]  Nam Kyoo Boots,et al.  A Multiserver Queueing System with Impatient Customers , 1999 .

[7]  David L. Jagerman.  Difference equations with applications to queues , 2000 .

[8]  P. D. Finch.  Deterministic customer impatience in the queueing system GI/M/1 , 1960 .

[9]  Jacob Cohen,et al.  On up- and downcrossings , 1977, Journal of Applied Probability.

[10]  Whitt Ward,et al.  Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters , 2006 .

[11]  Rommert Dekker,et al.  Computing Compound Distributions Faster! , 1997 .

[12]  P. Iseger.  NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE , 2005, Probability in the Engineering and Informational Sciences.

[13]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[14]  Andreas Brandt,et al.  Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System , 2002, Queueing Syst. Theory Appl..

[15]  Avishai Mandelbaum,et al.  The impact of customers’ patience on delay and abandonment: some empirically-driven experiments with the M/M/n + G queue , 2004, OR Spectr..

[16]  Ward Whitt,et al.  Numerical Inversion of Laplace Transforms of Probability Distributions , 1995, INFORMS J. Comput..

[17]  H. Tijms,et al.  A queueing system with impatient customers , 1985 .

[18]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[19]  François Baccelli,et al.  ON QUEUES WITH IMPATIENT CUSTOMERS. , 1981 .

[20]  Ward Whitt,et al.  Engineering Solution of a Basic Call-Center Model , 2005, Manag. Sci..

[21]  Onno Boxma,et al.  Multiserver queues with impatient customers , 1993 .

[22]  D. Jagerman.  An inversion technique for the Laplace transform , 1982, The Bell System Technical Journal.

[23]  J. W. Cohen,et al.  On Level Crossings and Cycles in Dam Processes , 1977, Math. Oper. Res..

[24]  J. G. Shanthikumar.  On Level Crossing Analysis of Queues , 1981 .

[25]  B. Melamed,et al.  Models and Approximations for Call Center Design , 2003 .

[26]  Opher Baron,et al.  Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements , 2009, Oper. Res..

[27]  Percy H. Brill,et al.  An embedded level crossing technique for dams and queues , 1979, Journal of Applied Probability.

[28]  P. H. Brill,et al.  Level Crossings in Point Processes Applied to Queues: Single-Server Case , 1977, Oper. Res..

[29]  A. Federgruen,et al.  Approximations for the steady-state probabilities in the M/G/c queue , 1981, Advances in Applied Probability.

[30]  David Perry,et al.  Rejection rules in theM/G/1 queue , 1995, Queueing Syst. Theory Appl..

[31]  Andreas Brandt,et al.  On the M(n)/M(n)/s Queue with Impatient Calls , 1999, Perform. Evaluation.