Solving Periodic Event Scheduling Problems with SAT.
Peter GroßmannSteffen HölldoblerNorbert MantheyKarl NachtigallJens OpitzPeter SteinkePublished in: IEA/AIE (2012)
Keyphrases
- scheduling problem
- np complete problems
- satisfiability problem
- processing times
- sat encodings
- sat instances
- stochastic local search
- graph coloring
- sat solving
- graph coloring problems
- tabu search
- sat problem
- job shop scheduling
- solving hard
- propositional satisfiability
- periodic patterns
- orders of magnitude
- np complete
- search algorithm for solving
- search algorithm
- combinatorial optimization
- variable ordering
- boolean optimization
- boolean formula
- job shop scheduling problem
- single machine
- np hard
- search space