151
Voted
CAV
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
142
Voted
FORMATS
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we report some progress in applying timed automata technology to large-scale problems. We focus on the problem of finding maximal stabilization time for combinationa...