Suppose that a Benders method is applied to a minimum makes pan planning and cumulative scheduling problem.
In the first iteration, Jobs 1, 2 and 3 are assigned to machine A, on which the resource capacity is 2, (pA1, pA2, pA3) = (1, 1, 2), and (cA1, cA2, cA3) = (2, 1, 1).
All the release times are zero, and all the deadlines are 4. Write the Benders cut (3.164).