Article ID: | iaor2017385 |
Volume: | 64 |
Issue: | 4 |
Start Page Number: | 867 |
End Page Number: | 885 |
Publication Date: | Aug 2016 |
Journal: | Operations Research |
Authors: | Ingolfsson Armann, Kolfal Bora, Delasay Mohammad |
Keywords: | scheduling, combinatorial optimization, simulation, communications, networks: scheduling, markov processes, queues: applications, performance |
Servers in many real queueing systems do not work at a constant speed. They adapt to the system state by speeding up when the system is highly loaded or slowing down when load has been high for an extended time period. Their speed can also be constrained by other factors, such as geography or a downstream blockage. We develop a state‐dependent queueing model in which the service rate depends on the system ‘load’ and ‘overwork.’ Overwork refers to a situation where the system has been under a heavy load for an extended time period. We quantify load as the number of users in the system, and we operationalize overwork with a state variable that is incremented with each service completion in a high‐load period and decremented at a rate that is proportional to the number of idle servers during low‐load periods. Our model is a quasi‐birth‐and‐death process with a special structure that we exploit to develop efficient and easy‐to‐implement algorithms to compute system performance measures. We use the analytical model and simulation to demonstrate how using models that ignore adaptive server behavior can result in inconsistencies between planned and realized performance and can lead to suboptimal, unstable, or oscillatory staffing decisions.