Considering the characteristics of dynamic alliance task scheduling, timed place Petri-net (TPPN)-based approach is proposed to model the task scheduling. On the basis of formal definition and transition rules of the TPPN, dynamic alliance manufacturing types are classified, and the TPPN model of each kind of manufacturing is provided. Then through analyzing time difference of each task, critical path in TPPN model is solved. Finally, State flow is used to simulate the TPPN model, and the simulation of a case demonstrates that the approach is feasible and effective.
