摘要
In this paper we present a hybrid Tabu Search Simulated Annealing heuristic for the minimal makespan flowshop sequencing problem. In order to evaluate the effectiveness of the hybridization we compare the hybrid metaheuristic with pure Tabu Search and Simulated Annealing heuristics. The results from computational experience are discussed.
学科与关键词
关键词
flowshop sequencinghybrid metaheuristicstabu searchsimulated annealing
文献加载失败,请重试
重试