首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于Petri网的一类调度问题的分层控制器设计
引用本文:张志明,吴维敏,段红霞.基于Petri网的一类调度问题的分层控制器设计[J].系统仿真学报,2007,19(A01):142-144.
作者姓名:张志明  吴维敏  段红霞
作者单位:[1]工业控制技术国家重点实验室,浙江大学先进控制研究所,浙江杭州310027 [2]南京城建项目管理发展有限公司,江苏南京210006
基金项目:863计划项目(2006AA042182)和浙江省自然科学基金资助项目(Y104081)
摘    要:利用Petri网中T不变量的思想,针对约束为T不变量的Parikh向量形式的job-shop调度问题,提出了一种分层控制器的设计算法,该算法有效地解决了这一有并发约束的控制问题。即使随着系统规模的增大,该方法计算量仍然很小,而且与经典的库所不变量方法相比较,它不受有无自回路的约束,可有效地解决一类实际制造系统中的job-shop调度问题。

关 键 词:Petri网  分层控制  T不变量  Parikh矢量  调度
文章编号:1004-731X(2007)S1-0142-03
收稿时间:2007-06-24
修稿时间:2007-07-05

Synthesis of Hierarchical Supervisors for a class of Scheduling Problem Based on Petri Nets
ZHANG Zhi-ming, WU Wei-min, DUAN Hong-xia.Synthesis of Hierarchical Supervisors for a class of Scheduling Problem Based on Petri Nets[J].Journal of System Simulation,2007,19(A01):142-144.
Authors:ZHANG Zhi-ming  WU Wei-min  DUAN Hong-xia
Abstract:This paper proposes an algorithm of synthesizing hierarchical supervisors for a class of job-shop scheduling problem with the constraint of T-invariants Parikh vector based on the T-invariants of Petri nets. The proposed algorithm is capable Of solving efficiently the control problem with concurrent constraint. Though the systems scale increases, the computation of the proposed algorithm remains to be little, In addition, the algorithm is not restricted to the self-loops in the net any more comparing with the classical method based on place invariants and can be used to treat efficiently a class of job-shop scheduling problem in practical manufacturing systems.
Keywords:Petri net  hierarchical control  T-invariants  Parikh vector  scheduling
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号