A fast tabu search algorithm for the permutation flow-shop problem

被引：312

作者：

Nowicki, E

Smutnicki, C

机构：

[1] Institute of Engineering Cybernetics, Tech. University of Wrocław, 50-372 Wroclaw

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 91卷 / 01期

关键词：

flow-shop scheduling; heuristics; tabu search;

D O I：

10.1016/0377-2217(95)00037-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation Row shop is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition which employs a block of jobs notion. Computational experiments (up to 500 jobs and 20 machines) show its excellent numerical properties.

引用

页码：160 / 175

页数：16

共 26 条

[1] RESTRICTED NEIGHBORHOOD IN THE TABU SEARCH FOR THE FLOWSHOP PROBLEM [J].