Scheduling in Multiclass Networks with Deterministic Service Times

被引：0
|
作者：
Rhonda Righter
机构：
[1] Santa Clara University,Department of Operations and Management Information Systems
来源：
Queueing Systems | 2002年 / 41卷
关键词：
scheduling; stochastic dynamic programming; restless bandits; mobile communications;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider general feed-forward networks of queues with deterministic service times and arbitrary arrival processes. There are holding costs at each queue, idling may or may not be permitted, and servers may fail. We partially characterize the optimal policy and give conditions under which lower priority should be given to jobs that would be delayed later in the network if they were processed now.
引用
收藏
页码：305 / 319
页数：14
相关论文
共 50 条
12345