东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2005, Vol. 26 ›› Issue (11): 19-22.DOI: -

• 论著 • 上一篇    下一篇

完工概率最大的伙伴挑选模型

黄敏;王兴伟;汪定伟   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2005-11-15 发布日期:2013-06-24
  • 通讯作者: Huang, M.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(70101006,70431003,60473089,60003006);;

Partner selection model with maximum completion probability

Huang, Min (1); Wang, Xing-Wei (1); Wang, Ding-Wei (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-11-15 Published:2013-06-24
  • Contact: Huang, M.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

446

摘要： 为控制子项目具有随机完工时间的动态联盟企业的项目完工风险,研究在满足项目费用投资和子项目时序约束的条件下使项目完工概率最大的伙伴挑选问题.基于计划评审法(program evaluation and review technique,PERT)描述各子项目时序约束,并建立了相应的非线性整数规划模型,设计了嵌入PERT的遗传算法对问题进行求解,最后通过实例将设计的方法与枚举方法进行了对比分析,研究结果表明该方法在运行时间和效果方面的有效性,从而为随机情况下的动态联盟企业伙伴挑选问题提供了一种有效的管理工具.

关键词: 动态联盟, 伙伴挑选, 计划评审法, 遗传算法, 随机处理时间

Abstract: To control the competition risk of a project of virtual enterprise in dynamic alliance, of which the time to complete its subprojects is stochastic, the problem of partner selection is studied to maximize the completion probability of the project that is constrained by investment and the precedence of its subprojects, which is described on the basis of program evaluation and review technique (PERT). Then, a nonlinear integer-programming model is developed and a PERT-embedded genetic algorithm is designed to solve the problem. A case study is carried out to compare the proposed algorithm with enumeration algorithm. The results suggest that the proposed method is effective in both running time and performance, as a useful management instrument to select partner for a virtual enterprise in dynamic alliance under random conditions.

中图分类号: