Change the deadlines in the problem of exercise to l1 l2 l3

Question

Change the deadlines in the problem of Exercise to (L₁, L₂, L₃) = (2, 1, 4).

Write the Benders cut (3.165). S

how that the stronger cut (3.164) is not valid in this case.

Exercise :

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, (p_A1, p_A2, p_A3) = (1, 1, 2), and (c_A1, c_A2, c_A3) = (2, 1, 1). All the release times are zero, and all the deadlines are 4. Write the Benders cut (3.164).