Incremental Propagation Rules for a Precedence Graph with Optional Activities and Time Windows

Abstract

Constraint-based scheduling is a powerful tool for solving complex real-life scheduling problems. This paper describes new incremental propagation rules integrating propagation of precedence relations and time windows for activities allocated to a disjunctive resource.

Moreover, the rules also cover so called optional activities that may or may not be present in the final schedule.

Keywords

• Propagation Rules
• Precedence Graph
• Optional Activities
• Time Windows