检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学管理学院
出 处:《华中科技大学学报(自然科学版)》2003年第5期92-94,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)
基 金:国家自然科学基金资助项目 (79870 0 73 )
摘 要:论述了拆卸树的绘制规则 ,引入零部件的邻接矩阵L和拆卸可达矩阵R ,通过可达矩阵R与拆卸决策向量X进行布尔运算来识别各中结点是否需要进行拆卸 .在此基础上 ,提出了拆卸时间和拆卸成本的计算算法及 0 1型拆卸优化模型 .并以PC机的回收拆卸为例 ,进行了实际应用 .通过模型求解 ,可以得到满足需求约束的最佳拆卸决策方案 .The principles of drawing disassembly trees were presented. The components of adjacency matrix and disassembly attainment matrix were introduced in the algorithm. Through Boolean operations between the attainment matrix (R) and the disassembly decision vector (X), the nodes to be disassembled can be determined. Based on that, the algorithm for disassembly time and disassembly cost, and a 0-1 programming model of optimizing product′s disassembly were established. Practical examples of PC′s disassembly were given. A best disassembly project was available by finding solutions through the model to meet the demand.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28