工艺约束条件下加工顺序决策的Petri网T_不变量方法

中国机械工程 ›› 2010, Vol. 21 ›› Issue (8): 946-951.

工艺约束条件下加工顺序决策的Petri网T_不变量方法

肖伟跃;罗佑新;廖德岗

湖南文理学院,常德,415000

出版日期:2010-04-25 发布日期:2010-05-05
基金资助:
湖南省高等学校“十一五”重点学科建设发展规划资助项目(湘教通2006180)

Method of Petri Nets Using T_invariants for Decision-making of Process Sequence Under Process Constraint

Xiao Weiyue;Luo Youxin;Liao Degang

Hunan University of Arts and Sciences,Changde,Hunan,415000

Online:2010-04-25 Published:2010-05-05

摘要/Abstract

摘要：

针对计算机辅助工艺设计中一直没有解决的加工顺序决策问题,提出了一种新的基于Petri网T_不变量的加工顺序决策方法。首先根据Petri网原理和产生式规则建立了一个基于规则的加工顺序决策Petri网模型;然后在考虑工艺约束的条件下,给出了可选工艺路线T_不变量的生成算法;最后通过一个实例验证了该算法的合理性和有效性。实例结果表明,所提出的决策方法能够实现从可选工艺路线中得到最优/次优的工艺路线。

关键词:

Petri网, T_不变量, 工艺约束, 加工顺序, 决策方法, CAPP



Abstract:

The decision-making of process sequence in CAPP is the key problems that have not been solved properly until now.A new decision method of process sequence was proposed based to Petri nets using T_invariant.First of all,a Petri net process sequence model based on rule was built according to the principle of Petri net and the production rule.Then,a alternative process plans T-invariant creating algorithm was given considering process constraints.Finally,a case was studied to verify the reason and validity of the algorithm.The results show that the decision-making of process sequence with the proposed method herein can obtain the best/hypo-best process plans in alternative process plans.

Key words: Petri net, T_invariant, process constraint, process sequence, decision method, CAPP

中图分类号:

TP391.73

肖伟跃, 罗佑新, 廖德岗.

工艺约束条件下加工顺序决策的Petri网T_不变量方法

[J]. 中国机械工程, 2010, 21(8): 946-951.

XIAO Wei-Ti, LUO You-Xin, LIAO De-Gang.

Method of Petri Nets Using T_invariants for Decision-making of Process Sequence Under Process Constraint

[J]. China Mechanical Engineering, 2010, 21(8): 946-951.

[1]	王云, 谭建荣, 冯毅雄, 李中凯. 基于SPEA的多目标柔性作业车间调度方法 [J]. 中国机械工程, 2010, 21(10): 1167-1172.
[2]	王明强, 李治多. 面向制造的连续体结构拓扑优化设计方法研究 [J]. 中国机械工程, 2010, 21(05): 524-528.
[3]	胡于进;张正义;凌玲;蔡力钢;. 基于工艺约束矩阵的加工序列优化[J]. J4, 2009, 20(09): 0-1016.