期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 87, 期 2, 页码 195-205出版社
ELSEVIER
DOI: 10.1016/S0925-5273(03)00125-7
关键词
branch and bound; project management; partner selection; virtual enterprise; integer programming; agile manufacturing; earliness/tardiness scheduling
Partnership and partner selection play a key role for Opportunity Driven project contractors in agile manufacturing environment. In this paper, we present an investigation on the partner selection problems with engineering projects. Firstly, the problem is described by a 0-1 integer programming with non-analytical objective function. It is proven that the partner selection problem is a type of earliness and tardiness production planning problems. By introducing the concepts of inefficient and ideal candidates, we propose the theory of solution space reduction which can efficiently reduce the complexity of the problem. Then, a branch and bound algorithm embedded project scheduling is developed to obtain the solution. The approach was demonstrated by the use of an experimental example drawn from a construction project of coal fire power station. The computational results have been found to be satisfactory. (C) 2003 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据