Suppose that a minimum makespan planning and scheduling

Question

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 (p_A1, p_A2, p_A3) = (2, 3, 2). Use release times (E₁, E₂, E₃) = (0, 2, 2) and deadlines (L₁, L₂, L₃) = (3, 5, 7).

Write the appropriate Benders cut (3.138).