一种解决有限缓冲区流水车间调度问题的复合启发式算法  

A Composite Heuristic Algorithm for the Flowshop Scheduling Problem with Limited Buffer

作　　者：张培文[1] 段俊华[1] 李俊青[1] 

机构地区：[1]聊城大学计算机学院,山东聊城252059

出　　处：《聊城大学学报（自然科学版）》2012年第2期66-73,共8页Journal of Liaocheng University:Natural Science Edition

基　　金：国家自然科学基金(61104179)

摘　　要：针对以最大完工时间为目标的有限缓冲区流水车间调度问题,提出了一种新的复合启发式算法.算法设计中首先使用PF-NEH算法进行解空间的搜索,并采用基于插入邻域和交换邻域的可变邻域搜索算法来增强局部搜索.仿真实验表明,该算法具有高效性和优越性.A new composite heuristics algorithm was presented for solving the limited buffers flow shop scheduling problems with objectives of minimizing the makespan. In this algorithm,PF-NEH algo- rithm was first utilized for evolutionary exploration among the solution space, and a variable neighbor- hood search algorithm based on insert neighborhood and swap neighborhood was also applied to improve the local search. Computational results showed the effectiveness and superiority of the proposed algo- rithm.

关 键 词：有限缓冲区流水车间调度问题 PF-NEH启发式算法 变邻域搜索算法 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]