Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Ordonnancement dynamique d'une machine flexible Formulation en processus de Bandits-manchots
 
research article

Ordonnancement dynamique d'une machine flexible Formulation en processus de Bandits-manchots

Dusonchet, F.  
•
Hongler, M. O.  
2002
Journal Européen des Systèmes Automatisés

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 markov chain in continuous lime and the associate reward are piecewise linear. We observe that, the use of priority indices to sub-optimally solve the Restless Bandit problem yields, on a particular example, results close to the optimal.

  • Details
  • Metrics
Type
research article
Scopus ID

2-s2.0-33751304511

Author(s)
Dusonchet, F.  
Hongler, M. O.  
Date Issued

2002

Published in
Journal Européen des Systèmes Automatisés
Volume

36

Issue

1

Start page

117

End page

130

Subjects

Dynamic scheduling

•

Make-to-stock production

•

Priority indices

•

Restless bandit

Note

Institut de Production Microtechnique (IPM), Département de Microtechnique EPFL, CH-1015 Lausanne Suisse, Switzerland

Export Date: 6 December 2012

Source: Scopus

Language of Original Document: French

Correspondence Address: Institut de Production Microtechnique (IPM), Département de Microtechnique EPFL, CH-1015 Lausanne Suisse, Switzerland

References: Dusonchet, F., Hongler, M.-O., «Continuous Time Restelss Bandits for Make-to-stock Productions » (2001) Preprint EPFL, , [DUS 00]; «Optimal dynamic scheduling policy for a make-to-stock production system » (1997) Operation Res., 45, pp. 42-54. , [HA 97]; Nino-Mora, J., «Restless Bandit, partial conservation law and index ability » (2001) Adv. Appl. Prob., 33 (1), pp. 76-98. , [NIN 99]; Nino-Mora, J., «On certain greedoid polyhedra, partially indexable scheduling problems, and extended restless Bandit allocation indices » (2000) Mathematical Programming, , [NIN 00] Submitted to; Papadimitriou, C.H., Tsrrsiklis, J.N., «The complexity of optimal queueing network control » (1999) Math. Operation Res., 24, pp. 293-305. , [PAP 94]; Pena, A., Zipkin, P., «Dynamic scheduling rules for a multiproduct make-to-stock queue » (1997) Operation Res., 15, pp. 919-930. , [PEN 97]; Veatch, M.H., Wein, L.M., «Scheduling a make-to-stock queue: Index policies and hedging points » (1996) Operation Res., 44, pp. 634-647. , [VEA 96]; De Vericourt, F., Karaesman, F., Dallery, Y., «Dynamic scheduling in a maketo-stock system: A partial Characterization of optimal policies » (2000) Opeation Res., 48 (5), pp. 811-819. , [VER99]; Whittle, P., (1982) Opimization over Time. Dynamic Programming and Stochastic Control, , [WHI 82] J. Wiley, New-York; Whittle, P., «Restless Bandit: Activity in a changing Word » (1988) J. Appl. Prob., 25 A, pp. 287-298. , [WHI 88]

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
LPM  
Available on Infoscience
January 7, 2013
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/87654
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés