Design structure matrix: Difference between revisions

Revision as of 15:37, 13 January 2020

Revision as of 00:31, 2 March 2020

Line 42:

'''Sequencing''' methods try to order the matrix elements such that no feedback marks remain.<ref name="DSMbook"/><ref name="complex"/> In case of coupled activities (activities that have cyclic links, e.g., activity A is linked to B, which is linked to C, which is linked to A) the results is a block diagonal DSM (i.e., blocks or groups of coupled activities along the diagonal). Partitioning methods include: Path Searching; Reachability Matrix; Triangulation algorithm; and the powers of the Adjacency Matrix.

'''Tearing''' is the removal of feedback marks (in Binary DSM) or assignment of lower priority (numeric DSM). Tearing of a Component-based DSM may imply modularization (the component design is not influencing other components) or standardization (the component design is not influencing and not influenced by other components).<ref name="DSMbook"/><ref name="complex"/><ref>Sered Y, Reich Y (2006)," Standardization and modularization driven by minimizing overall process effort." Computer-Aided Design, 38(5):405-416</ref> After tearing a partitioning algorithm is (re)appliedreapplied.

Minimizing feedback loops gets the best results for Binary DSM, but not always for Numeric DSM or Probability DSM. '''Sequencing''' algorithms (using optimization, genetic algorithms) are typically trying to minimize the number of feedback loops and also to reorder coupled activities (having cyclic loop) trying to have the feedback marks close to the diagonal. Yet, sometimes the algorithm just tries to minimize a criterion (where minimum iterations is not the optimal results).<ref name="DSMsim">T. Browning: [https://dx.doi.org/10.1109/TEM.2002.806709 "Modeling Impacts of Process Architecture on Cost and Schedule Risk in Product Development"], In: ''IEEE Transactions on Engineering Management.'' 49(4):428-442, 2002.</ref>