A Branch and Bound Algorithm for Cyclic Scheduling of Timed Petri Nets

A timed Petri net (TPN) has been widely used for modeling, scheduling, and analyzing discrete event dynamic systems. This study examines cyclic scheduling problems of a TPN to minimize the cycle time especially for automated manufacturing systems. Appropriate token routing at each conflict place canmake a TPN repeat an identical firing sequence.We propose a systematic procedure to transform a …