Improving local search heuristics for some scheduling problems. Part II

Peter Brucker, Johann L. Hurink, Frank Werner

Research output: Contribution to journalArticleAcademicpeer-review

44 Citations (Scopus)
199 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)47-69
Number of pages23
JournalDiscrete applied mathematics
Issue number1-2
Publication statusPublished - 10 Jan 1997


Dive into the research topics of 'Improving local search heuristics for some scheduling problems. Part II'. Together they form a unique fingerprint.

Cite this