Efficient organizing of design activities

作者: A. KUSIAK , J. WANG

DOI: 10.1080/00207549308956755

关键词:

摘要: Concurrent design should result in reduction of the duration a project, cost reduction, and better quality final design; however, it may increase complexity process make more difficult to manage. In this paper, an algorithm is developed for organizing activities order effectively produce acceptable design. The relationship among represented with incidence matrix corresponding directed graph. simplified by identifying analysing that are coupled. presented paper generates sequence desigmactivities such number cycles minimized, i.e. product development time reduced, concepts illustrated examples.

参考文章(16)
Andrew Kusiak, Concurrent Engineering: Automation, Tools, and Techniques John Wiley & Sons, Inc.. ,(1992)
Joseph Edward Shigley, Charles R. Mischke, Standard Handbook of Machine Design ,(2004)
Donald V. Steward, The design structure system: A method for managing the design of complex systems IEEE Transactions on Engineering Management. ,vol. 28, pp. 71- 74 ,(1981) , 10.1109/TEM.1981.6448589
Donald V. Steward, Partitioning and Tearing Systems of Equations Journal of The Society for Industrial and Applied Mathematics, Series B: Numerical Analysis. ,vol. 2, pp. 345- 365 ,(1965) , 10.1137/0702028
ANDREW KUSIAK, KWANGHO PARK, Concurrent engineering: decomposition and scheduling of design activities International Journal of Production Research. ,vol. 28, pp. 1883- 1900 ,(1990) , 10.1080/00207549008942841
Herbert Weinblatt, A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph Journal of the ACM. ,vol. 19, pp. 43- 56 ,(1972) , 10.1145/321679.321684
S. M. Roberts, Benito Flores, Systematic generation of Hamiltonian circuits Communications of The ACM. ,vol. 9, pp. 690- 694 ,(1966) , 10.1145/365813.365842
James C. Tiernan, An efficient search algorithm to find the elementary circuits of a graph Communications of The ACM. ,vol. 13, pp. 722- 726 ,(1970) , 10.1145/362814.362819