IBM ILOG Scheduler User's Manual > Local Search in Scheduler > Large Neighborhood Search for the Jobshop Problem with Alternatives

Large Neighborhood Search for the Jobshop Problem with Alternatives

 INDEX Gray bullet PREVIOUS NEXT

In Tabu Search for the Jobshop Problem with Alternatives, we described a local search algorithm to solve a problem where two types of decisions must be made: the resource assigned to each activity, and the sequence of activities on each resource. In this section, we consider another approach based on large neighborhood search. Three different large neighborhoods are applied. Two are pre-defined neighborhoods, and the other one is a dedicated neighborhood for the jobshop scheduling problem.

© Copyright IBM Corp. 1987, 2009. Legal terms. PREVIOUS NEXT