In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 674; Advances in Petri Nets 1993, pages 281-300. Springer-Verlag, 1993.
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 in 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.