As Described in the Last step of Algorithm
2 g) If we are at level 0, and we had no success in placing A_i, place it like in steps (2 b) and (2 c), but without recursion. We have now 3 - 1 = 2 more activities to place. Go to step (2) (some methods to avoid cycling are used here).
We couldn't get what this exactly mean?
We couldn't decide where to put the conflicts generated after placing A_i as described by step 2 g). Should We add these generated conflicts to the original list of Activities in newly sorted order and repeat the algorithm from starting?
2 g) If we are at level 0, and we had no success in placing A_i, place it like in steps (2 b) and (2 c), but without recursion. We have now 3 - 1 = 2 more activities to place. Go to step (2) (some methods to avoid cycling are used here).
We couldn't get what this exactly mean?
We couldn't decide where to put the conflicts generated after placing A_i as described by step 2 g). Should We add these generated conflicts to the original list of Activities in newly sorted order and repeat the algorithm from starting?
