## [Part10] Disjunctive Constraint

##### Question 1: Decomposition

Which approach obtains the strongest filtering for a disjunctive resource (select the two approaches if you think they are equivalent):

##### Question 2: Filtering Rules

Which of the following filtering rules corresponds to the "Not-Last" reasoning?

##### Question 3: Earliest Completion Time

Consider a set of activities {a1,a2,a3} where:

• a1 has duration 2 and the domain of start(a1) is [2..3]
• a2 has duration 3 and the domain of start(a2) is [4..10]
• a3 has duration 4 and the domain of start(a3) is [2..5]

What is ect({a1,a2,a3})?

##### Question 4: Latest Completion Time

Consider a set of activities {a1,a2,a3} where:

• a1 has duration 2 and the domain of start(a1) is [2..3]
• a2 has duration 3 and the domain of start(a2) is [4..10]
• a3 has duration 4 and the domain of start(a3) is [2..5]

What is lct({a1,a2,a3})?

##### Question 5: Theta-Tree

In a theta-tree, the activities (which are not necessarily inserted yet) are given a position in the leaf nodes such that: