Improving local search heuristics for some scheduling problems .1.

Autor(en): Brucker, P
Hurink, J
Werner, F
Stichwörter: Mathematics; Mathematics, Applied
Erscheinungsdatum: 1996
Herausgeber: ELSEVIER SCIENCE BV
Journal: DISCRETE APPLIED MATHEMATICS
Volumen: 65
Ausgabe: 1-3
Startseite: 97
Seitenende: 122
Zusammenfassung: 
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/ Sigma C-i and 1 // Sigma 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.
ISSN: 0166218X
DOI: 10.1016/0166-218X(95)00030-U

Show full item record

Page view(s)

1
Last Week
0
Last month
1
checked on Feb 23, 2024

Google ScholarTM

Check

Altmetric