• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (7): 108-112.

• 论文 • 上一篇    下一篇

基于和声搜索的阻塞流水车间调度问题的算法优化

包云,姜华,郑丽萍   

  1. (聊城大学计算机学院,山东 聊城 252059)
  • 收稿日期:2012-04-05 修回日期:2012-08-13 出版日期:2013-07-25 发布日期:2013-07-25
  • 基金资助:

    山东省自然科学基金资助项目(J11LG02);聊城大学自然科学基金资助项目(X10019)

Optimization algorithm based on HS
to solve blocking flow shop scheduling problems 

BAO Yun,JIANG Hua,ZHENG Liping   

  1. (School of Computer Science,Liaocheng University,Liaocheng 252059,China)
  • Received:2012-04-05 Revised:2012-08-13 Online:2013-07-25 Published:2013-07-25

摘要:

针对以最大完工时间为目标的阻塞流水车间调度问题,提出了一种通过混合和声搜索改进遗传算法的优化求解算法。构建了阻塞流水车间调度原理图并描述了运算方法;详细论述了混合算法的实施流程和关键问题,并使用NEH方法和局部搜索对混合算法进行了改进。仿真结果表明,改进后的混合算法能显著提高优化阻塞流水车间调度问题的解。

关键词: 阻塞流水车间调度, 和声搜索, 遗传算法, 局部搜索, NEH启发式搜索

Abstract:

An improved GA scheduling algorithm (IHSGA) base on HS is  firstly proposed to solve the blocking flow shop scheduling problems(BFSP) with the objective of minimizing the makespan of the jobs in the literature. The BFSP scheduling principle figure is constructed and the process of operation method is described. The application steps and the key problems of hybrid algorithm are discussed in detail and NEH & local search methods are used to improve the hybrid. Simulation results show that IHSGA algorithms can obtain a better solution than other algorithms.

Key words: blocking flow shop;harmony search;genetic algorithm;local search;NEH heuristic