2 COMPETING QUEUES WITH LINEAR COSTS AND GEOMETRIC SERVICE REQUIREMENTS - THE MU-C-RULE IS OFTEN OPTIMAL

被引：51

作者：

BARAS, JS ^{[1
]}

DORSEY, AJ ^{[1
]}

MAKOWSKI, AM ^{[1
]}

机构：

[1] IBM,DIV FED SYST,GAITHERSBURG,MD 20748

来源：

关键词：

D O I：

10.2307/1427059

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：186 / 209

页数：24

共 27 条

[1]

BARAS JS, 1983, 2ND P IEEE ANN JOINT, P427

[2]

BARAS JS, 1983, SRR839 U MAR EL ENG

[3]

BARAS JS, 1983, SRR831 U MAR EL ENG

[4]

BARAS JS, 1981, IEEE T AUTOMATIC CON, V26, P1095

[5]

BUYUKKOC C, 1985, ADV APPL PROBAB, V17, P234

[6]

Cox D.R., 1961, QUEUES

[7]

DORSEY AJ, 1983, THESIS U MARYLAND CO

[8] A SIMPLE DYNAMIC ROUTING PROBLEM [J].

EPHREMIDES, A ;

VARAIYA, P ;

WALRAND, J .

[9]

HAJEK B, 1982, 21ST P IEEE C DEC CO, P840

[10] DYNAMIC SCHEDULING OF A MULTICLASS QUEUE - DISCOUNT OPTIMALITY [J].

HARRISON, JM .