Improving local search heuristics for some scheduling problems .1.

Abstract

Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on a set of feasible solutions of a discrete optimization problem. For the scheduling problems P2 // C-max, 1/prec/ Sigma C-i and 1 // Sigma T-i we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that are locally optimal.