基于改进遗传算法的Job-shop调度问题  

Jobshop Scheduling Problems Based on Improved Genetic Algorithm

作　　者：卢厚清[1] 张永利[1] 余勤[1] 李宏伟[1] 

机构地区：[1]解放军理工大学工程兵工程学院,江苏南京210007

出　　处：《江南大学学报（自然科学版）》2006年第4期431-435,共5页Joural of Jiangnan University (Natural Science Edition)　

摘　　要：建立了作业调度问题的模型,阐明了遗传算法是一种有效的全局随机优化方法,并将遗传算法用于Job-shop调度问题的研究中.针对标准遗传算法计算费时、稳定性差等不足,从适应度尺度变换、稳态繁殖、自适应遗传参数等方面作了改进.给出了基于改进遗传算法的模型求解方法和步骤.经过实例计算,取得了良好的调度效果,表明该方法可为制定工程装备作战保障的指挥自动化决策提供科学、有效的支持.In order to find global optimal results efficiently in Job-shop, traditional GAs were improved and used to study this problem. Genetic algorithm had disadvantages of slow convergence and poor stability in practical engineering. To overcome these problems, an improved genetic algorithm was proposed in terms of genetic operators, etc. Besides, the steps to solve the optimal model were put forward. With this model, ideal results were obtained. This shows that the method can offer a scientific and effective support for a decision maker in command automation of the engineering equipment＇s rush-repairs in battlefield.

关 键 词：工程装备 战场抢修 车间调度 遗传算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]