Call Centers Optimization Library
V.2.

Package umontreal.iro.lecuyer.ccoptim.approx.mmc

This package implements the approximation formulas of Erlang A, B and C for the M/M/c queueing model.

See: Description

Package umontreal.iro.lecuyer.ccoptim.approx.mmc Description

This package implements the approximation formulas of Erlang A, B and C for the M/M/c queueing model. The model assumes a Poisson arrival process, exponential service time and exponential patience time. In a loss model, there are no waiting queue. In the delay model, a call can abandon if its waiting time is greater than its patience time. For the Erlang C formula, we can assume an infinite queue capacity (using the tractability of the formula) or a limited capacity. For the Erlang A formula, the user must give a limited capacity to the queue. The exact Erlang A formula can be numerically unstable for large queue with many servers. We have also implemented the approximation of the Erlang A formulas proposed by Garnett et al. (2002).
Call Centers Optimization Library
V.2.