Scheduling with timed automata

  • Authors:
  • Yasmina Abdeddaïm;Eugene Asarin;Oded Maler

  • Affiliations:
  • ESIEE, Cité Descartes, Noisy-le-Grand, France;LIAFA, Université Paris, Paris, France;VERIMAG, Gières, France

  • Venue:
  • Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
  • Year:
  • 2006

Quantified Score

Hi-index 0.03

Visualization

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.