{
  "id": "1610.00399",
  "version": "v1",
  "published": "2016-10-03T04:08:57.000Z",
  "updated": "2016-10-03T04:08:57.000Z",
  "title": "Deadline Scheduling as Restless Bandits",
  "authors": [
    "Zhe Yu",
    "Yunjian Xu",
    "Lang Tong"
  ],
  "comment": "arXiv admin note: substantial text overlap with arXiv:1605.07578",
  "categories": [
    "math.OC"
  ],
  "abstract": "The problem of stochastic deadline scheduling is considered. A constrained Markov decision process model is introduced in which jobs arrive randomly at a service center with stochastic job sizes, rewards, and completion deadlines.The service provider faces random processing costs, convex non-completion penalties, and a capacity constraint that limits the simultaneous processing of jobs. Formulated as a restless multi-armed bandit problem, the stochastic deadline scheduling problem is shown to be indexable. A closed-form expression of the Whittle's index is obtained for the case when the processing costs are constant. An upper bound on the gap-to-optimality of the Whittle's index policy obtained and is shown converge to zero super exponentially as the number of available processors increases.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-10-03T04:08:57.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "restless bandits",
      "stochastic deadline scheduling",
      "provider faces random processing costs",
      "whittles index",
      "constrained markov decision process model"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}