Suppose that a minimum makespan planning and scheduling problem is to be solved by logic-based Benders decomposition.
In the first iteration, Jobs 1, 2 and 3 are assigned to Machine A, on which (pA1, pA2, pA3) = (2, 3, 2).
Use release times (E1, E2, E3) = (0, 2, 2) and deadlines (L1, L2, L3) = (3, 5, 7). Write the appropriate Benders cut (3.138).