检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《机械工程学报》2006年第1期23-29,34,共8页Journal of Mechanical Engineering
基 金:国家自然科学基金(50475075)教育部高等学校骨干教师资助计划基金资助项目。
摘 要:针对并行开发过程中设计活动间存在迭代和重叠的情形,提出一个时间计算模型及其优化方法。依据矩阵规划后的设计结构矩阵,将设计活动组划分为多个耦合活动块和非耦合活动块,按信息流方向依次计算活动重叠造成的设计修改时间,进而建立产品开发的时间模型。在给定成本约束下,将开发时间最短问题转化为有约束的最优化问题,并给出相应的求解算法。最后通过实例运算表明了时间模型及其优化方法的有效性。A time computing model with its corresponding optimization method is presented for the overlapping and iteration between design activities in concurrent product development process. The design activity groups are divided into coupling and non-coupling activity blocks based on the programmed design structure matrix. According to the direction of information flow, rework time of each design activity causedby overlapping is calculated in turn. Then the time model of product development is formulated. Given cost constraint, the problem of shortest development time is transformed into constrained optimization problem, and a corresponding algorithm for this problem is proposed. The results of application example show that the time model and optimization method are effective.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.68