Abstract
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single-server queueing system with Poisson arrivals and exponentially distributed services with adjustable rates. At each decision epoch the controller may adjust the service rate. Also, the controller can reject incoming customers as they arrive. The objective is to minimize long-run average costs which include: a holding cost, which is a non-decreasing function of the number of jobs in the system; a service rate cost c(x), representing the cost per unit time for servicing jobs at rate x; and a rejection cost κ for rejecting a single job. From basic principles, we derive a simple, efficient algorithm for computing the optimal policy. Our algorithm also provides an easily computable bound on the optimality gap at every step. Finally, we demonstrate that, in the class of stationary policies, deterministic stationary policies are optimal for this problem.
Similar content being viewed by others
References
Ata, B., Shneorson, S.: Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Manag. Sci. 52(11), 1778–1791 (2006)
Bertsekas, D.P.: Dynamic Programming and Optimal Control, vol. 2, 3rd edn. Athena Scientific, Belmont (2007)
Borkar, V.S., Meyn, S.P.: Risk-sensitive optimal control for Markov decision processes with monotone cost. Math. Oper. Res. 27(1), 192–209 (2002)
George, J.M., Harrison, J.M.: Dynamic control of a queue with adjustable service rate. Oper. Res. 49(5), 720–731 (2001)
Guo, X., Hernández-Lerma, O.: Drift and monotonicity conditions for continuous-time controlled Markov chains with an average criterion. IEEE Trans. Autom. Control 48, 236–245 (2003)
Hernández-Lerma, O., Lasserre, J.B.: Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer, Berlin (1996)
Koole, G.: Structural results for the control of queueing systems using event-based dynamic programming. Queueing Syst., Theory Appl. 30, 323–339 (1998)
Puterman, M.L.: Markov Decision Processes. Wiley-Interscience, New York (1994)
Sennott, L.I.: Stochastic Dynamic Programming and the Control of Queueing Systems. Wiley-Interscience, New York (1998)
Stidham, S., Weber, R.: Monotonic and insensitive optimal policies for control of queues with undiscounted costs. Oper. Res. 37(4), 611–625 (1989)
Wijngaard, J., Stidham, S.: Forward recursion for Markov decision processes with skip-free-to-the-right transitions. Math. Oper. Res. 11, 295–308 (1986)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by National Science Foundation grant DMI-0132038.
Rights and permissions
About this article
Cite this article
Adusumilli, K.M., Hasenbein, J.J. Dynamic admission and service rate control of a queue. Queueing Syst 66, 131–154 (2010). https://doi.org/10.1007/s11134-010-9192-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-010-9192-z