Scheduling with Timed Automata

Abstract : In this work, we present timed automata as a natural tool for posing and solving scheduling problems. We show how efficient shortest path algorithms for timed automata can find optimal schedules for the classical job-shop problem. We then extend these results to synthesize adaptive scheduling strategies for problems with uncertainty in task durations.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2006, 354 (2), pp.272-300. 〈10.1016/j.tcs.2005.11.018〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00157338
Contributeur : Eugene Asarin <>
Soumis le : lundi 25 juin 2007 - 18:31:10
Dernière modification le : jeudi 17 mai 2018 - 12:52:03

Lien texte intégral

Identifiants

Collections

IMAG | LIAFA | UGA | USPC

Citation

Yasmina Abdeddaïm, Eugene Asarin, Oded Maler. Scheduling with Timed Automata. Theoretical Computer Science, Elsevier, 2006, 354 (2), pp.272-300. 〈10.1016/j.tcs.2005.11.018〉. 〈hal-00157338〉

Partager

Métriques

Consultations de la notice

121