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

Optimize flexible flow-shop scheduling using genetic algorithm

作　　者：周辉仁[1] 唐万生[1] 魏颖辉[2] 

机构地区：[1]天津大学电气与自动化工程学院,天津300072 [2]辽宁科技学院管理系,辽宁本溪117022

出　　处：《计算机工程与应用》2009年第30期224-226,233,共4页Computer Engineering and Applications

基　　金：辽宁省教育厅科研课题资助(No.20060439)

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

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

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]