A SAT-based approach to solve the faculty course scheduling problem.
Fadi AloulImad ZabalawiAhmed WasfyPublished in: AFRICON (2013)
Keyphrases
- scheduling problem
- np hard
- single machine
- solving hard
- setup times
- satisfiability problem
- processing times
- lower bound
- strongly np hard
- sequence dependent setup times
- precedence constraints
- combinatorial problems
- flowshop
- tabu search
- max sat
- approximation algorithms
- boolean satisfiability
- special case
- optimal solution
- minimizing makespan
- weighted max sat