基于遗传算法的Job-Shop调度问题研究  

Studies on Job-Shop Scheduling Problems Based on Genetic Algorithms

作　　者：陶泽[1] 张海涛[1] 

机构地区：[1]沈阳理工大学机械工程学院,沈阳110159

出　　处：《沈阳理工大学学报》2016年第2期60-64,共5页Journal of Shenyang Ligong University

摘　　要：研究单目标作业车间调度问题(JSP),提出了一种基于遗传算法以缩短生产周期为目标的Job-Shop调度问题。通过建立数学模型,设置编码、解码方案,以及确定选择、交叉、变异等遗传算子,充分利用遗传算法的特点解决加工车间静态、动态问题,并通过Gantt图给出调度方案。结合应用实例进行分析,分析结果表明该方法是有效的、可行的。The single target job-shop scheduling problem（ JSP is focused on）; First of all,a genetic algorithm is proposed to shorten the production cycle of job shop schedule; Secondly,through mathematical model establishment,g enetic algorithm of characteristics is applied to solve the processing plant static and dynamic problems by setting the encoding and decoding scheme and determining the selection,crossover and mutation genetic operators,and genetic algorithm of characteristics is applied to solve the processing plant static and dynamic problems,which is given by the Gantt chart scheduling scheme; Finally,with the analysis of example, the results show that the method is effective and feasible.

关 键 词：作业车间调度 遗传算法 Gantt图 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]