OPTIMAL PRIORITY ASSIGNMENT - A TIME-SHARING APPROACH

被引:18
作者
ALTMAN, E
SHWARTZ, A
机构
关键词
D O I
10.1109/9.35286
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1098 / 1102
页数:5
相关论文
共 14 条
[1]  
ALTMAN E, 1986, 24TH P ALL C COMM CO, P1147
[2]  
ALTMAN E, 1987, TECHNION ISRAEL I TE, V633
[3]   K COMPETING QUEUES WITH GEOMETRIC SERVICE REQUIREMENTS AND LINEAR COSTS - THE MU-C-RULE IS ALWAYS OPTIMAL [J].
BARAS, JS ;
MA, DJ ;
MAKOWSKI, AM .
SYSTEMS & CONTROL LETTERS, 1985, 6 (03) :173-180
[4]   2 COMPETING QUEUES WITH LINEAR COSTS AND GEOMETRIC SERVICE REQUIREMENTS - THE MU-C-RULE IS OFTEN OPTIMAL [J].
BARAS, JS ;
DORSEY, AJ ;
MAKOWSKI, AM .
ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :186-209
[5]  
BARAS JS, UNPUB SIAM J CONTR P
[6]  
BUYYUKKOC C, 1985, ADV APPL PROBAB, V17, P137
[7]  
Chung K. L., 1960, MARKOV CHAINS STATIO
[8]  
GELENBE E, 1980, ANAL SYNTHESIS COMPU
[9]  
MAKOWSKI AM, 1987, TECHNION ISRAEL I TE, V627
[10]   OPTIMAL PRIORITY ASSIGNMENT WITH HARD CONSTRAINT [J].
NAIN, P ;
ROSS, KW .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1986, 31 (10) :883-888