Improving local search heuristics for some scheduling problems. Part II

https://doi.org/10.1016/S0166-218X(96)00036-4Get rights and content
Under an Elsevier user license
open archive

Abstract

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 PmCmax, 1 | prec | ∑ Ui, 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.

Cited by (0)

Supported by Deutsche Forschungsgemeinschaft (Project JoPTAG) and by Alexander von Humboldt Stiftung.

1

Supported by Deutsche Forschungsgemeinschaft (Project ScheMA) and by Alexander von Humboldt Stiftung.