Advanced search techniques for the job shop problem: A comparison

Advanced search techniques for the job shop problem: A comparison

0.00 Avg rating0 Votes
Article ID: iaor1997869
Country: France
Volume: 29
Issue: 2
Start Page Number: 179
End Page Number: 194
Publication Date: Apr 1995
Journal: RAIRO Operations Research
Authors: , ,
Keywords: optimization: simulated annealing
Abstract:

Recently several new heuristic search techniques have been used in machine scheduling. In this paper the authors make some methodological and computational comparisons between such techniques as bottleneck-based algorithms (Shifting Bottleneck), deterministic neighborhood search procedures (Tabu Search), random oriented local search techniques (Simulated Annealing and Genetic Algorithms) and Lagrangian relaxation approaches.

Reviews

Required fields are marked *. Your email address will not be published.