Explanations for the cumulative constraint: an experimental study

Authors:
Stefan Heinz;Jens Schulz
Affiliations:
Zuse Institute Berlin, Berlin, Germany;Technische Universität Berlin, Institut für Mathematik, Berlin, Germany
Venue:
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Year:
2011

Citing 9
Cited 2

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Constraint-Based Scheduling

Constraint-Based Scheduling
Constraint Propagation and Decomposition Techniques forHighly Disjunctive and Highly Cumulative Project Scheduling Problems

Constraints
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications

Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications
Max Energy Filtering Algorithm for Discrete Cumulative Resources

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Explaining the cumulative propagator

Constraints
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
Conflict analysis in mixed integer programming

Discrete Optimization

Reconsidering mixed integer programming and MIP-Based hybrids for scheduling

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Using dual presolving reductions to reformulate cumulative constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

In cumulative scheduling, conflict analysis seems to be one of the key ingredients to solve such problems efficiently. Thereby, the computational complexity of explanation algorithms plays an important role. Even more when we are faced with a backtracking system where explanations need to be constructed on the fly. In this paper we present extensive computational results to analyze the impact of explanation algorithms for the cumulative constraint in a backward checking system. The considered explanation algorithms differ in their quality and computational complexity.We present results for the domain propagation algorithms time-tabling, edge-finding, and energetic reasoning.