Decomposition of timed automata for solving scheduling problems.
Tatsushi NishiMasato WakatakePublished in: Int. J. Syst. Sci. (2014)
Keyphrases
- timed automata
- scheduling problem
- model checking
- single machine
- reachability analysis
- job shop scheduling problem
- processing times
- setup times
- job shop scheduling
- np hard
- flowshop
- theorem proving
- artificial intelligence
- precedence constraints
- decomposition method
- theorem prover
- combinatorial optimization
- neural network
- first order logic
- expert systems
- decomposition methods
- optimal solution
- distributed constraint satisfaction problems
- multiscale
- greedy heuristics