Improving local search heuristics for some scheduling problems - I

Brucker, Peter and Hurink, Johann and Werner, Frank (1996) Improving local search heuristics for some scheduling problems - I. Discrete Applied Mathematics, 65 (1-3). pp. 97-122. ISSN 0166-218X

Preview

PDF
1724Kb

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_{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.
Item Type:	Article
Copyright:	© 1996 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/66535
Official URL:	http://dx.doi.org/10.1016/0166-218X(95)00030-U
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page