Suppose that a benders method is applied to a minimum total

Question

Suppose that a Benders method is applied to a minimum total tardiness planning and scheduling problem.

In the first iteration, Jobs 1, 2, 3 and 4 are assigned to Machine A, on which (p_A1, p_A2, p_A3, p_A4) = (1, 1, 2, 2). The release times are (E₁,...,E₄) = (0, 0, 2, 0) and the due dates are (L₁,...,L₄) = (2, 2, 3, 5).

Write the resulting Benders cut (3.147).