Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (30): 224-226.DOI: 10.3778/j.issn.1002-8331.2009.30.066

• 工程与应用 • Previous Articles     Next Articles

Optimize flexible flow-shop scheduling using genetic algorithm

ZHOU Hui-ren1,TANG Wan-sheng1,WEI Ying-hui2   

  1. 1.School of Electrical Engineering & Automation,Tianjin University,Tianjin 300072,China
    2.Department of Management,Liaoning Institute of Science and Technology,Benxi,Liaoning 117022,China
  • Received:2008-11-24 Revised:2009-02-10 Online:2009-10-21 Published:2009-10-21
  • Contact: ZHOU Hui-ren

柔性Flow-Shop调度的遗传算法优化

周辉仁1,唐万生1,魏颖辉2   

  1. 1.天津大学 电气与自动化工程学院,天津 300072
    2.辽宁科技学院 管理系,辽宁 本溪 117022
  • 通讯作者: 周辉仁

Abstract: Flexible Flow-shop Scheduling Problem(FFSP) is expansion of general flow-shop scheduling problem.It is more complex than general flow-shop scheduling problem because there are parallel machines on some operations.In order to efficiently solve this problem,a new method solving flexible flow-shop scheduling problem based on genetic algorithm is proposed.A new improved encoding and decoding with matrix method for the flexible flow-shop scheduling problem are proposed.These operators can easily keep the feasibility of solution.Finally,an example of production scheduling problem for metalworking workshop in a car engine plant is simulated.Through comparison,the results show the effectiveness of the algorithm.

Key words: flexible flow-shop scheduling, genetic algorithm, encoding method, decoding with matrix form

摘要: 柔性Flow-shop调度问题(Flexible Flow-shop Scheduling Problem,FFSP)是一般Flow-shop调度问题的推广,由于在某些工序上存在并行机器,所以比一般的Flow-shop调度问题更复杂。为了有效地解决柔性Flow-shop调度问题,用遗传算法求解,给出了一种改进的编码方法,能够保证个体的合法性;并根据编码方法提出了矩阵解码方法。最后以某汽车发动机厂金加工车间的生产调度实例进行仿真,通过比较表明了算法的有效性。

关键词: 柔性Flow-shop调度, 遗传算法, 编码方法, 矩阵解码

CLC Number: