Improving local search heuristics for some scheduling problems .2.
Autor(en): | Brucker, P Hurink, J Werner, F |
Stichwörter: | COMPLEXITY; Mathematics; Mathematics, Applied | Erscheinungsdatum: | 1997 | Herausgeber: | ELSEVIER SCIENCE BV | Journal: | DISCRETE APPLIED MATHEMATICS | Volumen: | 72 | Ausgabe: | 1-2 | Startseite: | 47 | Seitenende: | 69 | Zusammenfassung: | 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 parallel to C-max, 1precSigma 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. |
Beschreibung: | Workshop on Models and Algorithms for Planning and Scheduling Problems, LOVENO DI MENAGGIO, ITALY, JUN 14-18, 1993 |
ISSN: | 0166218X | DOI: | 10.1016/S0166-218X(96)00036-4 |
Zur Langanzeige
Seitenaufrufe
2
Letzte Woche
0
0
Letzter Monat
1
1
geprüft am 01.06.2024