An adaptive hybrid metaheuristic for permutation flowshop scheduling

An adaptive hybrid metaheuristic for permutation flowshop scheduling

0.00 Avg rating0 Votes
Article ID: iaor2009238
Country: Poland
Volume: 29
Issue: 3
Start Page Number: 761
End Page Number: 771
Publication Date: Jan 2000
Journal: Control and Cybernetics
Authors: ,
Keywords: optimization: simulated annealing, heuristics: tabu search
Abstract:

The paper presents a hybrid Tabu Search–Simulated Annealing heuristic for the minimal makespan flowshop sequencing problem. In order to evaluate the effectiveness of the hybridisation the authors compare the hybrid metaheuristic with pure Tabu Search and Simulated Annealing heuristics. The results from computational experiments are discussed.

Reviews

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