Dynamic control of a single-server system with abandonments
In this paper, we discuss the dynamic server control in a two-class service system with abandonments. Two models are considered. In the first case, rewards are received upon service completion, and there are no abandonment costs (other than the lost opportunity to gain rewards). In the second, holding costs per customer per unit time are accrued, and each abandonment involves a fixed cost. Both cases are considered under the discounted or average reward/cost criterion. These are extensions of the classic scheduling question (without abandonments) where it is well known that simple priority rules hold.
The contributions in this paper are twofold. First, we show that the classic c–μ rule does not hold in general. An added condition on the ordering of the abandonment rates is sufficient to recover the priority rule. Counterexamples show that this condition is not necessary, but when it is violated, significant loss can occur. In the reward case, we show that the decision involves an intuitive tradeoff between getting more rewards and avoiding idling. Secondly, we note that traditional solution techniques are not directly applicable. Since customers may leave in between services, an interchange argument cannot be applied. Since the abandonment rates are unbounded we cannot apply uniformization—and thus cannot use the usual discrete-time Markov decision process techniques. After formulating the problem as a continuous-time Markov decision process (CTMDP), we use sample path arguments in the reward case and a savvy use of truncation in the holding cost case to yield the results. As far as we know, this is the first time that either have been used in conjunction with the CTMDP to show structure in a queueing control problem. The insights made in each model are supported by a detailed numerical study.
KeywordsPriority rules Dynamic programming Control of queues
Mathematics Subject Classification (2000)90B36 60K25 90C40
- 1.Aksin, Z., Armony, M., Mehrotra, V.: The modern call-center: a multi-disciplinary perspective on operations management research. Prod. Oper. Manag. 16, 665–668 (2007) Google Scholar
- 6.Atar, R., Giat, C., Shimkin, N.: The c μ/θ rule for many-server queues with abandonment. Preprint (2010) Google Scholar
- 10.Ghamami, S., Ward, A.: Dynamic scheduling of an N-system with reneging. Preprint (2010) Google Scholar
- 15.Koçag̃a, Y., Ward, A.: Admission control for a multi-server queue with abandonment. Preprint (2010) Google Scholar
- 18.Prieto-Rumeau, T., Hernández-Lerma, O.: A unified approach to continuous-time discounted Markov control processes. Morfismos 10(1), 1–40 (2006) Google Scholar
- 19.Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Mathematical Statistics. Wiley, New York (1994) Google Scholar
- 21.Tezcan, T., Dai, J.: Dynamic control of N-systems with many servers. asymptotic optimality of a static priority policy in heavy traffic. Preprint (2010) Google Scholar