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 …

Edge Finding filtering algorithm is one of the reasons why Constraint Programming is a
successful approach in the scheduling domain. However edge finding for cumulative …

This paper presents new Edge Finding algorithm for discrete cumulative resources, ie
resources which can process several activities simultaneously up to some maximal capacity …

The Cumulative constraint is a foundamental global constraint, which naturally arises in a
variety of problems related to scheduling with limited resources. Since its introduction …

Energetic reasoning is a strong filtering technique for the C umulative constraint. However,
the best algorithms process O (n^ 2) time intervals to perform the satisfiability check which …

The recent success of the lazy clause generator (a hybrid of a FD and a SAT solver) on
resource-constrained project scheduling problems (RCPSP) shows the importance of the …

In scheduling using constraint programming we usually reason only about possible start
times and end times of activities and remove those which are recognized as unfeasible …

We present new filtering algorithms for Disjunctive and Cumulative constraints, each of
which improves the complexity of the state-of-the-art algorithms by a factor of log n. We show …

In cumulative and disjunctive constraint-based scheduling, the resource constraint is
enforced by several filtering rules. Among these rules, we have (extended) edge-finding and …

Scheduling problems appear in many industrial problems with different facets and
requirements of a solution. A solution is a schedule of a set of activities subject to constraints …