2025
Optimal Scheduling of Timed Petri Nets With Resource Marking and Ready Times: Application to Robotic Flow Shops
RA-L 2025
Many scheduling problems, especially for automated manufacturing systems, have been addressed with a timed Petri net (TPN) by developing optimal or heuristic algorithms based on it. However, most of them have focused on cyclic scheduling, in which a firing sequence of transitions in a TPN is repeate