Preemptive Job-Shop Scheduling Using Stopwatch Automata
- 14 March 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 113-126
- https://doi.org/10.1007/3-540-46002-0_9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A framework for scheduler synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Job-Shop Scheduling Using Timed Automata?Lecture Notes in Computer Science, 2001
- Efficient Guiding Towards Cost-Optimality in UPPAALLecture Notes in Computer Science, 2001
- Computing Efficient Operation Schemes for Chemical Plants in Multi-batch ModeEuropean Journal of Control, 2001
- The Impressive Power of StopwatchesLecture Notes in Computer Science, 2000
- Decidable Integration GraphsInformation and Computation, 1999
- As Soon as Possible: Time Optimal Control for Timed AutomataLecture Notes in Computer Science, 1999
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- A theory of timed automataTheoretical Computer Science, 1994
- Suspension automata: A decidable class of hybrid automataLecture Notes in Computer Science, 1994