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


An Optimal Solutions to Job Planning Problems in the Assembly Shop by Timed Petri Net
Abstract:Job planning (JP) systems shop oriented provide a basis for job shop scheduling and control in organizing short term production activities. This paper presents a method based on timed Petri net (TPN) method that is used to program optimal JP for assembly shop. It includes three parts further. Firstly, an architecture of solutions to JP problems for any kind of shop oriented is presented to define a particular JP for a designated JP problem. Secondly, Petri net model is specified for aircraft part assembly processes. Finally, algorithms for optimizing generation of dynamic mechanism and a simulating case are then discussed. In comparison with traditional methods such as PERT or CPM, it is obviously convenient for planners or schedulers to schedule and manage assembly processes.
Keywords:Job planning  Petri net  Dynamic programming  Assembly processes  
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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