Efficient organizing of design activities

References

• DEO , N. , 1974 , Graph Theory with Applications to Engineering and Computer Science ( Englewood Cliffs , NJ Prentice-Hall ).
   Google Scholar
• EPPINGER , S. D. , WHITNEY , D. E. , SMITH , R. P. , and GEBALA , D. A. , 1990 , Organizing the Tasks in Complex Design Projects . J. R. Rinderle (Ed) , Proceedings of the 1990 ASME Conference—Design Theory and Methodology ( New York ASME ), pp. 39 – 46 .
   Google Scholar
• EVEN , S. , 1979 , Graph Algorithms ( Haifa , Israel Technion Institute Press ).
   Google Scholar
• HOROWITZ , E. , and SAHNI , S. , 1983 , Fundamentals of Data Structures ( Rockville , Md Computer Science Press ), pp. 312 – 313 .
   Google Scholar
• KUSIAK , A. , 1993 , Concurrent Engineering Automation, Tools, and Techniques ( New York John Wiley ).
   Google Scholar
• KUSIAK , A. , and PARK , K. , 1990 , Concurrent engineering decomposition and scheduling of design activities . International Journal of Production Research , 28 ( 10 ), 1883 – 1990 .
   Web of Science ®Google Scholar
• ROBERTS , S. M. , and FLORES , B. , 1966 , Systematic generation of Hamiltonian circuits . Communications of ACM , 9 ( 9 ), 690 – 694 .
   Web of Science ®Google Scholar
• SHIGLEY , J. E. , and MISCHKE , C. R. , 1986 , Standard Handbook of Machine Design ( New York McGraw-Hill ).
   Google Scholar
• STEWARD , D. V. , 1965 , Partitioning and tearing systems of equations . Journal of the Society for Industrial and Applied Mathematics Numerical Analysis, Ser, B , 2 ( 2 ), 345 – 365 .
   Google Scholar
• STEWARD , D. V. , 1981a , Systems Analysis and Management Structure, Strategy, and Design ( New York Petrocelli Books ).
   Google Scholar
• STEWARD , D. V. , 1981b , The design structure system a method for managing the design of complex systems . IEEE Transactions on Engineering Management , 28 ( 3 ), 71 – 74 .
   Web of Science ®Google Scholar
• TARJAN , R. , 1972 , Depth-first search and linear graph algorithms . SI AM Journal of Computing , 1 ( 2 ), 146 – 160 .
   Google Scholar
• TIERNAN , J. C. , 1970 , An efficient search algorithm to find the simple cycles of a finite directed graphs . Communications of ACM , 13 ( 12 ), 722 – 726 .
   Web of Science ®Google Scholar
• WARFIELD , J. N. , 1973 , Binary Matrices in System Modeling . IEEE Transactions on Systems, Man and Cybernetics , SMC-3 ( 5 ), 441 – 449 .
   Web of Science ®Google Scholar
• WEIL , R. L. , and KETTLER , P. C. , 1971 , Rearranging matrices to block-angular form for decomposition (and other) algorithms . Management Science , 18 ( 1 ), 98 – 108 .
   Web of Science ®Google Scholar
• WEINBLATT , H. , 1972 , A new search algorithm for finding the simple cycles of finite directed graohs . Journal of ACM , 19 ( 1 ), 43 – 56 .
   Web of Science ®Google Scholar