Bias optimality in controlled queueing systems

被引:41
作者
Haviv, M [1 ]
Puterman, ML
机构
[1] Univ Sydney, Dept Econometr, Sydney, NSW 2006, Australia
[2] Hebrew Univ Jerusalem, Dept Stat, IL-91905 Jerusalem, Israel
[3] Univ British Columbia, Fac Commerce & Business, Vancouver, BC V6T 1Z2, Canada
关键词
Markov decision processes; average reward; control limit policies; admission control; uniformization; Blackwell optimality;
D O I
10.1017/S0021900200014741
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
This paper studies an admission control M/M/1 queueing system. It shows that the only gain (average) optimal stationary policies with gain and bias which satisfy the optimality equation are of control limit type, that there are at most two and, if then are two, they occur consecutively. Conditions are provided which ensure the existence of two gain optimal control limit policies and are illustrated with an example. The main result is that bias optimality distinguishes these two gain optimal policies and that the larger of the two control limits is the unique bias optimal stationary policy. Consequently it is also Blackwell optimal. This result is established by appealing to the third optimality equation of the Markov decision process and some observations concerning the structure of solutions of the second optimality equation.
引用
收藏
页码:136 / 150
页数:15
相关论文
共 13 条
[1]  
Bertsekas D. P., 1987, DYNAMIC PROGRAMMING
[2]   DISCRETE DYNAMIC-PROGRAMMING [J].
BLACKWELL, D .
ANNALS OF MATHEMATICAL STATISTICS, 1962, 33 (02) :719-&
[3]   AVERAGE, SENSITIVE AND BLACKWELL OPTIMAL POLICIES IN DENUMERABLE MARKOV DECISION CHAINS WITH UNBOUNDED REWARDS [J].
DEKKER, R ;
HORDIJK, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (03) :395-420
[4]  
Howard R., 1960, DYNAMIC PROGRAMMING
[6]   APPLYING A NEW DEVICE IN OPTIMIZATION OF EXPONENTIAL QUEUING SYSTEMS [J].
LIPPMAN, SA .
OPERATIONS RESEARCH, 1975, 23 (04) :687-710
[7]  
MAHADEVAN S, 1996, AAAI P
[8]  
Puterman M.L., 2008, Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics
[9]   A NOTE ON COMPUTING OPTIMAL-CONTROL LIMITS FOR GI/M/1 QUEUING-SYSTEMS [J].
PUTERMAN, ML ;
THOMAS, LC .
MANAGEMENT SCIENCE, 1987, 33 (07) :939-943
[10]   THE EXISTENCE OF SENSITIVE OPTIMAL POLICIES IN TWO MULTI-DIMENSIONAL QUEUEING MODELS [J].
Spieksma, Flos .
ANNALS OF OPERATIONS RESEARCH, 1991, 28 (01) :273-295