Answers are grounded in this paper and cite their sources.
We obtain a heavy traffic limit for the GI/M/n + GI queue, which includes the entire patience time distribution. Our main approach is to scale the hazard rate function of the patience time distribution in such a way that our resulting diffusion approximation contains the entire hazard rate function. We then show through numerical studies that for various performance measures, our approximations tend to outperform those commonly used in practice. The robustness of our results is also demonstrated by applying them to solving constraint satisfaction problems arising in the context of telephone call centers.
No takes yet. Share an insight, caveat, or question.
Reed et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: