Decomposition of timed automata for solving scheduling problems.
Tatsushi NishiMasato WakatakeMasahiro InuiguchiPublished in: SMC (2008)
Keyphrases
- timed automata
- scheduling problem
- model checking
- reachability analysis
- processing times
- expert systems
- job shop
- artificial intelligence
- single machine
- theorem prover
- search algorithm for solving
- job shop scheduling
- combinatorial optimization
- search algorithm
- theorem proving
- decomposition methods
- first order logic
- tabu search
- computational complexity