By Topic

Continuous-time restless bandit and dynamic scheduling for make-to-stock production

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. Dusonchet ; Inst. de Production et Robotique, Ecole Polytechnique Federale de Lausanne, Switzerland ; M. -O. Hongler

We study the "Whittle relaxation" version of the continuous time, discrete, and continuous state space Restless Bandit problem under the discounted cost criterion. Explicit expressions of Whittle's priority indexes, which generalize the Gittins indexes, are derived. This formalism is then used in the context of flexible make-to-stock production to construct dynamic scheduling rules. These analytical results are finally compared with the optimal numerically derived policy, obtained for a server delivering two product types. It is observed that the Whittle relaxation version of the Restless Bandit model nearly yields optimal dynamic scheduling rules.

Published in:

IEEE Transactions on Robotics and Automation  (Volume:19 ,  Issue: 6 )