Scheduling with Timed Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Scheduling with Timed Automata

Yasmina Abdeddaïm
Oded Maler
  • Fonction : Auteur correspondant
  • PersonId : 840888

Connectez-vous pour contacter l'auteur

Résumé

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.

Dates et versions

hal-00157338 , version 1 (25-06-2007)

Identifiants

Citer

Yasmina Abdeddaïm, Eugene Asarin, Oded Maler. Scheduling with Timed Automata. Theoretical Computer Science, 2006, 354 (2), pp.272-300. ⟨10.1016/j.tcs.2005.11.018⟩. ⟨hal-00157338⟩
99 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More