Opportunistic Scheduling as Restless Bandits

DOI10.1109/TCNS.2017.2774046MaRDI QIDQ4630229zbMATH OpenOpenAlexFDO

Authors Vivek Borkar, Gaurav S. Kasbekar, Sarath Pattathil, Priyesh Y. Shetty

Publication date 29 March 2019

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.09778

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Systems theory; control (93-XX)

Recommendations

• Deadline Scheduling as Restless Bandits
• Uncertainty-of-Information Scheduling: A Restless Multiarmed Bandit Framework
• scientific article; zbMATH DE number 2156732
• Open bandit processes and optimal scheduling of queueing networks
• Optimal stochastic scheduling
• Approximation algorithms for restless bandit problems
• Approximation algorithms for restless bandit problems
• scientific article; zbMATH DE number 4087408
• Stochastic Online Scheduling Revisited
• Optimal match-up strategies in stochastic scheduling

Cited in

(1)

• On the computation of Whittle's index for Markovian restless bandits

This page was built for publication: Opportunistic Scheduling as Restless Bandits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630229)