A shortest path method for sequential change propagations in complex engineering design processes
Engineering design changes constantly occur in complex engineering design processes. Designers need appropriate measures to handle the numerous design changes in order to realize consistent and completely validated product models so that successful product development is assured. In this paper, a ti...
Saved in:
| Published in | AI EDAM Vol. 30; no. 1; pp. 107 - 121 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, USA
Cambridge University Press
01.02.2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0890-0604 1469-1760 |
| DOI | 10.1017/S0890060415000311 |
Cover
| Summary: | Engineering design changes constantly occur in complex engineering design processes. Designers need appropriate measures to handle the numerous design changes in order to realize consistent and completely validated product models so that successful product development is assured. In this paper, a time-based mathematic model is presented to characterize the sequential change propagation process, and then the shortest path algorithm is given to find the most timesaving routes for changes to propagate to other dependent design tasks. An analysis method is introduced to compute the sensitivities of change impacts on the affected design tasks, which indicates that the more time consumed by a change to take its effect, the more sensitive the change impacts on those downstream dependent tasks. A case study of change propagations in motorcycle engine design process was presented to demonstrate the proposed method. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0890-0604 1469-1760 |
| DOI: | 10.1017/S0890060415000311 |