The Weight Distribution and Configurability of Process Collaboration

Article Preview

Abstract:

Based on the process reuse, a great number of process chains in a computer aided process planning (CAPP) system can form into a large process network as a collection of process collaborations with a large weight and processes with a larger strength. This paper aims to study the topological structure, weighted connectivity and assortativity, and configurability analysis of a realistic turbine process network. The empirical analysis indicates that the nonequilibrium weight distribution reveals a decaying power-law behavior, whereas the weight assignment of process collaborations behaves randomly, and has an assortative relationship with degrees of quite a few processes. In this paper, an evaluation method of configurability of process couples is proposed based on assortativity, and then the process configurability can be classified into the strong and weak ones.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 228-229)

Pages:

276-282

Citation:

Online since:

April 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] L. Alting and H.C. Zhang: Int. J. Prod. Res. Vol. 27 (1989), p.553.

Google Scholar

[2] A. Kusiak and G. Finke: Trans. on Rob. and Auto. Vol. 4 (1988), p.397.

Google Scholar

[3] G. Thimm, G.A. Britton and S.C. Fok: Int. J. Adv. Manuf. Technol. Vol. 24 (2004), p.261.

Google Scholar

[4] X.G. Ming and K.L. Mak: Int. J. Prod. Res. Vol. 38 (2000), p.1823.

Google Scholar

[5] M. Chen: Int. J. Prod. Res. Vol. 37 (1999), p.359.

Google Scholar

[6] X. F Zha and H. Du: J. Micromech. Microeng. Vol. 13 (2003), p.509.

Google Scholar

[7] Z. Yang, L. Qiao and L. Jiang: Int. J. Prod. Res. Vol. 36 (1998), p. (1987).

Google Scholar

[8] Y. Lin, and J.J. Solberg: The Int. J. of Flex. Manuf. Sys. Vol. 3 (1991), p.189.

Google Scholar

[9] M.E.J. Newman: Phys. Rev. Lett. Vol. 89 (2002), p.208701.

Google Scholar

[10] A. Barrat, M. Barthelemy and A. Vespignani: Phys. Rev. E Vol. 70 (2004), p.066149.

Google Scholar

[11] P.R. Kumar: Queueing Networks Vol. 13 (1993), p.87.

Google Scholar

[12] A.L. Barabási and R. Albert: Science Vol. 286 (1999), p.509.

Google Scholar