A Boolean satisfiability approach to the resource-constrained project scheduling problem.
Andrei HorbachPublished in: Ann. Oper. Res. (2010)
Keyphrases
- resource constrained project scheduling problem
- boolean satisfiability
- probabilistic planning
- resource constraints
- branch and bound algorithm
- sat solvers
- randomly generated
- symmetry breaking
- sat problem
- integer linear programming
- phase transition
- artificial bee colony
- combinatorial problems
- ant colony algorithm
- max sat
- harmony search
- search space
- optimal solution
- search tree
- satisfiability problem
- differential evolution
- planning under uncertainty
- np complete