Marking optimization in timed event graphs
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.
KeywordsPetri Nets Timed Event Graphs Cycle Time Marking Job-shop Kanban Systems Modeling Evaluation
Unable to display preview. Download preview PDF.
- P. CHRETIENNE, “Les Réseaux de Petri Temporisés,” Univ. Paris VI, Paris, France, Thèse d'Etat, 1983.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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. 1987Google Scholar
- T. MURATA, “Petri Nets: Properties, Analysis and Applications,” Proceedings of the IEEE, vol. 77, No 4, pp. 541–580, April 1989.Google Scholar
- C. RAMCHANDANI, “Analysis of Asynchronous Concurrent Systems by Timed Petri Nets,” Lab. Comput. Sci., Mass. Inst. Technol. Cambridge, MA, Tech. Rep. 120, 1974.Google Scholar
- 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.Google Scholar
- J. SIFAKIS, “A Unified Approach for Studying the properties of Transition Systems,” Theoret. Comput. Sci. vol. 18, pp. 227–258, 1982.Google Scholar