Oded Maler (VERIMAG)
In this talk we present a new theory of scheduling based on timed automata. In this framework the set of feasible schedules corresponds to the set of runs of a timed automaton and the optimal schedule -- to the shortest run. The applicability of this approach is demonstrated on several classes of problems, including job-shop scheduling (with and without preemption), task-graph scheduling and scheduling under uncertainty (in the duration of tasks).