摘要
讨论了定量解决动态联盟盟员选择的问题。提出了基于产品结构 ,结合层次分析法的分析方法和贪心思想的动态联盟盟员选择算法。经过分析 ,算法时间复杂度是O(mnlogn) ,空间复杂度是O(m +n)。
We presented a quantitative solution to select collaborating partners when establishing Agile Virtual Enterprise (AVE). Based on product structure, we put forward an algorithm of collaborating partners selection, though the AHP (Analytic Hierarchy Process) and a greedy algorithm. The analysis results indicate that the time complexity is O (mn log n ); and the space complexity is O(m+n) . ( m is the number of collaborating partners, n is the number of sub-products).
