Journal article

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

    Keywords: Markov processes ; production control


    Inst. de Production Microtechnique, Ecole Polytech. Fed. de Lausanne, Switzerland


    scheduling rules

    dynamic scheduling

    hedging levels

    restless bandit problem formulation

    make-to-stock production

    Markov chain

    priority indices


    • EPFL-ARTICLE-182955

    Record created on 2013-01-07, modified on 2016-08-09


  • There is no available fulltext. Please contact the lab or the authors.

Related material