Optimal control of single-server fluid networks

被引:14
作者
Bäuerle, N [1 ]
Rieder, U [1 ]
机构
[1] Univ Ulm, Dept Math 7, D-89069 Ulm, Germany
关键词
stochastic fluid model; index policy; Klimov index; largest remaining index algorithm; maximum principle; sample path argument; reentrant fluid lines;
D O I
10.1023/A:1019146111903
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider a stochastic single-server fluid network with both a discounted reward and a cost structure. It can be shown that the optimal policy is a priority index policy. The indices coincide with the optimal indices in a semi-Markovian Klimov problem. Several special cases like single-server reentrant fluid lines are considered. The approach we use is based on sample path arguments and Pontryagins maximum principle.
引用
收藏
页码:185 / 200
页数:16
相关论文
共 12 条
[1]  
[Anonymous], LECT APPL MATH AM MA
[2]  
AVRAM F, 1995, STOCHASTIC NETWORKS, P199
[3]  
AVRAM F, 1997, LECT APPL MATH, V33, P1
[4]   DYNAMIC SCHEDULING OF A MULTICLASS FLUID NETWORK [J].
CHEN, H ;
YAO, DD .
OPERATIONS RESEARCH, 1993, 41 (06) :1104-1115
[5]  
CHEN X, 1994, CURR MED CHEM, V1, P105
[6]  
Klimov G. P., 1974, Theory of Probability and Its Applications, V19, P532, DOI 10.1137/1119060
[7]  
Seierstad A., 1987, Optimal control theory with economic applications
[8]  
Sethi SP, 1994, HIERARCHICAL DECISIO
[9]   OPTIMAL-CONTROL OF SINGLE-SERVER QUEUING NETWORKS AND MULTI-CLASS M-G-1 QUEUES WITH FEEDBACK [J].
TCHA, DW ;
PLISKA, SR .
OPERATIONS RESEARCH, 1977, 25 (02) :248-258
[10]  
Walrand J., 1988, An Introduction to Queueing Networks