Complexity results for Weighted Timed Event Graphs

Discrete Optimization

Volumn 7, Issue 3, 2010, Pages 166-180

  Marchetti, Olivier ^a   Munier Kordon, Alix ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Approximation algorithm; Buffer requirement; Complexity; Throughput; Weighted Timed Event Graphs

Indexed keywords

BUFFER REQUIREMENTS; COLORABILITY; COMPLEXITY; COMPLEXITY RESULTS; INDUSTRIAL AREA; MANUFACTURING SYSTEM; MAXIMUM THROUGH-PUT; NP COMPLETE; POLYNOMIAL ALGORITHM; POLYNOMIAL REDUCTION; THROUGHPUT CONSTRAINTS; TIMED EVENT GRAPHS;

COMPUTATIONAL COMPLEXITY; EMBEDDED SYSTEMS; LINEAR ALGEBRA; OPTIMIZATION; POLYNOMIAL APPROXIMATION; THROUGHPUT;

APPROXIMATION ALGORITHMS;

EID: 78651408702     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.03.006     Document Type: Article

References (26)

1. Claire Hanen, and Alix Munier Cyclic scheduling on parallel processors: an overview Philippe Chrtienne, Edward G. Coffman, Jan Karel Lenstra, Zhen Liu, Scheduling Theory and its Applications 1994 J. Wiley and Sons
2. Martin Middendorf, and Vadim G. Timkovsky On scheduling cycle shops: classification, complexity and approximation Journal of Scheduling 5 2 2002 135 169
3. Angela Di Febbraro, Ricardo Minciardi, and Simona Sacone Deterministic timed event graphs for performance optimization of cyclic manufacturing processes IEEE Transactions on Robotics and Automation 13 2 1997 169 181
4. Stphane Gaubert An algebraic method for optimizing resources in timed event graphs 9th Conference on Analysis and Optimization of Systems vol. 144 1990 Springer 957 966
5. Alessandro Giua, Aldo Piccaluga, and Carla Seatzu Firing rate optimization of cyclic timed event graphs Automatica 38 1 2002 91 103
6. Said Laftit, Jean-Marie Proth, and Xiaolan Xie Optimization of invariant criteria for event graphs IEEE Transactions on Automatic Control 37 5 1989 547 555
7. Nathalie Sauer Marking optimization of weighted marked graph Discrete Event Dynamic Systems 13 3 2003 245 262
8. Edward A. Lee, and David G. Messerschmitt Synchronous data flow Proceedings of the IEEE 75 9 1987 1235 1245
9. Olivier Marchetti, and Alix Munier-Kordon Minimizing places capacities of a weighted event graph Discrete Event Dynamic Systems 18 1 2008 91 109
10. Ramaswamy Govindarajan, Guang R. Gao, and Palsah Desai Minimizing memory requirements in rate-optimal schedule in regular dataflow networks Journal of VLSI Signal Processing 31 3 2002 207 229
11. Edmund M. Clarke Jr., Orna Grumberg, and Doron A. Peled Model Checking 1999 MIT Press
12. Marc Geilen, Twan Basten, Sander Stuijk, Minimising buffer requirements of synchronous dataflow graphs with model checking, in: DAC, 2005, pp. 819824.
13. M. Holzmann The SPIN Model Checker: Primer and Reference Manuel 2004 Addison Wesley
14. Sander Stuijk, Marc Geilen, and Twan Basten Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs 43rd Design Automation Conference DAC 2006 2006 ACM Press 899 904
15. R.M. Karp, and R.E. Miller Properties of a model for parallel computations: determinacy, termination, queueing SIAM 14 63 1966 1390 1411
16. Michael R. Garey, and David S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W. H. Freeman & Co.
17. J.-L. Peterson Petri Net Theory and the Modeling of Systems 1981 Prentice Hall PTR
18. Olivier Marchetti, and Alix Munier-Kordon A sufficient condition for the liveness of weighted event graphs European Journal of Operational Research 197 2 2009 532 540
19. Alix Munier Rgime asymptotique optimal d'un graphe d'vnements temporis gnralis: application un problme d'assemblage RAIRO-Automatique Productique Informatique Industrielle 27 5 1993 487 513
20. F. Commoner, Anatol W. Holt, Shimon Even, and Amir Pnueli Marked directed graphs Journal of Computer and System Sciences 5 5 1971 511 523
21. E. Teruel, P. Chrzastowski-Wachtel, J.M. Colom, and M. Silva On weighted T-systems Proocedings of the 13th Internationnal Conference on Application and Theory of Petri Nets 1992 Lecture Notes in Computer Science vol. 616 1992 Springer 348 367
22. Thomas Cormen, Charles Leiserson, and Ronald Rivest Introduction to Algorithms 1990 MIT Press
23. Philippe Chrtienne, Les rseaux de Petri temporiss, Ph.D. Thesis, Thse d'tat, Universit P. et M. Curie, 1983.
24. Danile Beauquier, Jean Berstel, and Philippe Chrtienne Elments d'algorithmique 1992 Masson
25. G.J Minty A theorem on n-coloring the points of a linear graph The American Mathematical Monthly 69 7 1962 623 624
26. Richard M. Karp A characterization of the minimum cycle mean in a digraph Discrete Mathematics 23 1978 309 311