【作者】 陈伟；

【导师】 张华；

【作者基本信息】 武汉科技大学 ， 机械设计及理论， 2005， 硕士

【摘要】 绿色制造是一种具有显著社会效益和经济效益的现代制造模式,因此是当前国内外研究的前沿和热点课题。车间调度作为绿色制造系统运筹技术,管理技术与优化技术发展的核心,在绿色制造相关理论研究中占有重要的地位。车间调度问题是组合优化问题,属于N-P难题,近年来各种智能优化方法逐渐应用到车间调度问题中来,遗传算法是其中一种重要而有效的算法。 本文应用遗传算法求解面向绿色制造的车间调度问题,从作业车间调度和流水车间调度两个方面,主要做了以下的研究工作: 1.针对传统遗传算法在解决大规模作业车间调度问题时进化速度过慢和过早收敛问题,提出了一种嫁接遗传算法成功应用于作业车间调度。应用混合式嫁接遗传算法解决多资源作业车间调度。针对面向绿色制造的作业车间双向调度问题,提出了一种基于遗传算法的解决策略,并对不同规模的问题进行了求解。 2.对面向绿色制造的确定型及模糊型流水车间调度问题,分别应用遗传算法进行求解和仿真。 3.利用遗传算法解决面向绿色制造的流水车间作业排序问题。更多还原

【Abstract】 Green manufacturing system is a contemporary manufacturing mode which can greatly promote the synthesized economic profit of the enterprise, thus it has become the hotspot of the research and application of all kinds of enterprise. It is very important to study shop floor scheduling problems in Green Manufacturing basic theory for fully exerting its high efficiency and flexibility. The shop floor scheduling is principle problem for the development of operation, management and optimization techniques in manufacturing system. Shop floor scheduling is a combinatorial optimization problem, which belongs to N-P problem. Many intelligent computation methods are introduced into scheduling problem in recent years, genetic algorithm(GA) is one of the most important methods.In this paper, GA is applied to solve complex shop floor scheduling problem for green manufacturing. I have made some research in the following aspects:1. In order to overcome the limitations of low convergence rate and premature convergence appearing in standard GA, an Grafted Genetic Algorithm is proposed and applied in the Job-shop scheduling problem constrained by machines, workers , robots and green factors. This work presents a bi-directional scheduling approach on the basis of combining genetic algorithm to address the job-shop scheduling problem in green manufacturing system.2. To the standard flow-shop scheduling problem and fuzzy flow-shop scheduling problem, a solution method based on hybrid Genetic Algorithm is proposed.3. A kind of Genetic Algorithm is made for solving the flow-shop sequencing problems and proved suitable to the problems.更多还原