COMPUTATIONAL EXPERIENCE WITH AN OPTIMAL PROCEDURE FOR THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS

被引:28
作者
HERROELEN, WS
GALLENS, E
机构
[1] Department of Applied Economic Sciences, Katholieke Universiteit Leuven, B-3000 Leuven
关键词
ACTIVITY NETWORKS; SCHEDULING; NET PRESENT VALUE;
D O I
10.1016/0377-2217(93)90340-S
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In a recent paper (Elmaghraby and Herroelen, 1990), an optimal procedure was presented for the resolution of the problem of maximizing the net present value of a project through the manipulation of the times of realization of its key events. The procedure has been programmed in C for personal computers running under the DOS operating system. In this note we report on the promising computational experience obtained with the algorithm on a problem set involving 250 randomly generated projects.
引用
收藏
页码:274 / 277
页数:4
相关论文
共 4 条
[1]   THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS [J].
ELMAGHRABY, SE ;
HERROELEN, WS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 49 (01) :35-49
[2]  
HERROELEN WS, 1989, 8901 KATH U LEUV DEP
[3]   CASH FLOWS IN NETWORKS [J].
RUSSELL, AH .
MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :357-373
[4]  
SCHRAGE L, 1989, LINEAR INTEGER QUADR