期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
基于着色Petri网的双向搜索关键路径算法
1
作者 杨夏妮 《玉林师范学院学报》 2014年第2期100-105,共6页
提出一种基于着色Petri网的双向搜索关键路径算法,首先将AOE网转换成带时间状态的着色Petri网,然后运行带时间状态的着色Petri网,分别从源点和汇点双向搜索关键路径,最后给出了对典型实例的仿真实验,结果验证了双向搜索关键路径算法的... 提出一种基于着色Petri网的双向搜索关键路径算法,首先将AOE网转换成带时间状态的着色Petri网,然后运行带时间状态的着色Petri网,分别从源点和汇点双向搜索关键路径,最后给出了对典型实例的仿真实验,结果验证了双向搜索关键路径算法的执行效率优于传统单向搜索关键路径算法. 展开更多
关键词 着petri 关键路径 双向搜索 AOE网
下载PDF
Solving Resource-constrained Multiple Project Scheduling Problem Using Timed Colored Petri Nets
2
作者 吴瑜 庄新村 +2 位作者 宋国辉 许晓栋 李从心 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第6期713-719,共7页
To solve the resource-constrained multiple project scheduling problem(RCMPSP) more effectively,a method based on timed colored Petri net(TCPN) was proposed.In this methodology,firstly a novel mapping mechanism between... To solve the resource-constrained multiple project scheduling problem(RCMPSP) more effectively,a method based on timed colored Petri net(TCPN) was proposed.In this methodology,firstly a novel mapping mechanism between traditional network diagram such as CPM(critical path method)/PERT(program evaluation and review technique) and TCPN was presented.Then a primary TCPN(PTCPN) for solving RCMPSP was modeled based on the proposed mapping mechanism.Meanwhile,the object PTCPN was used to simulate the multiple projects scheduling and to find the approximately optimal value of RCMPSP.Finally,the performance of the proposed approach for solving RCMPSP was validated by executing a mould manufacturing example. 展开更多
关键词 timed colored petri nets resource-constrained multiple project scheduling problem (RCMPSP) mapping mechanism
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部