arrow
返回

Ranking Critical Activities in Complex System Development Projects

delete2020-03-01
delete1
PRE
AI
S
Satish Srinivasan *
N
Nil Kilicay‐Ergin
R
Raghvinder S. Sangwan
C
Colin J. Neill
DOI:10.1109/JSYST.2019.2913660delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper proposes a discrete-time Markov chain-based ranking algorithm to rank critical activities in development processes for complex systems. Critical activities are those that lead to greater rework, involve close coordination or interdependence between development units, or produce task volatility. For example, the product development processes of the Ford Motor Company have several activities that are sensitive to information variability which can lead to higher task volatility or higher probability of rework. It is important to identify such activities early to ensure that the requirements for these activities are met and risk mitigation efforts can be planned. Analysis of the results from a variety of process architectures across a range of systems engineering domains shows that the proposed algorithm is more effective in identifying these critical activities than existing network ranking algorithms.
Keyword:
Activity ranking
centrality measures
design structure matrix
discrete-time Markov chain (MC)
normalized discounted cumulative gain
process architecture
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

I
IEEE Open Journal of Circuits and Systems
IF:
2.4
论文数:
4.5K
被引数:
387

机构

P
pennsylvania commonwealth system of higher education (pcshe)
学者数:
12.9W
论文数: 11.7W
被引数: 177
引用论文

引用论文

err分享
err收藏
err分享
err收藏
学者 查看更多内容