Consider a cumulative scheduling problem with four jobs in which p = (3, 3, 4, 3), c = (2, 2, 1, 1), and the resource limit is 3.
The release times are (E1,...,E4) = (1, 1, 1, 0), and all the deadlines are 7.
Apply the not-first/not-last rules and update the bounds accordingly. Does this identify any precedences not identified by edge finding?