摘要
利用Petri网中T不变量的思想,针对约束为T不变量的Parikh向量形式的job-shop调度问题,提出了一种分层控制器的设计算法,该算法有效地解决了这一有并发约束的控制问题。即使随着系统规模的增大,该方法计算量仍然很小,而且与经典的库所不变量方法相比较,它不受有无自回路的约束,可有效地解决一类实际制造系统中的job-shop调度问题。
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.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2007年第A01期142-144,共3页
Journal of System Simulation
基金
863计划项目(2006AA04Z182)
浙江省自然科学基金资助项目(Y104081)
