Arc-Consistency computes the minimal binarised domains of an STP. Use of the result in a TCSP solver, in a TCSP-based job shop scheduler, and in generalising Dijkstra's one-to-all algorithm.
Amar IsliPublished in: CoRR (2020)
Keyphrases
- constraint satisfaction problems
- space complexity
- temporal reasoning
- path consistency
- arc consistency
- np hard
- computational complexity
- cost function
- optimal solution
- worst case time complexity
- job shop scheduling
- non binary
- job shop scheduling problem
- objective function
- benchmark problems
- solution quality
- branch and bound
- constraint satisfaction
- optimization problems
- simulated annealing
- upper bound
- dynamic programming
- evolutionary algorithm