In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 276-294. June 1991.
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. The authors prove some properties of the optimal solution and provide a heuristic algorithm which gives near optimal solution to the problem. Applications of the reslults to the evaluation of job-shops and Kanban systems are proposed.
Keywords: marking optimization (in) timed event graph(s); p-invariant; job-shop evaluation; Kanban system evaluation.