Job-shop scheduling using timed automata
From MaRDI portal
Recommendations
Cited in
(20)- Temporal constraint satisfaction techniques in job shop scheduling problem solving
- A study on shuffle, stopwatches and independently evolving clocks
- Timed automata relaxation for reachability
- Towards a tropical automaton product minimizing global completion times
- Scheduling with timed automata
- Schedulability analysis of fixed-priority systems using timed automata
- Optimal infinite scheduling for multi-priced timed automata
- A partial order semantics approach to the clock explosion problem of timed automata
- Task automata: Schedulability, decidability and undecidability
- Model Checking Real-Time Systems
- Concavely-Priced Timed Automata
- Preemptive job-shop scheduling using stopwatch automata
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- Timed automata robustness analysis via model checking
- Decomposition of timed automata for solving scheduling problems
- scientific article; zbMATH DE number 2209652 (Why is no real title available?)
- Optimization of timed automata models using mixed-integer programming
- Monte Carlo tree search for priced timed automata
- Timed discrete event control of parallel production lines with continuous outputs
- Models and formal verification of multiprocessor system-on-chips
This page was built for publication: Job-shop scheduling using timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551179)