Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource

Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. Moreover, this capacity is not necessarily always the same during the scheduling period. This article introduces a new constraint for solving this class of problems. We adapt two filtering algorithms to our context: Sweep and P. Vilim's Edge-Finding algorithm. We emphasize that in some problems violations are imposed. We design a new filtering procedure specific to this kind of events. We introduce a search heuristic specific to our constraint. We successfully experiment our constraint.

[1]  Christian Bessiere,et al.  Meta-constraints on violations for over constrained problems , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[2]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[3]  Yves Deville,et al.  The Deviation Constraint , 2007, CPAIOR.

[4]  Thomas Schiex,et al.  Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..

[5]  Barry O'Sullivan,et al.  A Soft Constraint of Equality: Complexity and Approximability , 2008, CP.

[6]  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.

[7]  Mats Carlsson,et al.  A New Multi-resource cumulatives Constraint with Negative Heights , 2002, CP.

[8]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[9]  Jean-Charles Régin,et al.  The Ordered Distribute Constraint , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[10]  Emmanuel Poder,et al.  Global propagation of side constraints for solving over-constrained problems , 2011, Ann. Oper. Res..

[11]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  Mats Carlsson,et al.  Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family , 2001, ICLP.

[13]  Gilles Pesant,et al.  SPREAD: A Balancing Constraint Based on Statistics , 2005, CP.

[14]  Petr Vilím,et al.  Edge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log n){\mathcal O}(kn {\rm log} n) , 2009, CP.

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

[16]  Roberto Rossi,et al.  Synthesizing Filtering Algorithms for Global Chance-Constraints , 2009, CP.