Abstract
This paper addresses the marking optimization problem in a strongly connected timed event graph. It consists in finding an initial marking such that the cycle time is smaller than a given value and that an invariant linear criterion is minimized. This linear criterion is based on a p-invariant of the strongly connected event graph under consideration. We prove some properties of the optimal solution and provide a heuristic algorithm which gives near optimal solution to the problem. Applications of the results to the work-in-process optimization of job-shops and Kanban systems are proposed.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. CHRETIENNE, “Les Réseaux de Petri Temporisés,” Univ. Paris VI, Paris, France, Thèse d'Etat, 1983.
M. Di MASCOLO, Y. FREIN, Y. DALLERY and R. DAVID, “A Unified Modeling of Kanban Systems Using Petri Nets,” Technical Report No 89-06, LAG. Genoble, France, September, 1989.
H. HILLION and J.M. PROTH, “Performance Evaluation of Job-Shop Systems Using Timed Event-Graphs,” IEEE Trans. Automat. Contr., vol. 34, No 1, pp. 3–9, January 1989.
H.P. Hillion, J.M. Proth and X.L. Xie, “A Heuristic Algorithm for the Periodic Scheduling and Sequencing Job-shop Problem,” Proc. 26th IEEE Conference on Decision and Control, Los Angeles, CA, Dec. 1987
T. MURATA, “Petri Nets: Properties, Analysis and Applications,” Proceedings of the IEEE, vol. 77, No 4, pp. 541–580, April 1989.
C. RAMCHANDANI, “Analysis of Asynchronous Concurrent Systems by Timed Petri Nets,” Lab. Comput. Sci., Mass. Inst. Technol. Cambridge, MA, Tech. Rep. 120, 1974.
C.V. RAMAMOORTHY and G.S. HO, “Performance Evaluation of Asynchronous Concurrent Systems using Petri Nets,” IEEE Trans. Software Eng., vol. SE-6, No 5, pp. 440–449, 1980.
J. SIFAKIS, “A Unified Approach for Studying the properties of Transition Systems,” Theoret. Comput. Sci. vol. 18, pp. 227–258, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laftit, S., Proth, J.M., Xie, X.L. (1993). Marking optimization in timed event graphs. In: Rozenberg, G. (eds) Advances in Petri Nets 1993. ICATPN 1991. Lecture Notes in Computer Science, vol 674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56689-9_48
Download citation
DOI: https://doi.org/10.1007/3-540-56689-9_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56689-2
Online ISBN: 978-3-540-47631-3
eBook Packages: Springer Book Archive