Dynamic Sweep Filtering Algorithm for FlexC

This work addresses scheduling problems under uncertainty for operations research or AI planning, but appears incremental as it builds on existing FlexC constraint methods.

The paper tackles cumulative scheduling in uncertain environments using constraint programming, resulting in the dynamic sweep filtering algorithm for the FlexC global constraint.