On the M(n)/M(n)/s queue with impatient calls
Performance Evaluation
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System
Queueing Systems: Theory and Applications
A Multiserver Queueing System with Impatient Customers
Management Science
Engineering Solution of a Basic Call-Center Model
Management Science
Numerical Transform Inversion Using Gaussian Quadrature
Probability in the Engineering and Informational Sciences
On priority queues with impatient customers
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.