By analyzing the uncertainty of product disassemble process, a product disassembly sequence planning was mapped into a problem which can be solved by greedy algorithm.
分析了产品实际拆卸过程中的不确定性,将实际产品拆卸序列规划转化为一类贪婪算法求解问题。
By analyzing the uncertainty of product disassemble process, a product disassembly sequence planning was mapped into a problem which can be solved by greedy algorithm.
分析了产品实际拆卸过程中的不确定性,将实际产品拆卸序列规划转化为一类贪婪算法求解问题。
应用推荐