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

被引：65

作者：

BARAS, JS ^{[1
]}

MA, DJ ^{[1
]}

MAKOWSKI, AM ^{[1
]}

机构：

[1] UNIV MARYLAND,DEPT ELECT ENGN,COLLEGE PK,MD 20742

来源：

SYSTEMS & CONTROL LETTERS | 1985年 / 6卷 / 03期

关键词：

OPTIMIZATION;

D O I：

10.1016/0167-6911(85)90037-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A discrete-time system of K competing queues with geometric service requirements and arbitrary arrival patterns is studied. When the cost per slot is linear in the queue sizes, it is shown that the mu c-rule minimizes the expected discounted cost over the infinite horizon.

引用

页码：173 / 180

页数：8