Erlang-S: A Data-Based Model of Servers in Queueing Networks
- 1 October 2019
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 65 (10) , 4607-4635
Abstract
Classical queueing theory has typically focused on customers, and server availability has been taken for granted. However, data accessibility and the emergence of complex service systems, for example, call centers, revealed the need to stochastically model the complex behavior of servers. In this work, we propose a new model that accommodates such behavior; we call it Erlang-S, where “S” stands for servers. Our model assumes a pool of present servers, some of whom are available to serve customers from the queue while others are not, and the process of becoming available or unavailable is modeled explicitly. Our focus here is on applying the model to real systems, specifically call centers. Estimating the parameters of the new model from call-center data is challenging because reality is observed discretely in time as opposed to its continuous evolution. We therefore use an expectation-maximization algorithm that computes the expected number of relevant quantities given the discrete-time data. Erlang-S differs from the Erlang-A model, which has been commonly used for modeling call centers: the latter model assumes that all agents who are present are, in fact, available for service. When comparing predictions of the two models against call-center data, we find that Erlang-A generally overestimates queue length and consequently also the fraction of abandonment, and Erlang-S predicts reality more closely and usefully. Our conclusion is that it is important to model explicitly server dynamics to obtain accurate and valuable models of complex service systems. This paper was accepted by Gad Allon, stochastic models and simulation.Keywords
This publication has 16 references indexed in Scilit:
- Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service RatesOperations Research, 2016
- Predicting the continuation of a function with applications to call center dataJournal of Statistical Planning and Inference, 2014
- Service times in call centers: Agent heterogeneity and learning with some operational consequences2010
- Impact of Workload on Service Time and Patient Safety: An Econometric Analysis of Hospital OperationsManagement Science, 2009
- Efficient estimation of transition rates between credit ratings from observations at discrete time pointsQuantitative Finance, 2009
- The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management ResearchProduction and Operations Management, 2007
- Statistical Inference for Discretely Observed Markov Jump ProcessesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Statistical Analysis of a Telephone Call CenterJournal of the American Statistical Association, 2005
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- Almost sure comparison of birth and death processes with application to M/M/s queueing systemsQueueing Systems, 1986