摘要
本文提出了一种新的Ｐｅｔｒｉ网模型──压缩Ｐｅｔｒｉ网（ＲｅＰＮ）模型，用于调度问题的建模和求解．与以前的模型相比，ＲｅＰＮ模型不仅具有较强的分析能力，而且大大减少了节点数，使可达集相应减小，从而为搜索调度问题的最优解或近忧解提供了方便．
In order to model and solve scheduling problem, a new Petri nets model-reduced Petri nets model is introduced. Compared with previous Petri nets model of scheduling problem, RePN model not only has strong abilities of analysis but also reduces the number of nodes greatly. So that the reachable set of RePN model is much smaller, which makes it more convenient to search the optimal on near optimal solution of scheduling.
出处
《计算机学报》
EI
CSCD
北大核心
1997年第6期562-566,共5页
Chinese Journal of Computers
基金
国家863高科技基金
关键词
调度
标识图
压缩Petri网
PETRI网
模型
Scheduling, marked graph, reduced Petri nets, reachable set, combined place
