To solve the problem, the following large neighborhoods are applied:

When applying these neighborhoods, only a subset of the decisions that are currently in the schedule solution is restored. These decisions are the start times, the end times, the durations and the processing times of the activities, and for the resource constraints, the previous, the setup, the teardown, the successors, the predecessors, the resource assignment and the capacity.

To turn this partial schedule to a complete solution, one must apply a search goal that is focused on a subpart of the problem. Notice that precedence information such as next, previous, setup, teardown, successors and predecessors are stored in the scheduler solution due to the use of the precedence graph.

The first two neighborhoods, IloRelocateActivityNHood and TimeWindowNHood, are predefined. RelocateJobNHood is a new neighborhood that is similar to the neighborhood IloRelocateActivityNHood, but instead of reconsidering the decisions related to one activity at a time, it reconsiders all the decisions related to a job.