Computing algorithm of due dates and cost of configuration product

被引：0

作者：

Liu, Fuyun ^{[1
,2
]}

Qi, Guoning ^{[1
]}

Gu, Xinjian ^{[1
]}

机构：

[1] Zhejiang Univ, Inst Contemporary Mfg Eng, Hangzhou 310027, Peoples R China

[2] Guilin Univ Electron Technol, Dept Electron Machine & Transportat Engn, Guilin, Peoples R China

来源：

WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS | 2006年

关键词：

mass customization; product configuration; complex network; due dates; cost;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Applying complex network theory to mass customization field, with the configuration result of product, a relation network of components and parts of product was construct. A computing algorithm of cost based on birth-first searching algorithm was proposed, two different computing algorithms of due dates, one based on shortest-path search and the other based on simple path search algorithm, were put forwarded, the function and efficiency of the algorithms was analyzed. As an example, a product of industry steam turbine is analyzed with these algorithms and some useful results are obtained.

引用

页码：8491 / +

页数：2