一种求解带有阻塞限制的混合流水车间的禁忌搜索算法  

A Tabu Search Algorithm for Hybrid Flow Shop Problem with Blocking Constraint

作　　者：陈璐[1,2] 奚立峰[1] 蔡建国[1] Nathalie Bostel Pierre Dejax 

机构地区：[1]上海交通大学机械与动力工程学院 [2].Dept.of Automatic Control and Industrial Eng., [3]IRCCyN-Institute de Recherche en Communication et Cybernétique de Nantes,FranceI UT de Saint Nazaire de l'universitéde Nantes,Département GLT,58 rue Michel Ange,44606 Saint Nazaire Cedex,France [4]Dept.of Automatic Control and Industrial Eng.,Ecole des Mines de Nantes,La Chantrerie,F-44070 Nantes Cedex 03,France [5]I UT de Saint Nazaire de l’universitéde Nantes,Département GLT,58 rue Michel Ange,44606 Saint Nazaire Cedex,France

出　　处：《上海交通大学学报》2006年第5期856-859,共4页Journal of Shanghai Jiaotong University

摘　　要：针对带有阻塞限制的混合流水车间调度问题,提出一种禁忌搜索算法和优先级规则相结合的方法.开发了启发式调度算法求出问题初始解,应用禁忌搜索算法对工件在第一级的排序进行优化,采用优先级规则进行其他级工件的排序.实验结果表明,该方法大大缩减了搜索空间,能够较好地解决此类调度问题.A tabu search algorithm combined with priority rules was proposed to solve the Hybrid Flow Shop （HFS） scheduling problem with blocking constraint. Heuristics algorithms are developed to generate the initial solution. The tabu search is restricted in the processing order of the first stage, while the whole schedule is built using priority rules. The computational experiments show that this approach reduces the searching space and has a good result for the addressed problem.

关 键 词：混合流水车间 禁忌搜索 启发式算法 优先级规则 

分 类 号：TP29[自动化与计算机技术—检测技术与自动化装置]