Apply the polynomial-time not-first algorithm to the example of Exercise.
Exercise
Consider the 3-machine disjunctive scheduling problem in which
(E1, E2, E3) = (2, 1, 0), (L1, L2, L3) = (6, 5, 8), p = (3, 2, 2)
Use the edge-finding conditions (3.112) to check for valid precedences, and update the bounds accordingly. Does edge finding identify all valid precedences?