Scheduler Engine provides the edge finder as a way to increase propagation for discrete and unary resources.

You can influence the level of constraint propagation when using disjunctive constraints. Rather than considering only pairs of activities {A1 A2} to prove that A1 must precede A2 or vice-versa, the constraint propagation process can consider all pertinent tuples {A1 ... An} of activities to prove that some activity Ai must execute first (or must execute last) among {A1 ... An}. You can switch this extra propagation on or off with the member function IlcDiscreteResource::setEdgeFinder.

The edge finder takes the break list on the resource into account, that is, it uses the fact that by default, activities cannot be processed inside breaks. The edge finder also uses the information that some activities can have an overlap with breaks. The edge finder does not use the eventually available timetable of the resource at hand.

See Also

Disjunctive Constraint, IlcDiscreteResource