一种求解单件车间调度问题的单亲遗传算法  

Partheno Genetic Algorithm for Solving Job-shop Scheduling Problem

作　　者：刘胜辉[1] 张淑丽[1] 王波[1] 滕春贤[1] 

机构地区：[1]哈尔滨理工大学软件学院,哈尔滨150080

出　　处：《计算机工程》2009年第5期188-190,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(69984002);哈尔滨市青年基金资助项目(2005AFQXJ034)

摘　　要：针对单件车间调度问题,设计一种基于整数编码的单亲遗传算法。该算法既具有单亲遗传算法运算量小、不存在"早熟收敛"现象等优点,在编码中又体现了单件车间调度的"保序性"等工艺约束条件,增强了调度算法的整体性能。对不同规模的FT类问题的仿真结果表明,该算法的收敛速度随着问题规模的增大而加快,并在求解单件车间调度问题时能得到稳定的满意解。A Integer Coded Partheno Genetic Algorithm（1PGA） is designed for Job-Shop Scheduling Problem（JSSP）. This algorithm strengthens the unitary capability of scheduling algorithm, not only has the virtue of PGA, such as small calculation capacity, no immature convergence and so on, but also incarnates technics constraint condition in coding, such as keeping job shop scheduling sequence. Considering different sizes of FT emulation results problems show that the convergence expedites as size extends, and can give good stable solutions for solving job shop problems.

关 键 词：单件车间调度 遗传算法 整数编码 收敛速度 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]