文献类型：期刊文献

中文题名：一种改进的车间调度问题算法

英文题名：Improved Algorithm for Job-shop Scheduling Problems

作者：王秋芬[1];杨泽平[2];梁道雷[3]

机构：[1]南阳理工学院计算机与信息工程学院,南阳473004;[2]华东理工大学信息科学工程学院,上海200237;[3]浙江理工大学理学院,杭州310018

年份：2013

卷号：21

期号：11

起止页码：2997

中文期刊名：科学技术与工程

外文期刊名：Science Technology and Engineering

收录：CSTPCD;;北大核心:【北大核心2011】；

基金：国家自然科学基金项目(90818013);浙江理工大学基金项目(yb07002);河南省国际科技合作计划项目(094300510027)资助

语种：中文

中文关键词：两层编码;遗传算法;车间调度问题;收敛性

外文关键词：two-layer encoding genetic algorithm job-shop scheduling problems the convergence

摘要：分析了求解车间调度问题的多种方法,建立了基于集合论的数学模型,研究了两层编码遗传算法在车间调度问题中的具体应用,包括编码格式、适应度度量、遗传算子等。提出了一种基于两层编码遗传算法的车间调度算法,并用三个实例验证了算法的有效性。实验结果表明:提出的车间调度算法在求解速度和求解质量上都有明显改进。
Many methods of solving job-shop scheduling problems were analyzed. Mathematical models were established based on set theory. The two-layer encoding GA is adopted to solve the job-shop scheduling problems, including encoding formats, fitness measurements, genetic operators, and so on. It proposed a job-shop scheduling algorithm of based on two-layer encoding GA and verified the validity of the algorithm through some running results of three instances. The experimental results show that the quality of solution and time consuming are obviously im- proved.