Improving Local Search Heuristics for Some Scheduling Problems-I

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,,,, 11 precl c C, and 1 112 T, 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.

Topics

    4 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)