K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal-Reference-Cited by-同舟云学术

K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal

Author:

Baras J.S.,Ma D.-J.,Makowski A.M.

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Mechanical Engineering,General Computer Science,Control and Systems Engineering

Reference6 articles.

1. Two competing queues with linear costs: the μc-rule is often optimal;Baras;J. Appl. Probab.,1983

2. the cμ rule revisited;Buyukkoc;J. Appl. Probab.,1983

4. On optimal right-of-way policies at a single-server station when insertion of idle times is permitted;Meilijson,1977

5. Extensions of the multi-armed bandit problem;Varaiya;IEEE Trans. Automat. Control.,1983

Cited by 73 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep Reinforcement Learning-based Dynamic Bandwidth Allocation in Weighted Fair Queues of Routers;2022 IEEE 18th International Conference on Automation Science and Engineering (CASE);2022-08-20

3. RL-QN: A Reinforcement Learning Framework for Optimal Control of Queueing Systems;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2022-03-31