本文用 Petri 网的一个子类——时间事件图对流水车间型和作业车间型的柔性制造系统(FMS)建模并进行理论分析,给出了可行排序的判定条件及系统中托盘数量配置与系统生产率的关系,对系统的主要性能指标,如生产周期、工件驻留时间、在制...本文用 Petri 网的一个子类——时间事件图对流水车间型和作业车间型的柔性制造系统(FMS)建模并进行理论分析,给出了可行排序的判定条件及系统中托盘数量配置与系统生产率的关系,对系统的主要性能指标,如生产周期、工件驻留时间、在制品库存等给出了定量描述.这些结果为系统的设计和运行提供了理论依据.展开更多
In this paper, we study some results of extended timed event graph (ETEG)by using graph theory's methods in the dioid framework. A necessary and sufficient con-dition for the observability of ETEG is obtained and ...In this paper, we study some results of extended timed event graph (ETEG)by using graph theory's methods in the dioid framework. A necessary and sufficient con-dition for the observability of ETEG is obtained and ETEG's standard structure is alsoestablished.展开更多
Based on the idea that modules are independent of machines, different combinations of modules and machines result in different configurations and the system performances differ under different configurations, a kind o...Based on the idea that modules are independent of machines, different combinations of modules and machines result in different configurations and the system performances differ under different configurations, a kind of cyclic reconfigurable flow shops are proposed for the new manufacturing paradigm-reconfigurable manufacturing system. The cyclic reconfigurable flow shop is modeled as a timed event graph. The optimal configuration is defined as the one under which the cyclic reconfigurable flow shop functions with the minimum cycle time and the minimum number of pallets. The optimal configuration, the minimum cycle time and the minimum number of pallets can be obtained in two steps.展开更多
Abstract This paper describes the dynamic behavior of extended timed event graphs related to place delay in the dioid framework. By Cofer and Garg's supervisory control theory^|3|, we address control problems of e...Abstract This paper describes the dynamic behavior of extended timed event graphs related to place delay in the dioid framework. By Cofer and Garg's supervisory control theory^|3|, we address control problems of extended timed events graphs. Supervisory control of extended timed event graphs (a class of discrete event dynamic systems) is studied in the dioid framework, a necessary and sufficient condition for the ideals of the set of firing time sequences of transitions to be controllable is presented. We prove all the strongly controllable subsets can form a complete lattice.展开更多
文摘In this paper, we study some results of extended timed event graph (ETEG)by using graph theory's methods in the dioid framework. A necessary and sufficient con-dition for the observability of ETEG is obtained and ETEG's standard structure is alsoestablished.
基金Supported by National Key Fundamental Research and Development Project of P. R. China (2002CB312200)
文摘Based on the idea that modules are independent of machines, different combinations of modules and machines result in different configurations and the system performances differ under different configurations, a kind of cyclic reconfigurable flow shops are proposed for the new manufacturing paradigm-reconfigurable manufacturing system. The cyclic reconfigurable flow shop is modeled as a timed event graph. The optimal configuration is defined as the one under which the cyclic reconfigurable flow shop functions with the minimum cycle time and the minimum number of pallets. The optimal configuration, the minimum cycle time and the minimum number of pallets can be obtained in two steps.
基金Supported by National Key Project of China and the National Sciences Foundation of China (Graot No.69874040).
文摘Abstract This paper describes the dynamic behavior of extended timed event graphs related to place delay in the dioid framework. By Cofer and Garg's supervisory control theory^|3|, we address control problems of extended timed events graphs. Supervisory control of extended timed event graphs (a class of discrete event dynamic systems) is studied in the dioid framework, a necessary and sufficient condition for the ideals of the set of firing time sequences of transitions to be controllable is presented. We prove all the strongly controllable subsets can form a complete lattice.
