聊城大学学报：自然科学版2012，Vol.25Issue(2)：66-73,8.
一种解决有限缓冲区流水车间调度问题的复合启发式算法
A Composite Heuristic Algorithm for the Flowshop Scheduling Problem with Limited Buffer
摘要
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 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启发式算法/变邻域搜索算法Key words
flowshop scheduling problem with limited buffer/PF-NEH heuristic algorithm/variable neighborhood search algorithm分类
计算机与自动化引用本文复制引用
张培文,段俊华,李俊青..一种解决有限缓冲区流水车间调度问题的复合启发式算法[J].聊城大学学报：自然科学版,2012,25(2):66-73,8.基金项目
国家自然科学基金 （）
