Dynamic scheduling of a flexible machine. Restless bandit formulation

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


Published in:
APII-JESA Journal Europeen des Systemes Automatises, 36, 1, 117-30
Year:
2002
Publisher:
Editions Hermes
ISSN:
1269-6935
Keywords:
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
Laboratories:




 Record created 2013-01-07, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)