We explore the scheduling rules and the hedging levels that can be obtained by using a restless bandit problem formulation of a make-to-stock production. The underlying dynamics are a Markov chain in continuous time and the associated rewards are piecewise linear. We observe that, the use of priority indices to sub-optimally solve the restless bandit problem yields, for a particular example, results close to the optimal
Title
Dynamic scheduling of a flexible machine. Restless bandit formulation
Published in
APII-JESA Journal Europeen des Systemes Automatises
Volume
36
Issue
1
Pages
117-30
Date
2002
Publisher
Editions Hermes
ISSN
1269-6935
Note
Inst. de Production Microtechnique, Ecole Polytech. Fed. de Lausanne, Switzerland
7317607
scheduling rules
dynamic scheduling
hedging levels
restless bandit problem formulation
make-to-stock production
Markov chain
priority indices
Record creation date
2013-01-07