A New Characterization of Relevant Intervals for Energetic Reasoning

Energetic Reasoning (ER) is a powerful filtering algorithm for the Cumulative constraint. Unfortunately, ER is generally too costly to be used in practice. One reason of its bad behavior is that many intervals are considered as relevant, although most of them should be ignored. In the literature, heuristic approaches have been developed in order to reduce the number of intervals to consider, leading to a loss of filtering. In this paper, we provide a sharp characterization that allows to reduce the number of intervals by a factor seven without loss of filtering.

[1]  Alberto Marchetti-Spaccamela,et al.  Theory and Practice of Algorithms in (Computer) Systems , 2011, Lecture Notes in Computer Science.

[2]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[3]  Edward P. K. Tsang,et al.  Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems , 2003, J. Sched..

[4]  Edward Tsang,et al.  Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems , 2003, J. Sched..

[5]  Alban Derrien,et al.  The Energetic Reasoning Checker Revisited , 2013, CP 2013.

[6]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[7]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[8]  Mats Carlsson,et al.  A Scalable Sweep Algorithm for the cumulative Constraint , 2012, CP.

[9]  Jean-Charles Régin,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems , 2004, Lecture Notes in Computer Science.

[10]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[11]  Timo Berthold,et al.  An Approximative Criterion for the Potential of Energetic Reasoning , 2011, TAPAS.

[12]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[13]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[14]  Petr Vilím,et al.  Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources , 2011, CPAIOR.