Optimization of Invariant Criteria for Event Graphs

IEEE Transactions on Automatic Control

Volumn 37, Issue 5, 1992, Pages 547-555

  Laftit, Said ^a   Xie, Xiao Lan ^a   Proth, Jean Marie ^a,b  

^a INRIA   (France)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY; MATHEMATICAL TECHNIQUES - HEURISTIC; OPTIMIZATION; PETRI NETS;

ADJUSTMENT HEURISTIC ALGORITHM; CONVEX OPTIMIZATON ALGORITHM; KANBAN SYSTEM; STRONGLY CONNECTED EVENT GTAPHS;

TIME AND MOTION STUDY;

EID: 0026855633     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.135488     Document Type: Article

References (9)

1. H. P. Benson, “A finite algorithm for concave minimization over a polyhedron,” Nav. Res. Logis., vol. 32, pp. 165–177, 1985.
2. P. Chretienne, “Les réseaux de petri temporisés,” Thès d'Etat, Univ. Paris VI Paris, France, 1983.
3. H. Hillion and J. M. Proth, “Performance evaluation of job shop systems using timed event-graphs,” IEEE Trans. Automat. Contr., vol. 34, pp. 3–9, Jan. 1989.
4. T. Murata, “Petri nets: Properties, analysis, and applications,” Proc. IEEE, vol. 77, pp. 541–580, Apr. 1989.
5. C. Ramchandani, “Analysis of asynchronous concurrent systems by timed Petri nets,” Lab. Comput. Sci., Mass Inst. Technol., Cambridge, MA, Tech. Rep. 120, 1974.
6. C. V. Ramamoorthy and G. S. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Trans. Software Eng., vol. SE-6, pp. 440–449, 1980.
7. J. Sifakis, “A unified approach for studying the properties of transition systems,” Theoret. Comput. Sci., vol. 18, pp. 227–258, 1982.
8. N. Van Thoai and H. Tuy, “Convergent algorithms for minimizing a concave function,” Math. Operat. Res., vol. 5, no. 4, pp. 556–566, 1980.
9. M. Di Mascolo, Y. Frein, Y. Dallery, and R. Pavid, “A unified modeling of Kanban systems using Petri nets,” LAG, Grenoble, France, Tech. Rep. 89–06, Sept. 1989.