Roger Kameugne

Learn More
The cumulative scheduling constraint, which enforces the sharing of a finite resource by several tasks, is widely used in constraint-based scheduling applications. Propagation of the cumulative constraint can be performed by several different filtering algorithms, often used in combination. One of the most important and successful of these filtering(More)
A scheduling problem consists in planning the execution of a set of tasks under resource and temporal constraints. It is an NP-hard combinatorial problem even if only one resource is considered. In this thesis, we use the constraint programming approach to solve the nonpreemptive cumulative scheduling problem. We focus particularly on resource constraint(More)
Edge-finding, extended edge-finding, not-first/not-last and energetic reasoning are well-known filtering rules used in constraint-based scheduling problems for propagating constraints over disjunctive and cumulative resources. In practice, these filtering algorithms frequently form part of a sequence to form a more powerful propagator, thereby helping to(More)
  • 1