首页 | 本学科首页   官方微博 | 高级检索  
     

Improved methods for scheduling flexible manufacturing systems based on Petri nets and heuristic search
作者姓名:Bo HUANG  Yamin SUN
作者单位:[1]Department of Computer, Nanjing University of Science & Technology, Nanjing Jiangsu 210094, China
摘    要:This paper proposes and evaluates two improved Petri net (PN)-based hybrid search strategies and their applications to flexible manufacturing system (FMS) scheduling. The algorithms proposed in some previous papers, which combine PN simulation capabilities with A* heuristic search within the PN reachability graph,may not find an optimum solution even with an admissible heuristic function. To remedy the defects an improved heuristic search strategy is proposed, which adopts a different method for selecting the promising markings and reserves the admissibility of the algorithm. To speed up the search process, another algorithm is also proposed which invokes faster termination conditions and still guarantees that the solution found is optimum. The scheduling results are compared through a simple FMS between our algorithms and the previous methods. They are also applied and evaluated in a set of randomly-generated FMSs with such characteristics as multiple resources and alternative routes.

关 键 词:启发式搜索  柔性制造系统  Petri网络  时序安排
收稿时间:2004-09-11
修稿时间:2005-04-27

Improved methods f or scheduling flexible manufacturing systems based on Pet ri nets and heuristic search
Bo HUANG,Yamin SUN.Improved methods for scheduling flexible manufacturing systems based on Petri nets and heuristic search[J].Journal of Control Theory and Applications,2005,3(2):139-144.
Authors:Bo HUANG  Yamin SUN
Affiliation:Department of Computer,Nanjing University of Science & Technology,Nanjing Jiangsu 210094,China
Abstract:This paper proposes and evaluates two improved Petri net (PN) - based hybrid search strategies and their applications to flexible manufacturing system (FMS) scheduling. The algorithms proposed in some previous papers ,which combine PN simulation capabilities with A 3 heuristic search within the PN reachability graph ,may not find an optimum solution even with an admissible heuristic function. To remedy the defects an improved heuristic search strategy is proposed ,which adopts a different method for selecting the promising markings and reserves the admissibility of the algorithm. To speed up the search process ,another algorithm is also proposed which invokes faster termination conditions and still guarantees that the solution found is optimum. The scheduling results are compared through a simple FMS between our algorithms and the previous methods. They are also applied and evaluated in a set of randomly- generated FMSs with such characteristics as multiple resources and alternative routes.
Keywords:Heuristic search  Admissibility  Petri net  Scheduling
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《控制理论与应用(英文版)》浏览原始摘要信息
点击此处可从《控制理论与应用(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号