节点文献

基于Petri网和混合遗传算法的JSP优化调度

Petri Nets and Hybrid Genetic Algorithm Based Approach for JSP Scheduling Optimization

【作者】 陶泽

【导师】 谢里阳; 郝长中;

【作者基本信息】 东北大学 , 机械设计及理论, 2006, 博士

【摘要】 本文以带有控制器的Petri网和混合遗传算法为工具,对具有多工艺加工路径的生产车间调度问题进行研究。该算法不仅通过与其他学者提出的算法相比较,而且通过了标准算例的验证,证明了其正确性和优越性。针对受双资源制约的动态生产车间调度问题,提出并研究了新的调度策略和方法,并给出了最佳调度策略。本文的研究结果和内容可概括为以下的几个主要方面: 利用局部设计和Petri网简化技术提出了一种实现库所和变迁混合不等式约束Petri网反馈控制器的新方法,该方法计算简单无需搜索整个系统的状态空间,因此在计算效率上具有明显的优势,尤其是对规模较大的系统,其优势更加明显。 以带有控制器的Petri网为建模工具研究了单资源生产车间调度优化问题,应用了一种将遗传算法和模拟退火算法相结合的调度算法,将加工计划与生产调度同时考虑。通过仿真实验证明了其正确性和优越性。 在双资源静态调度问题的基础上,对于机床设备/工人受制约的动态调度问题进行了重点研究。对机床故障、工人离岗、定单取消等基于时间和任务进行分类,决定是否执行再调度。尤其重要的是提出了处理紧急工件的新方法,把剩余任务和紧急任务当成两个独立的任务分别处理,在紧急任务为最优调度的基础上选取剩余任务的最优调度,该方法不仅实现了总体最优,而且局部也是最优的。 最后,用Delphi开发了实用性的生产车间调度软件。以XML为数据存储方式,并以其作为对象兼数据交换的接口信息。

【Abstract】 The present dissertation uses Petri nets (PN) and hybrid genetic algorithms as tool to study the scheduling optimization of job shop with multiple process plants. The algorithm is compared with other scheduling algorithms and is tested by standard benchmark scheduling problem. The result has shown that the proposed algorithm is correct and excellent. To the dynamic dual-resource constrained scheduling problem, new strategies and methods are studied and analyzed. The best strategy is pointed out. The principal research results and contents can be outlined as following:Firstly, A new method of feedback controller design with combined place marking and transition firing constraint based on part net design and Petri net reduction technique is proposed for the first time in this dissertation. The method has the advantage of simpler computation and avoiding searching the entire state space over the reported methods, thus the computation efficiency superiority of the method is evident. The advantage is more obvious especially when the system is large and complex. The control concept of this method is plain and easy to be understood by the control engineers.Based on Petri net with controller , single- resource constraint job shop scheduling optimization problem is studied. A hybrid algorithm combined genetic algorithm and simulated annealing algorithm is applied, which considers process plan and scheduling. The result has shown that the proposed algorithm is correct and excellent.The dual-resource constraints dynamic scheduling is studied based on static scheduling. First, classify for machine breaks down, worker leaves, order cancels based on time and task, then decide whether carry out re-scheduling. Especially important, a new method of disposing urgent jobs is proposed, which deal with remainder and urgent jobs separately. Select optimal results of remainder jobs based on optimal scheduling of urgent jobs. The method realizes not only whole is optimal but also part is optimal too.Finally, a job shop scheduling software is developed using Delphi.

  • 【网络出版投稿人】 东北大学
  • 【网络出版年期】2006年 11期
节点文献中: 

本文链接的文献网络图示:

本文的引文网络