Hamraz, B and Caldwell, NH and Clarkson, PJ (2013) A matrix-calculation-based algorithm for numerical change propagation analysis. IEEE Transactions on Engineering Management, 60. pp. 186-198. ISSN 0018-9391Full text not available from this repository.
Engineering changes (ECs) are raised throughout the lifecycle of engineering products. A single change to one component produces knock-on effects on others necessitating additional changes. This change propagation significantly affects the development time and cost and determines the product's success. Predicting and managing such ECs is, thus, essential to companies. Some prediction tools model change propagation by algorithms, whereof a subgroup is numerical. Current numerical change propagation algorithms either do not account for the exclusion of cyclic propagation paths or are based on exhaustive searching methods. This paper presents a new matrix-calculation-based algorithm which can be applied directly to a numerical product model to analyze change propagation and support change prediction. The algorithm applies matrix multiplications on mutations of a given design structure matrix accounting for the exclusion of self-dependences and cyclic propagation paths and delivers the same results as the exhaustive search-based Trail Counting algorithm. Despite its factorial time complexity, the algorithm proves advantageous because of its straightforward matrix-based calculations which avoid exhaustive searching. Thereby, the algorithm can be implemented in established numerical programs such as Microsoft Excel which promise a wider application of the tools within and across companies along with better familiarity, usability, practicality, security, and robustness. © 1988-2012 IEEE.
|Uncontrolled Keywords:||Change propagation analysis design structure matrix (DSM) engineering change (EC) management numerical models|
|Divisions:||Div C > Engineering Design|
|Depositing User:||Unnamed user with email email@example.com|
|Date Deposited:||16 Jul 2015 13:26|
|Last Modified:||02 Aug 2015 22:41|