期刊
QUEUEING SYSTEMS
卷 41, 期 4, 页码 305-319出版社
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1016241214158
关键词
scheduling; stochastic dynamic programming; restless bandits; mobile communications
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据