|
|||||
|
|
| 基于赋时可重构Petri网的可重构制造系统调度算法 | |
| 引用本文： | 蔡宗琰,王宁生,任守纲,李亚白. 基于赋时可重构Petri网的可重构制造系统调度算法[J]. 西南交通大学学报, 2004, 39(3): 341-344 |
| 作者姓名： | 蔡宗琰 王宁生 任守纲 李亚白 |
| 作者单位： | 南京航空航天大学机电学院,江苏,南京,210016 |
| 基金项目： | 江苏省博士后科学基金(20020105) |
| 摘 要： | 根据赋时可重构Petri网的可重构制造系统调度算法和赋时可重构Petri网的跃迁激发顺序，生成并求解部分可及图，以获得优化或准优化的调度．该算法能以较低的计算成本获得可重构制造系统最小的最大完成时间．用一个调度算例验证了该调度算法的可行性． |
| 关 键 词： | 调度 优化 路径 可重构制造系统 赋时可重构Petri网 |
| 文章编号： | 0258-2724(2004)03-0341-04 |
Scheduling of Reconfigurable Manufacturing System Based on Timed Reconfigurable Petri Net |
|
| CAI Zong-yan,WANG Ning-sheng,REN Shou-gang,LI Ya-bai. Scheduling of Reconfigurable Manufacturing System Based on Timed Reconfigurable Petri Net[J]. Journal of Southwest Jiaotong University, 2004, 39(3): 341-344 | |
| Authors: | CAI Zong-yan WANG Ning-sheng REN Shou-gang LI Ya-bai |
| Abstract: | The proposed scheduling algorithm for reconfigurable manufacturing systems is based on timed reonfigurable Petri net. It generates and searches a partial reachable graph to find an optimal or near optimal feasible schedule according to the firing sequence of transitions of the timed reconfigurable Petri net model for a reasonable computational cost. A scheduling example was presented to demonstrate the correctness and feasibility of the algorithm. |
| Keywords: | schedule optimization routing reconfigurable manufacturing system timed reconfigurable Petri net |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |