Deadline Scheduling as Restless Bandits

DOI10.1109/TAC.2018.2807924zbMath1423.90107arXiv1610.00399OpenAlexW2793205632MaRDI QIDQ4682287

Zhe Yu, Yunjian Xu, Lang Tong

Publication date: 18 September 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)

Related Items (2)

Conditions for indexability of restless bandits and an algorithm to compute Whittle index ⋮ Minimizing the mean slowdown in the M/G/1 queue

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