A multi-objective resource allocation problem in PERT networks

被引:33
作者
Azaron, A
Katagiri, H
Sakawa, M
Kato, K
Memariani, A
机构
[1] Hiroshima Univ, Grad Sch Engn, Dept Artificial Complex Syst Engn, Higashihiroshima 7398527, Japan
[2] Bu Ali Sina Univ, Dept Ind Engn, Hamadan, Iran
关键词
multiple objective programming; project management and scheduling; optimal control; Markov processes;
D O I
10.1016/j.ejor.2004.11.018
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each activity is a non-increasing function and the direct cost of each activity is a non-decreasing function of the amount of resource allocated to it. The decision variables of the model are the allocated resource quantities. The problem is formulated as a multi-objective optimal control problem that involves four conflicting objective functions. The objective functions are the total direct costs of the project (to be minimized), the mean of project completion time (min), the variance of project completion time (min), and the probability that the project completion time does not exceed a certain threshold (max). The surrogate worth trade-off method is used to solve a discrete-time approximation of the original problem. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:838 / 854
页数:17
相关论文
共 30 条
[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]   CONDITIONAL MONTE CARLO - SIMULATION TECHNIQUE FOR STOCHASTIC NETWORK ANALYSIS [J].
BURT, JM ;
GARMAN, MB .
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (03) :207-217
[5]   CRITICAL PATH ANALYSES VIA CHANCE CONSTRAINED + STOCHASTIC-PROGRAMMING [J].
CHARNES, A ;
COOPER, WW ;
THOMPSON, GL .
OPERATIONS RESEARCH, 1964, 12 (03) :460-&
[6]   MODIFICATION OF FULKERSONS PERT ALGORITHM [J].
CLINGEN, CT .
OPERATIONS RESEARCH, 1964, 12 (04) :629-&
[7]  
Demeulemeester E., 1993, OPTIMAL PROCEDURES D
[8]   RESOURCE-ALLOCATION VIA DYNAMIC-PROGRAMMING IN ACTIVITY NETWORKS [J].
ELMAGHRABY, SE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 64 (02) :199-215
[9]   CRITICAL PATH PROBLEMS WITH CONCAVE COST-TIME CURVES [J].
FALK, JE ;
HOROWITZ, JL .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1972, 19 (04) :446-455
[10]   ESTIMATING CRITICAL PATH AND ARC PROBABILITIES IN STOCHASTIC ACTIVITY NETWORKS [J].
FISHMAN, GS .
NAVAL RESEARCH LOGISTICS, 1985, 32 (02) :249-261