摘要在当前现代化生产的大环境下，客户对产品的需求要求越来越严格，企业由于产品生产周期的缩短要求自身的管理体系和技术水平越发的严格。车间调度就是生产、管理的主要手段之一。车间调度的优化大大提高了车间的生产效率，并降低资源平白损耗，使企业更加有竞争力。文中对调度问题的几种优化方法做出了一定的介绍，同时阐释了遗传算法、模拟退火法、拉格朗日松弛法及神经网络法等方法的发展轨迹，并对这些方法的特点进行了描述。73699

本文着重采用遗传算法来求解车间调度优化问题。通过对遗传算法的基本思想，基本流程和算子选择、交叉、变异的理解，及其特点的分析，确定了本文以遗传算法求解作业车间调度问题的合理性。针对车间调度问题特点，重新设计了遗传算法的基本流程，并对部分算法做了修订。对MATLAB进行算法仿真，得到算法有各种参数差异影响的仿真图和对应的甘特图，最后再由仿真结果进行分析，得出结论表明遗传算法对车间调度优化问题的可行性和有效性。

 该论文有表6个，图24幅，参考文献16篇。

毕业论文关键词： 作业车间调度  遗传算法  MATLAB仿真

Research on Job Shop Scheduling Problem Based on Genetic Algorithm

Abstract In the current environment of modern production, the demand for products is more and more strict, and the enterprise's management system and technical level are more and more strict because of the shortening of production cycle。 Job shop scheduling is one of the main means of production and management。 Job shop scheduling optimization greatly improves the production efficiency of the workshop, and reduce the resources for loss and make the enterprise more competitive。 The development path of the scheduling problem of several optimization method makes some introduction, and also explains the genetic algorithm, simulated annealing method, Lagrange relaxation method and artificial neural network (ANN) method, and the characteristics of these methods are described。

In this paper, genetic algorithm is used to solve the job shop scheduling problem。 Through the basic idea of genetic algorithm, the basic process and the operator selection, crossover, variation of understanding, and the characteristics of the analysis, to determine the genetic algorithm to solve job shop scheduling problem is reasonable。 In view of the characteristic of job shop scheduling problem, the basic process of genetic algorithm is redesigned, and some algorithms are revised。 On the MATLAB for simulation algorithm, the algorithm is obtained with the differences between the various parameters affect the simulation diagram and the corresponding Gantt chart。 Finally the simulation results are analyzed and came to the conclusion that the genetic algorithm for job shop scheduling optimization problem is feasible and effective。 

The paper has tables 6, figures 24, 16 references。

Key words:  job shop scheduling  genetic algorithms  simulation of MATLAB 

目  录

摘  要 I

Abstract II

图清单 1

表清单 2

1 绪论 1

1。1 引言 1

1。2 课题研究目的及意义 1

1。3 车间调度优化方案的研究现状 1

1。4 车间调度问题的分类及特点 3

1。5 研究方法、技术路线 3

1。6 本文章节