Scheduling of flexible manufacturing systems using timed Petri nets and mathematical programming

In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with "flexible" manufacturing problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy