Time-cost trade-off via optimal control theory in Markov PERT networks

被引:25
作者
Azaron, Amir
Katagiri, Hideki
Sakawa, Masatoshi
机构
[1] Hiroshima Univ, Grad Sch Engn, Hiroshima 7398527, Japan
[2] Dalhousie Univ, Dept Ind Engn, Halifax, NS, Canada
[3] Univ Bu Ali Sina, Fac Engn, Dept Ind Engn, Hamadan, Iran
关键词
project management; multiple objective programming; optimal control theory; Markov processes;
D O I
10.1007/s10479-006-0149-x
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We develop a new analytical model for the time-cost trade-off problem via optimal control theory in Markov PERT networks. It is assumed that the activity durations are independent random variables with generalized Erlang distributions, in which the mean duration of each activity is a non-increasing function of the amount of resource allocated to it. Then, we construct a multi-objective optimal control problem, in which the first objective is the minimization of the total direct costs of the project, in which the direct cost of each activity is a non-decreasing function of the resources allocated to it, the second objective is the minimization of the mean of project completion time and the third objective is the minimization of the variance of project completion time. Finally, two multi-objective decision techniques, viz, goal attainment and goal programming are applied to solve this multi-objective optimal control problem and obtain the optimal resources allocated to the activities or the control vector of the problem.
引用
收藏
页码:47 / 64
页数:18
相关论文
共 37 条
[1]  
[Anonymous], 1967, MANAGEMENT SCI, DOI DOI 10.1287/MNSC.13.5.299
[2]   Optimal control of service rates and arrivals in Jackson networks [J].
Azaron, A ;
Ghomi, SMTF .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (01) :17-31
[3]   RESOURCE-ALLOCATION IN A PERT NETWORK UNDER CONTINUOUS ACTIVITY TIME-COST FUNCTIONS [J].
BERMAN, EB .
MANAGEMENT SCIENCE, 1964, 10 (04) :734-745
[4]  
BURT J, 1977, MANAGE SCI, V18, P207
[5]   CRITICAL PATH ANALYSES VIA CHANCE CONSTRAINED + STOCHASTIC-PROGRAMMING [J].
CHARNES, A ;
COOPER, WW ;
THOMPSON, GL .
OPERATIONS RESEARCH, 1964, 12 (03) :460-&
[6]  
CHAU D, 1997, CIVIL ENG SYSTEMS, V14, P291
[7]   MODIFICATION OF FULKERSONS PERT ALGORITHM [J].
CLINGEN, CT .
OPERATIONS RESEARCH, 1964, 12 (04) :629-&
[8]  
Demeulemeester E., 1993, OPTIMAL PROCEDURES D
[9]   RESOURCE-ALLOCATION VIA DYNAMIC-PROGRAMMING IN ACTIVITY NETWORKS [J].
ELMAGHRABY, SE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 64 (02) :199-215
[10]   CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES [J].
FALK, JE ;
HOROWITZ, JL .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1972, 19 (04) :446-455