A number of projects must be carried out in a shop, and each project j must start and finish within a time window [rj , dj ]. Once started, the project must run pj days without interruption. Only one...

A number of projects must be carried out in a shop, and each project j

must start and finish within a time window [rj , dj ]. Once started, the project

must run pj days without interruption. Only one project can be underway at

any one time. Each month, the shop is shut down briefly to clean and maintain

the equipment, and no project can be in process during this period. The goal

is to find a feasible schedule. Formulate this problem and indicate how to solve

it with logic-based Benders decomposition. Hint: Let each month’s schedule

be a subproblem.