Reduced Petri nets model of scheduling problems

In order to model and solve scheduling problems, a new Petri Nets Model, Reduced Petri Nets (RePN), is introduced. Compared with previous Petri Nets models of scheduling problems, the RePN model not only has strong ability of analysis but also reduces the number of places and transitions in a great amount. So the reachable set of the RePN model is much smaller, which makes it more convenient to search the optimal or near-optimal solution of scheduling problems.