摘要
作业调度问题(JSP)是一类典型的NP-hard问题,遗传算法作为一种通用的优化算法在求解JSP中得到了广泛的应用。针对车间作业优化调度问题,通过对原有遗传算法进行了改进,建立了具体的基于遗传算法的改进模型,使其在优化过程中自动给出比较合适的交叉概率和变异概率,并保持群体的多样性,方法和解决步骤,显著提高了搜索效率。较好地解决了车间资源优化调度问题。
The job scheduling problem (JSP) is one of the most typical optimization problems. GA(Genetic Algorithm ) as a current optimized algorithm ,has been used widely for JSP. It automatically computes the crossover probability and mutation probability based on primary Genetic Algorithm and keep the multiplicity of colony,Evidently improve the efficiency of search. It constructs the improved model of Genetic Algorithm,methods and steps. And preferably sloving the problem of the job scheduling.
出处
《国防制造技术》
2013年第2期44-47,共4页
Defense Manufacturing Technology
关键词
生产调度
遗传算法
改进的遗传算法
适应度
job scheduling problem
genetic algorithm
improved genetic algorithm
adaptation degree
