期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
An Optimal Solutions to Job Planning Problems in the Assembly Shop by Timed Petri Net
1
作者 Wu Feng, Huang Biqing & Liu Wenhuang National CIMS Engineering Research Center, Department of Automation, Tsinghua University, Beijing 100084, P. R. China 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 1998年第1期9-15,共7页
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 ... 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. 展开更多
关键词 Job planning Petri net Dynamic programming assembly processes.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部