OPTIMIZATION OF INVARIANT CRITERIA FOR EVENT GRAPHS

This paper addresses the problem of obtaining a cycle time that is smaller than a given value in a strongly connected event graph, while minimizing an invariant linear criterion. 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 and an exact algorithm which allow us to reach a solution to the problem. Applications of the results to the evaluation of job shops and Kanban systems are proposed.