Journal of Northeastern University ›› 2005, Vol. 26 ›› Issue (11): 19-22.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

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.

CLC Number: