# Improving local search heuristics for some scheduling problems. Part II

Peter Brucker, Johann L. Hurink, Frank Werner

43 Citations (Scopus)
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on the set of feasible solutions of a discrete optimization problem. For the scheduling problems $Pm||C_{max}, 1|prec|\sum U_i,$ and a large class of sequencing problems with precedence constraints having local interchange properties 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. Computational results are presented.