Local Search in Scheduler

This part of the manual examines ways to use, guide, and modify search within Scheduler.

Using the local search facilities of IBM® ILOG® Solver, it is possible to construct local search algorithms in Scheduler. In particular, rather than conducting your local search with Solver semantics (that is, referring to variables and values) you can conduct it using Scheduler semantics. This means that you can create neighborhoods and metaheuristics using Scheduler objects such as activities and resource constraints.

As the local search in Scheduler is based on the local search facilities in Solver, it is recommended that you have a strong understanding of the local search in Solver. See the IBM ILOG Solver User's Manual.

In Shuffling as Local Search in Scheduler we present an implementation of the shuffling technique using the local search infrastructure. This chapter demonstrates the creation of a custom neighborhood and its use within a standard pattern for local search implementation.

Tabu Search for the Jobshop Problem builds on the previous chapter by implementing a tabu search metaheuristic on top of one of the standard job shop scheduling neighborhoods from the research literature.

Tabu Search for the Jobshop Problem with Alternatives further extends the tabu search by introducing a second neighborhood consisting of moving a resource constraint from its existing resource to one of its other alternatives.

Large Neighborhood Search for the Jobshop Problem with Alternatives approaches the joshop problem with large neighborhood search. Two predefined and one custom neighborhood are used in the search.

PREVIOUS NEXT