检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵晋敏[1] 刘继红[1] 钟毅芳[1] 金国栋[1]
机构地区:[1]华中科技大学CAD中心,湖北武汉430074
出 处:《计算机集成制造系统-CIMS》2001年第4期36-39,72,共5页
基 金:国家 8 6 3/CIMS主题资助项目!(86 3-5 11-930 -0 12 )
摘 要:耦合任务集的割裂规划有助于并行设计过程的组织与管理 ,以加快设计过程收敛和减少产品开发时间。割裂规划方法研究旨在提高割裂规划的有效性。针对现有割裂规划方法的不足 ,本文提出了一套从构造到割裂数字双指标耦合任务集的系统化新方法 :用敏感度与可变度双指标表征任务间依赖关系 ,用基于层次结构法的两两比较技术数字化双指标耦合任务集 ;用基于次序指标的算法割裂数字耦合任务集。最后 ,用汽车车门并行设计的实例对方法进行了验证。实践表明 ,该方法不仅能有效地保证并行设计过程的尽快收敛 ,而且具有一定的科学性系统性 ,简单易用 。Tearing Algorithms of coupled task set is helpful in organizing and managing the concurrent design process to increase the efficiency of the design process and reduce the product development time. The study aim of the paper is to improve the effectiveness of tearing algorithms. In view of the disadvantages of the existing tearing algorithms, a new and systematic method is proposed. This new method measures the dependency between two tasks through sensibility and changeability, and numeralizes the bi-measure coupled task set based on a proposed pair-wise comparison technique of AHP method. And then, by defining a new concept of order index, a new algorithm to tearing coupled task set is provided. In the end of the paper, an auto door design case has been given to validate the new method, and the result shows that the proposed method is not only effective and efficient to converge design process to a desired solution, but also scientific, systematic, simple and easy to use.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117

