Tuesday, 14:15 - 14:40 h, Room: H 3003A


Thibaut Feydy
Lazy clause generation for RCPSP

Coauthors: Andreas Schutt, Peter Stuckey


Lazy clause generation (LCG) is a recent generic method for solving constraint problems. LCG solvers integrate tightly finite domain propagation (FD) with the conflict analysis features of Boolean satisfaction (SAT) solvers. This technology is often order of magnitudes faster than traditional finite domain propagation on some hard combinatorial problems. In particular, we have used methods based on lazy clause generation to solve the resource constrained project scheduling problem (RCPSP) as well as the more general resource constrained project scheduling problem with generalized precedence relations (RCPSP-Max). These scheduling models have applications areas such as project management and production planning. Our experiments show the benefit of lazy clause generation for finding an optimal solution and proving its optimality in comparison to other state-of-the-art exact and non-exact methods. Our methods is able to find better solution faster on hard RCPSP and RCPSP-Max benchmarks. We were able to close many open problem instances and generates better solutions in most of the remaining instances.


Talk 3 of the invited session Tue.2.H 3003A
"CP hybrids for scheduling" [...]
Cluster 5
"Constraint programming" [...]


  cash advance online . In rare cases, the smarting in eyes and the tumefaction of eyelids can happen. In case of long term Cialis Black administration the side effects become less perceptible or disappear at all.