OPTIMAL PROJECT COMPRESSION WITH DUE-DATED EVENTS

被引:11
作者
ELMAGHRABY, SE [1 ]
PULAT, PS [1 ]
机构
[1] N CAROLINA STATE UNIV, RALEIGH, NC 27650 USA
关键词
D O I
10.1002/nav.3800260213
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The paper proposes an algorithm for the determination of the solution of the activities to be shortened and the amount by which they are to be shortened in order to minimize the total cost of project completion. This cost involves a linear penalty for tardiness of a set of key events and a linear cost of activity compression from its normal duration. The procedure is a generalization of the work of D. R. Fulkerson.
引用
收藏
页码:331 / 348
页数:18
相关论文
共 6 条
[1]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[2]  
ELMAGHRABY SE, 1977, ACTIVITY NETWORKS PR
[3]   A NETWORK FLOW COMPUTATION FOR PROJECT COST CURVES [J].
FULKERSON, DR .
MANAGEMENT SCIENCE, 1961, 7 (02) :167-178
[4]  
Hardy G. H., 1934, INEQUALITIES
[5]  
Lawler EL., 2001, COMBINATORIAL OPTIMI
[6]  
PULAT PS, 1978, OR138 N CAR STAT U R