Partner selection with a due date constraint in virtual enterprises

被引：45

作者：

Zeng, Zhi-Bin

Li, Yan

Zhu, Wenxing ^{[1
]}

机构：

[1] Xian Univ Technol, Sch Machinery & Precis Instrument Engn, Xian 710048, Peoples R China

[2] Fuzhou Univ, Dept Comp Sci & Technol, Fuzhou 350002, Peoples R China

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2006年 / 175卷 / 02期

基金：

中国国家自然科学基金;

关键词：

virtual enterprise; partner selection; nonlinear integer programming; Branch & Bound;

D O I：

10.1016/j.amc.2005.08.022

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, the partner selection problem with a due date constraint in virtual enterprises is proved to be an NP-complete problem. So it cannot have any polynomial time solution algorithm at present. A nonlinear integer programming model for this problem is established. The objective function and a constraint function of the model have monotone properties. Based on the above observations, a Branch & Bound algorithm is constructed to solve the problem. Numerical experiments show that the algorithm is efficient. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：1353 / 1365

页数：13

共 10 条

[1]

ELMAGHRAPHY SE, 1977, ACTIVITY NETWORKS PR

[2] Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise [J].