An adaptive hybrid metaheuristic for permutation flowshop scheduling

被引：0

作者：

Moccellin, JV ^{[1
]}

dos Santos, MO ^{[1
]}

机构：

[1] Univ Sao Paulo, Sao Carlos, SP, Brazil

来源：

CONTROL AND CYBERNETICS | 2000年 / 29卷 / 03期

关键词：

flowshop sequencing; hybrid metaheuristics; tabu search; simulated annealing;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：761 / 771

页数：11