A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
Theoretical Computer Science
Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Timed Automata with Asynchronous Processes: Schedulability and Decidability
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The Impressive Power of Stopwatches
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Job-Shop Scheduling Using Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Framework for Scheduler Synthesis
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Verification of duration systems using an approximation approach
Journal of Computer Science and Technology
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Schedulability analysis of fixed-priority systems using timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
UML&AADL '2007 grand challenges
ACM SIGBED Review
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Distributed time-asynchronous automata
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
An automated translator for model checking time constrained workflow systems
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
| Hi-index | 0.00 |
In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can be modeled naturally as a shortest path problem defined on an extension of timed automata, namely stopwatch automata where some of the clocks might be freezed at certain states. Although general verification problems on stopwatch automata are known to be undecidable, we show that due to particular properties of optimal schedules, the shortest path in the automaton belongs to a finite subset of the set of acyclic paths and hence the problem is solvable. We present several algorithms and heuristics for finding the shortest paths in such automata and test their implementation on numerous benchmark examples.