| 一种解决有限缓冲区流水车间调度问题的复合启发式算法 |
| |
| 引用本文： | 张培文,段俊华,李俊青.一种解决有限缓冲区流水车间调度问题的复合启发式算法[J].聊城大学学报(自然科学版),2012,25(2):66-73. |
| |
| 作者姓名： | 张培文 段俊华 李俊青 |
| |
| 作者单位： | 聊城大学计算机学院,山东聊城,252059 |
| |
| 摘 要： | 针对以最大完工时间为目标的有限缓冲区流水车间调度问题,提出了一种新的复合启发式算法.算法设计中首先使用PF-NEH算法进行解空间的搜索,并采用基于插入邻域和交换邻域的可变邻域搜索算法来增强局部搜索.仿真实验表明,该算法具有高效性和优越性.
|
| 关 键 词： | 有限缓冲区流水车间调度问题 PF-NEH启发式算法 变邻域搜索算法 |
A Composite Heuristic Algorithm for the Flowshop Scheduling Problem with Limited Buffer |
| |
| ZHANG Pei-wen,DUAN Jun-hua,LI Jun-qing.A Composite Heuristic Algorithm for the Flowshop Scheduling Problem with Limited Buffer[J].Journal of Liaocheng University:Natural Science Edition,2012,25(2):66-73. |
| |
| Authors: | ZHANG Pei-wen DUAN Jun-hua LI Jun-qing |
| |
| Institution: | (School of Computer Science,Liaocheng University,Liaocheng 252059,China) |
| |
| Abstract: | 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 algorithm was first utilized for evolutionary exploration among the solution space,and a variable neighborhood 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 algorithm. |
| |
| Keywords: | flowshop scheduling problem with limited buffer PF-NEH heuristic algorithm variable neighborhood search algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
