Scheduling of multi-class multi-server queueing systems with abandonments
Many real-world situations involve queueing systems in which customers may abandon if service does not start sufficiently quickly. We study a comprehensive model of multi-class queue scheduling accounting for customer abandonment, with the objective of minimizing the total discounted or time-average sum of linear waiting costs, completion rewards, and abandonment penalties of customers in the system. We assume the service times and abandoning times are exponentially distributed. We solve analytically the case in which there is one server and there are one or two customers in the system and obtain an optimal policy. For the general case, we use the framework of restless bandits to analytically design a novel simple index rule with a natural interpretation. We show that the proposed rule achieves near-optimal or asymptotically optimal performance both in single- and multi-server cases, both in overload and underload regimes, and both in idling and non-idling systems.
KeywordsStochastic scheduling Abandonment Restless bandits Index policy Whittle index
Research partially supported by the French “Agence Nationale de la Recherche (ANR)” through the project ANR JCJC RACON.
- Argon, N., Ziya, S., & Righter, R. (2010). Scheduling impatient jobs in a clearing system with insights on patient triage in mass-casualty incidents. Probability in the Engineering and Informational Sciences, 22(3), 301–332.Google Scholar
- Ayesta, U., Jacko, P., & Novak, V. (2011). 2011 In IEEE Infocom: A nearly-optimal index rule for scheduling of users with abandonment.Google Scholar
- Boxma, O., & de Waal, P. (1994). Multiserver queues with impatient customers. In In Proceedings of ITC-14 (pp. 743–756).Google Scholar
- Buyukkoc, C., Varaya, P., & Walrand, J. (1985). The \(c\mu \) rule revisited. Advances in Applied Probability, 17, 237–238.Google Scholar
- Cox, D. R., & Smith, W. L. (1961). Queues. London: Methuen & Co.Google Scholar
- Gittins, J. (1989). Multi-armed bandit allocation indices. Chichester: Wiley.Google Scholar
- Gittins, J., & Jones, D. (1974). A dynamic allocation index for the sequential design of experiments. In J. Gani (Ed.), Progress in statistics (pp. 241–266). Amsterdam: North-Holland.Google Scholar
- Graves, S. (1984). The application of queueing theory to continuous perishable inventory systems. Management Science, 28, 401–406.Google Scholar
- Jacko, P. (2009). Adaptive greedy rules for dynamic and stochastic resource capacity allocation problems. Medium for Econometric Applications, 17(4), 10–16.Google Scholar
- Puterman, M. L. (2005). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.Google Scholar