Dynamic Sweep Filtering Algorithm for FlexC
Alban Derrien, Thierry Petit, Stephane Zampelli
TL;DR
This paper presents a dynamic sweep filtering algorithm for the FlexC global constraint to improve cumulative scheduling in uncertain environments using constraint programming.
Contribution
The paper introduces a novel dynamic sweep filtering algorithm specifically designed for the FlexC global constraint.
Findings
Enhanced scheduling efficiency in uncertain environments
Improved constraint propagation for FlexC
Potential for broader application in scheduling problems
Abstract
We investigate cumulative scheduling in uncertain environments, using constraint programming. We detail in this paper the dynamic sweep filtering algorithm of the FlexC global constraint.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Scheduling and Optimization Algorithms · Scheduling and Timetabling Solutions