Real-Time Parallel Operation Scheduling Structurized by Petri Nets
用Petri网结构化的方法求解实时并行运算调度问题

A method for scheduling operations with given precedence relation under multiple resources is proposed. The time duration of each operation is deterministic. Minimum time span of parallel processing without and with resource restrictions are solved. Modelling by Petri Nets makes the problem highly structurized, thus limiting the search space merely to feasible solutions subject to precedence relation. These engineering approaches are solved for analytical solutions.