Index policies for a class of discounted restless bandits

DOI10.1239/aap/1037990952zbMath1053.90048OpenAlexW2140262010MaRDI QIDQ4706205

José Niño-Mora, P. S. Ansell, Kevin D. Glazebrook

Publication date: 13 October 2003

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1037990952

zbMATH Keywords

schedulingprioritypolicyrestless banditmultiarmed bandit problem

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Optimal stochastic control (93E20)

Related Items (9)

On the optimal allocation of service to impatient tasks ⋮ Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing ⋮ Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach ⋮ Index policies for discounted bandit problems with availability constraints ⋮ Some indexable families of restless bandit problems ⋮ Monotone Policies and Indexability for Bidirectional Restless Bandits ⋮ Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability ⋮ Spinning plates and squad systems: policies for bi-directional restless bandits ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM

This page was built for publication: Index policies for a class of discounted restless bandits