Improving local search heuristics for some scheduling problems. Part II

Share/Save/Bookmark

Brucker, Peter and Hurink, Johann and Werner, Frank (1997) Improving local search heuristics for some scheduling problems. Part II. Discrete Applied Mathematics, 72 (1-2). pp. 47-69. ISSN 0166-218X

open access
[img]
Preview
PDF
1MB
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 $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.
Item Type:Article
Copyright:© 1997 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63602
Official URL:http://dx.doi.org/10.1016/S0166-218X(96)00036-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page