Solving Open Job-Shop Scheduling Problems by SAT Encoding.
Miyuki KoshimuraHidetomo NabeshimaHiroshi FujitaRyuzo HasegawaPublished in: IEICE Trans. Inf. Syst. (2010)
Keyphrases
- sat encodings
- job shop scheduling problem
- job shop scheduling
- graph coloring
- particle swarm algorithm
- sat solvers
- sat solving
- tabu search
- combinatorial optimization problems
- benchmark problems
- combinatorial optimization
- scheduling problem
- combinatorial problems
- memetic algorithm
- graph model
- metaheuristic
- constraint satisfaction problems
- simulated annealing
- neural network
- solving problems
- timetabling problem
- genetic algorithm