Sequence Planning for Labeled Petri Nets With Time and Resource Constraints Using Basis Markings

Abstract

This paper addresses the scheduling problem for discrete event systems modeled by labeled Petri nets with time and resource constraints where deadlocks are inevitable. For better resource utilization and shorter processing time, a heuristic algorithm is presented for designing a suitable transition sequence that starts from the initial marking to a set of target markings using basis markings. Specially, two reasons exist for deadlocks in the given system. One is resource exhaustion and the other is unreasonable resource allocation. We only focus on the former. First, the set of target markings, i.e., deadlocks caused by resource exhaustion, is identified using the notion of basis markings and resource-exhausted markings. The basis reachability graph instead of the conventional reachability graph is constructed to avoid state space explosion. An integer linear programming problem based on the notion of deadlocks is carried out to distinguish basis markings, where deadlocks can be reached by firing unobservable transitions only. Then, the A-star algorithm is applied to the basis marking space to schedule the transition firing sequences and the optimal results may be obtained. Unpromising searching areas are reduced and only a part of the markings is probed. Finally, a numerical case is studied to verify the effectiveness of the proposed algorithm. The main advantages of the proposed approach include that the exhaustive enumeration of the reachability space can be avoided and the calculation can be completed off-line.

Keywords

• Basis marking
• discrete event system
• labeled Petri net
• resource consumption
• sequence planning