Abstract
We consider a multiclass preemptive-resume priority queue with Poisson arrivals and general service times. We derive explicit expressions for the discounted expected and long-run average weighted queue lengths and switching costs, the latter one only in the case of exponential service times. We illustrate our results with numerical calculations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.G. Barto, S.J. Bradtke and S.P. Singh, Learning to act using real-time dynamic programming, Arti-ficial Intelligence 72 (1995) 81–138.
R. Bellman, Adaptive Control Processes: A Guided Tour (Princeton Univ. Press, Princeton, 1961).
D.P. Bertsekas and J.N. Tsitsiklis, Neuro-Dynamic Programming (Athena Scientific, 1996).
C. Buyukkoc, P. Varaiya and J. Walrand, The µc-rule revisited, Adv. in Appl. Probab. 17 (1985) 237–238.
R. Groenevelt, G.M. Koole and P. Nain, On the bias vector of a two-class preemptive priority queue, Math. Methods Oper. Res. 55 (2002) 107–120.
J.M. Harrison, A priority queue with discounted linear costs, Oper. Res. 23 (1975) 260–269.
N.K. Jaiswal, Priority Queues (Academic Press, New York, 1968).
L. Kleinrock, Queueing Systems, Vol. 2 (Wiley, New York, 1975).
G.M. Koole and P. Nain, On the value function of a priority queue with an application to a controlled polling model, Queueing Systems 34 (2000) 199–214.
S. A. Lippman, On dynamic programming with unbounded rewards, Managm. Sci. 21 (1975) 1225–1233.
P. Nain and D. Towsley, Optimal scheduling in a machine with stochastic varying processing rates, IEEE Trans. Automat. Control 39(9) (1994) 1853–1855.
T.J. Ott and K.R. Krishnan, Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic, Ann. Oper. Res. 35 (1992) 43–68.
M.L. Puterman, Markov Decision Processes (Wiley, New York, 1994).
S.M. Ross, Introduction to Stochastic Dynamic Programming (Academic Press, New York, 1983).
S.A.E. Sassen, H.C. Tijms and R.D. Nobel, A heuristic rule for routing customers to parallel servers, Statistica Neerlandica 5 (1997) 107–121.
L. Takács, Introduction to the Theory of Queues (Oxford Univer. Press, Oxford, 1962).
H.C. Tijms, Stochastic Modelling and Analysis. A Computational Approach (Wiley, Chichester, 1986).
P.D.Welch, On preemptive resume priority queues, Ann. Math. Statist. 35 (1964) 600–611.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koole, G., Nain, P. An Explicit Solution for the Value Function of a Priority Queue. Queueing Systems 47, 251–282 (2004). https://doi.org/10.1023/B:QUES.0000035315.17476.0b
Issue Date:
DOI: https://doi.org/10.1023/B:QUES.0000035315.17476.0b