ADVANCED SEARCH TECHNIQUES FOR THE JOB-SHOP PROBLEM - A COMPARISON

Authors
TADEI R DELLACROCE F MENGA G
Citation
R. Tadei et al., ADVANCED SEARCH TECHNIQUES FOR THE JOB-SHOP PROBLEM - A COMPARISON, RAIRO. Recherche operationnelle, 29(2), 1995, pp. 179-194
Citations number
25
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
RAIRO. Recherche operationnelle → ACNP
ISSN journal
03990559
Volume
29
Issue
2
Year of publication
1995
Pages
179 - 194
Database
ISI
SICI code
0399-0559(1995)29:2<179:ASTFTJ>2.0.ZU;2-7
Abstract
Recently several new heuristic search techniques have been used in mac hine scheduling. In this paper we make some methodological and computa tional comparisons between such techniques as bottleneck-based algorit hms (Shifting Bottleneck), deterministic neighborhood search procedure s (Tabu Search), random oriented local search techniques (Simulated An nealing and Genetic Algorithms) and Lagrangian relaxation approaches.