Comparing time-stable performance of staffing methods using real call-centre data Online publication date: Mon, 23-May-2022
by Dong Dai; Arka P. Ghosh; Keguo Huang
International Journal of Operational Research (IJOR), Vol. 44, No. 1, 2022
Abstract: A central question in capacity management for service systems is to decide the number of servers that changes over time to accommodate time-varying arrivals and maintain a prescribed service-quality level. Two common methods for this are: square-root-staffing formula (SRSF) and iterative-staffing algorithm (ISA). We examine the stability of these two methods on simulated data from a probabilistic model and on a synthetic data created by resampling actual arrival, service and abandonment times from the call-centre of an Israeli bank. We use the delay probability as well as other common measures for the quality of service. In the simulated case, the ISA method marginally outperforms the SRSF method in maintaining the stability around the target delay probability. But in the case of synthetic resampled data, the stability drops when the service and patience rates are large. We also give theoretical proofs for the convergence of the ISA method under appropriate conditions.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook