Modeling and Simulation of Dynamic Alliance Task Scheduling

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 16-19)
• Pages: 728-732
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.16-19.728
• Online since: October 2009
• Authors: Bin Huang, Cheng Hui Gao, Liang Chen
• Keywords: Dynamic Alliance, Task Scheduling, Timed Place Petri-Net

References

[1] Y.Y. Yusuf, M. Sarhadi and A. Gunasekaran: International Journal of Production Economics, Vol. 62 (1999), pp.33-43.

[2] T. Murata: Proceedings of IEEE, Vol. 77 (1989), pp.541-580.

[3] F.D.J. Bowden: Mathematical and Computer Modelling, Vol. 31 (2000), pp.55-68.

[4] D.Y. Lee and F. Dicesare: IEEE Transaction on Robotics and Automation, Vol. 10 (1994), pp.123-132.

[5] J.H. Chen, L.C. Fu, M.H. Lin and A.C. Huang: IEEE Transaction on Robotics and Automation, Vol. 17 (2001), pp.619-636.

[6] M. Ghaeli, P.A. Bahri, P. Lee and T. Gu: Computers and Chemical Engineering, Vol. 29 (2005), pp.249-259.

[7] The MathWorks and et al.: For Use with Simulink. User's Guide, Version 5 (2002).