New bounds for expected cycle times in tandem queues with blocking.

Published in: Eur. J. Oper. Res. (2000)

Keyphrases

worst case bounds
upper bound
lower bound
upper and lower bounds
processor sharing
waiting times
service rates
finite capacity
bayesian networks
reinforcement learning
worst case
average case
record linkage
asymptotically optimal
priority queue