Journal
QUEUEING SYSTEMS
Volume 41, Issue 4, Pages 305-319Publisher
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1016241214158
Keywords
scheduling; stochastic dynamic programming; restless bandits; mobile communications
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available