Firing Rate Optimization of Deterministic Timed Event Graphs by Server Performance improvement
Firing Rate Optimization of Deterministic Timed Event Graphs by Server Performance improvement
复制标题
通过服务器性能改进确定性定时事件图的触发率优化
DOI：
10.1109/access.2018.2880460
复制
发表时间：
2018-01-01
期刊：
影响因子：
3.9
通讯作者：
Li, Zhiwu
中科院分区：
文献类型：
--
作者：
He, Zhou;Liu, Miao;Li, Zhiwu
定时事件图是 Petri 网的子类，通常应用于建模和控制制造系统。在本文中，我们研究了提高定时事件图中机器（服务器）性能的问题，以最大化系统的触发率。我们证明，机器成本和机器运行时间（转换的触发延迟）的逻辑约束可以转化为线性代数约束。此外，我们制定了一个混合整数线性规划问题，以在给定预算下最大化网络的触发率，从而提高服务器的性能（减少转换的触发延迟），从而提供最佳解决方案。最后，将其应用于装配线以显示所开发方法的有效性。
Timed event graphs are a subclass of Petri nets that are commonly applied for modeling and controlling manufacturing systems. In this paper, we investigate the problem of improving the performance of machines (servers) in timed event graphs in order to maximize the firing rate of a system. We show that the logic constraints on the cost of machines and the operation time of machines (firing delay of transitions) can be transformed into linear algebraic constraints. Furthermore, we formulate a mixed integer linear programming problem to maximize the firing rate of the net under a given budget for improving the performance of servers (decreasing the firing delay of transitions) that can provide an optimal solution. Finally, application to an assembly line is presented to show the effectiveness of the developed methodology.