Cycle time optimization of deterministic timed weighted marked graphs

Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model automated production systems such as robotic work cells or embedded systems. The main problem for designers is to find a trade off between minimizing the cost of the resources and maximizing the system's throughput. It is possible to apply analytical techniques for the average cycle time optimization problem of such systems. The problem consists in finding an initial marking to minimize the average cycle time (i.e., maximize the throughput) while the weighted sum of tokens in places is less than or equal to a given value.

[1]  Qingtian Zeng,et al.  Modeling and Analysis for Workflow Constrained by Resources and Nondetermined Time: An Approach Based on Petri Nets , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[3]  Piotr Chrzastowski-Wachtel,et al.  Liveness of Weighted Circuits and the Diophantine Problem of Frobenius , 1993, FCT.

[4]  Alessandro Giua,et al.  Synchronizing sequences on a class of unbounded systems using synchronized Petri nets , 2016, Discret. Event Dyn. Syst..

[5]  Alessandro Giua,et al.  Firing rate optimization of cyclic timed event graphs by token allocations , 2002, Autom..

[6]  Spyros A. Reveliotis,et al.  Performance optimization for a class of generalized stochastic Petri nets , 2013, 52nd IEEE Conference on Decision and Control.

[7]  Jean-Louis Boimond,et al.  Determinization of timed Petri nets behaviors , 2016, Discret. Event Dyn. Syst..

[8]  Olivier Marchetti,et al.  A sufficient condition for the liveness of weighted event graphs , 2009, Eur. J. Oper. Res..

[9]  Piotr Chrzastowski-Wachtel,et al.  Orbits, half-frozen tokens and the liveness of weighted circuits , 1995, STRICT.

[10]  C. Leake.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[11]  Mi Zhao,et al.  On Controllability of Dependent Siphons for Deadlock Prevention in Generalized Petri Nets , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[12]  Sander Stuijk,et al.  Throughput Analysis of Synchronous Data Flow Graphs , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[13]  Zhiwu Li,et al.  Decentralized Supervision of Petri Nets With a Coordinator , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[14]  Giovanni Chiola,et al.  Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector , 1991, IEEE Trans. Software Eng..

[15]  Manuel Silva Suárez,et al.  On Weighted T-Systems , 1992, Application and Theory of Petri Nets.

[16]  Hajo A. Reijers,et al.  On the optimal allocation of resources in stochastic workflow nets , 2001 .

[17]  Olivier Marchetti,et al.  Periodic Schedules for Bounded Timed Weighted Event Graphs , 2012, IEEE Transactions on Automatic Control.

[18]  Alessandro Giua,et al.  Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints , 2015, IEEE Trans. Autom. Control..

[19]  Alessandro Giua,et al.  Marking optimization of deterministic timed weighted marked graphs under infinite server semantics , 2016, CoDIT.

[20]  MengChu Zhou,et al.  Multiple-Weighted Marked Graphs , 1993 .

[21]  Jean-Louis Boimond,et al.  On the linearizability of discrete timed event graphs with multipliers using (min,+) algebra , 2004 .

[22]  B. Trouillet,et al.  On the Linearization of Weighted T-Systems , 2006, The Proceedings of the Multiconference on "Computational Engineering in Systems Applications".

[23]  Ping-Yu Hsu,et al.  A Petri Net Approach to Support Resource Assignment in Project Management , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[24]  Serge Haddad,et al.  Application and Theory of Petri Nets , 2012, Lecture Notes in Computer Science.

[25]  Ricardo J. Rodríguez,et al.  On the Performance Estimation and Resource Optimization in Process Petri Nets , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[26]  Alessandro Giua,et al.  HYPENS: A Matlab Tool for Timed Discrete, Continuous and Hybrid Petri Nets , 2008, Petri Nets.

[27]  Manuel Silva Suárez,et al.  Approximate Throughput Computation of Stochastic Marked Graphs , 1994, IEEE Trans. Software Eng..

[28]  Saïd Amari,et al.  Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra , 2016, Discret. Event Dyn. Syst..

[29]  Manuel Silva,et al.  Cycle time computation in deterministically timed weighted marked graphs , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).

[30]  Zhiwu Li,et al.  Cycle Time Optimization of Deterministic Timed Weighted Marked Graphs by Transformation , 2015, IEEE Transactions on Control Systems Technology.

[31]  A. Benfekir,et al.  Performance evaluation of nonlinear weighted T-system , 2013, Int. J. Syst. Sci..

[32]  G. Cohen,et al.  Timed-event graphs with multipliers and homogeneous min-plus systems , 1998, IEEE Trans. Autom. Control..

[33]  Robert de Simone,et al.  Periodic scheduling of marked graphs using balanced binary words , 2012, Theor. Comput. Sci..

[34]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[35]  Pascal Urard,et al.  A new approach for minimizing buffer capacities with throughput constraint for embedded system design , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[36]  Philippe Declerck,et al.  Compromise approach for predictive control of Timed Event Graphs with specifications defined by P-time Event Graphs , 2016, Discret. Event Dyn. Syst..

[37]  Giovanni Chiola,et al.  Properties and Performance Bounds for Timed Marked Graphs , 1992 .

[38]  Nathalie Sauer.  Marking Optimization of Weighted Marked Graphs , 2003, Discret. Event Dyn. Syst..

[39]  Olfa Mosbahi,et al.  Reconfigurable Coordination of Distributed Discrete Event Control Systems , 2015, IEEE Transactions on Control Systems Technology.

[40]  Alessandro Giua,et al.  Optimization of deterministic timed weighted marked graphs , 2017, 2017 13th IEEE Conference on Automation Science and Engineering (CASE).

[41]  H. S. Hu,et al.  Design of Liveness-Enforcing Supervisors for Flexible Manufacturing Systems Using Petri Nets , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[42]  MengChu Zhou,et al.  Short-Term Scheduling of Crude-Oil Operations: Enhancement of Crude-Oil Operations Scheduling Using a Petri Net-Based Control-Theoretic Approach , 2015, IEEE Robotics & Automation Magazine.