Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
The Design of the Zinc Modelling Language
Constraints
Complete MCS-based search: application to resource constrained project scheduling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propagation = lazy clause generation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Computing explanations for the unary resource constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A new o(n2log n) not-first/not-last pruning algorithm for cumulative resource constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A resource cost aware cumulative
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Explaining the cumulative propagator
Constraints
Timetable edge finding filtering algorithm for discrete cumulative resources
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
BDDs for pseudo-boolean constraints: revisited
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Half reification and flattening
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Models and strategies for variants of the job shop scheduling problem
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A constraint integer programming approach for resource-constrained project scheduling
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Symmetries and lazy clause generation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Conflict directed lazy decomposition
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Inter-instance nogood learning in constraint programming
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A scalable sweep algorithm for the cumulative constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A new look at BDDs for Pseudo-Boolean constraints
Journal of Artificial Intelligence Research
Solving RCPSP/max by lazy clause generation
Journal of Scheduling
Hi-index | 0.01 |
The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal of research has investigated new stronger and faster filtering techniques for cumulative, but still most of these techniques only pay off in limited cases or are not scalable. Recently, the "lazy clause generation" hybrid solving approach has been devised which allows a finite domain propagation engine possible to take advantage of advanced SAT technology, by "lazily" creating a SAT model of an FD problem as computation progresses. This allows the solver to make use of SAT nogood learning and autonomous search capabilities. In this paper we show that using lazy clause generation where we model cumulative constraint by decomposition gives a very competitive implementation of cumulative resource problems. We are able to close a number of open problems from the well-established PSPlib benchmark library of resource-constrained project scheduling problems.