An equitable approach to the payment scheduling problem in project management

被引:58
作者
Ulusoy, G [1 ]
Cebelli, S
机构
[1] Sabanci Univ, Fac Engn & Nat Sci, TR-81474 Istanbul, Turkey
[2] Koc Holding Co, Automot Grp, TR-81020 Istanbul, Turkey
关键词
project management; genetic algorithms; payment scheduling problem;
D O I
10.1016/S0377-2217(99)00499-3
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This study reports on a new approach to the payment scheduling problem. In this approach, the amount and timing of the payments made by the client and received by the contractor are determined so as to achieve an equitable solution. An equitable solution is defined as one where both the contractor and the client deviate from their respective ideal solutions by an equal percentage. The ideal solutions for the contractor and the client result from having a lump sum payment at the start and end of the project, respectively. A double-loop genetic algorithm (GA) is proposed to solve for an equitable solution. The outer loop represents the client and the inner loop the contractor. The inner loop corresponds to a multi-mode resource-constrained project scheduling problem (RCPSP) with the objective of maximizing the contractor's net present value (NPV) for a given payment distribution. When searching for an equitable solution, information flows between the outer and inner loops regarding the payment distribution over the event nodes and the timing of these payments. An example problem is solved and analyzed. A set of 93 problems from the literature are solved and some computational results are reported. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:262 / 278
页数:17
相关论文
共 24 条
[1]  
BEY RB, 1981, PROJECT MANAGEMENT Q, V12, P223
[2]  
Dayanand N, 1997, J OPER RES SOC, V48, P906
[3]  
Dayanand N., 1995, 9523 CARN MELL U HEI
[4]  
DAYANAND N, 1994, 9440 CARN MELL U HEI
[5]  
DAYANAND N, 1993, 9371 CARN MELL U HEN
[6]   NONPREEMPTIVE MULTIMODE RESOURCE-CONSTRAINED PROJECT SCHEDULING [J].
DREXL, A ;
GRUENEWALD, J .
IIE TRANSACTIONS, 1993, 25 (05) :74-81
[7]   Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm [J].
Gravel, M ;
Nsakanda, AL ;
Price, W .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (02) :286-298
[8]   OPTIMIZATION OF CONTROL PARAMETERS FOR GENETIC ALGORITHMS [J].
GREFENSTETTE, JJ .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01) :122-128
[9]  
Hartmann S, 1998, NAV RES LOG, V45, P733, DOI 10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO
[10]  
2-C