Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
José Niño-Mora. Marginal productivity index policies for scheduling restless bandits with switching penalties. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{ninomora:DagSemProc.05031.13,
author = {Ni\~{n}o-Mora, Jos\'{e}},
title = {{Marginal productivity index policies for scheduling restless bandits with switching penalties}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--6},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.13},
URN = {urn:nbn:de:0030-drops-644},
doi = {10.4230/DagSemProc.05031.13},
annote = {Keywords: stochastic scheduling , restless bandits , index policies , switching penalties}
}