深度优先搜索在耦合任务集识别中的应用  

The Application of Depth First Search in Identifying Coupled Task Sets

作　　者：郭凯[1] 王仲奇[1] 付广磊[1] 

机构地区：[1]西北工业大学现代设计与集成制造技术教育部重点实验室,西安710072

出　　处：《科学技术与工程》2010年第14期3340-3343,共4页Science Technology and Engineering

基　　金：国防基础科研基金(B0620070101-07);"十一五"国家科技支撑计划"制造业信息化工程"重大项目(2006BAF01A03)资助

摘　　要：在复杂产品项目管理中,合理的任务分解可以优化资源配置和利用,降低设计过程中任务间的信息交互复杂度和约束度。耦合任务集是任务分解后得到的一组具有相互依赖关系的任务集合,它反映了设计过程对多领域知识集成的要求,对设计时间和资源配置均有着关键影响。通过对设计过程所转化的有向图以及其转置图,使用深度优先搜索算法,旨在找出有向图中的强连通分支,以实现对设计过程中耦合任务集的识别。给出了识别设计过程中的耦合任务集的算法步骤,并利用实例对算法如何识别耦合任务集进行了说明,证明了该方法对设计过程中耦合任务集的识别是准确有效的。In the project management for complex product,reasonable decomposition of task can optimize deploying of the resource and cut down the interaction complexity and restriction among tasks in product design process.The coupled task sets are a type of tasks set which have mutual dependency relationship after task decomposition.They reflect the design process demanding for multi-domain knowledge integration and have a crucial effect on the time of design and deploying of the resource.By using arithmetic of depth first search in directed graph transformed from design process and transposed graph,the strongly connected component is find out and distinguished the coupled task sets.The calculation steps of identifying the coupled task sets are given.Finally a example of the algorithm principle is explained,proved that the method of identifying coupled task sets in the design process is correct and effective.

关 键 词：产品设计过程 耦合任务集 深度优先搜索 

分 类 号：TP391.78[自动化与计算机技术—计算机应用技术]