Improving local search heuristics for some scheduling problems -- I

Peter Brucker, Johann L. Hurink, Frank Werner

Research output: Contribution to journalArticleAcademicpeer-review

39 Citations (Scopus)
463 Downloads (Pure)


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|\sum C_i$ and $1||\sum 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.
Original languageEnglish
Pages (from-to)97-122
Number of pages26
JournalDiscrete applied mathematics
Issue number1-3
Publication statusPublished - 7 Mar 1996


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

Cite this