Consider a cumulative scheduling problem with four jobs in which p = (5, 3, 3, 3), c = (1, 2, 2, 1), and the resource limit is 3.
The release times are (E1,...,E4) = (0, 2, 2, 2), and the deadlines are (L1,...,L4) = (9, 8, 8, 8).
Apply the extended edge-finding rules and update the bounds accordingly.
Does extended edge finding identify a valid precedence that is not identified by ordinary edge finding?