Author:
Ishikida Takashi,Wan Yat-wah
Abstract
A single server processes jobs that can yield rewards but expire on predetermined dates. Expected immediate rewards from each job are deteriorating. The instance is formulated as a multiarmed bandit problem, and an index-based scheduling policy is shown to maximize the expected total reward.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Multi-Armed Bandit Allocation Indices;2011-02-16
2. Kyoto as a Garden City;Landscape Ecological Applications in Man-Influenced Areas;2008
3. Independently Expiring Multiarmed Bandits;Probability in the Engineering and Informational Sciences;1998-10