Abstract: “This paper addresses the topic of robust routing and scheduling for parallel systems that suffer from operation interruptions and unreliable resources. The proposed approach uses a partially controllable extension of timed Petri nets as a model of the deterministic and stochastic behaviours. The mean job durations are first evaluated. Then a mean timed reachability graph is proposed to encode the timing aspects and Dijkstra algorithm is used to solve the routing and scheduling problems related to operation and resource failure rates.”

Keywords: Discrete event systems, Timed Petri nets, routing, scheduling, failures.