#)( %&' "#$  !     


THE USE OF SIMULATED ANNEALING AND GENETIC ALGORITHMS

FOR A MULTI-MODE RESOURCE-CONSTRAINED PROJECT
SCHEDULING PROBLEM WITH DISCOUNTED CASH FLOWS
M. Seifi, R. Tavakkoli-Moghaddam & F. Jolai
Department of Industrial Engineering, Faculty of Engineering, University of Tehran
massoud_seify@yahoo.com, tavakoli@ut.ac.ir, fjolai@ut.ac.ir

Abstract: This paper presents a multi-mode resource-constrained project scheduling problem

(MRCPSP) with maximizing the net present value (NPV) form the project contractors point of
view. Positive and negative cash flows are considered in this model. Furthermore, to make the
model close to the real situations, four different models for positive cash flows are considered.
Two meta-heuristics, called simulated annealing and genetic algorithms, are used in order to
solve the proposed model of the forgoing problem. To schedule all activities, a bi-directional
scheduling generation scheme (SGS) for the multi-mode version is proposed, and the activity

D
list structure selects for presenting a permutation of activities. Finally, computational results for
a set of test problems taken from the project scheduling problem library (PSPLIB) are presented
and discussed.

 
 
!  

 

"#    $% & ' ($ &')  *+

$
SI
of
, -$
.
(
  )
ive

   
  , 

ch

$ " % 

               ! " #  :
/ '01 *2   , 3  4  '5   "  /% - .
,' (  ) *  '+&
= >- .< 7 8&, 2   "  /% -  :+8;    '( 67  4 89

Ar

!    
*A >-  < 7  58< B
8  A  <
7  08 & ?8*@    >9
 4
.< 7 8&,  0 /
 & 
 C D  8E <  7  <*A      *<   $
=
+A  1GA *  I    B
80  ; 8 =I   F*DG  'A <  H 8  > 
.,' (

?8*@ !B
8 ?8*@ !J E '+& $ !'I-  !      :

A  <
7

/ / : 

//:


massoud_seify@yahoo.com ."
# $!
 % &'!
      
  
 , 
tavakoli@ut.ac.ir ."
# $!
 % &'!
      (!
 ,!" #$
% &'$
fjolai@ut.ac.ir ."
# $!
 % &'!
      (!
 ,()* +&,&- &'$

www.SID.ir
 ...    !  "#
$ % &
 '
$(  

 
/0- !12  34 *
5-6 7 ,*'+, - !

8&, ( -*A * 8 Nf "  MMRCPSPDCF    .

  "  /% -    # [h] ?
  g < .<              
 ) * [GA     <  *-  '5 N*M #  (MRCPSPDCF) 8&  =1A "  /% -
 >9
   #  +  ?8*@ B >S . (  < 7 =
09A 
 & n   B .*7' :A
. ( =
+A *  S < 'A <  H 8   I G = (V , E ) P, N*Q  (AON) , O7 B 6<*A
   MMRCPSPDCF  ' [i] * /% DR  /
 & / % 9 /, P, #  .*7'
 /% - %S   *D I  ,  [ GA ![GA *- O7  (i, j ) % DR , .8/ 
9
 6  @  D
' l 5A /  / /
 & j 8 '5   " %    j 
 &  =(  ' i 
 &  @S !7 87
.< 7 8&, 2  E 4  > #
mD/  8& :A V = {1, , n} N*Q    /
 & F*DG .<
   '"
( = $ !8&, N*M N "
"A ^ < .7 '  T DA  U7  G  /
 & n  1  *7'
. *- MRCPSPDCF '-  # G = (V , E ) O7  j V 
 & / 
8&, 2 j 
 &  / F*DG   M j . *-

D
 
.  U7 m {1, , M j }   '8
 & O V  .*7'
1G  7 MnE   !4   58< *  /8 
N p jm .  %    m 

WA %  5( % 7 T G

F N*Q /8   < =1A o  ! Pj F*DG ! G P,
.,' :A p
M
/
 & A : n
 / C D 
] P, : G
SIX  < T m 'I-   T j 
 & T G % 
Y&  T , .*7' :A  '  * #80*
 k [GA   R *7' Z& !7   
 < *-*  Rk %1
  t = 1,, T  /*  B /
of
!T j 
 & T G  #0D '-  / A : M j
   r jkm  
 !*7 T G T m   T j 
 & ,
. j = 1,, n
  0 D
 . t = 1, , T  /*  T k [GA
 j = 1,, n !T m   T j 
 & T G %  : d jm
E '*  CFmj %1
  m   j 
 & =
D0A
. m = 1,, M j
ive

 !%S 'I-   2&M j 

 & =
D0A    D'
m   T j 
 & =
D0A j 8 '5 " % - : CF jm
F*DG #8&  !P/ . D' &  &   CF j+ 
. m = 1,, M j  j = 1,, n !T
., 
> P/  A 0*) < -*    / 
!T j 
 & =
D0A j 8  " % - : CF j+
ch

. j = 1,, n 
 .
T j 
 & U7 %  : ST j
8&, 2  '5+8; P/  *A    =I  
T j 
 & =
D0A %  : FT j
   /
 # %*A' '+  ?
"A B  .*7'
T j 
 & =
D0A %  #A : EF j
Ar

4*\ %=( .  "\ '*  '*

]  /
 8<
T j 
 & =
D0A %  #A : LF j  < '*
] 
 #8*D  #88  - N
T j 
 & 
9
  /
 & F*DG : Pj %S   *7' 8&,  0    #
"" 6<*A
[GA   A : R .[`] *7' T G %  ' 
 ^ <   
k = 1,, R !T k [GA  <  / A : Rk
7 I [dcb]     =I  U*  ' - N "
"A
T G  T k [GA   
 *  / A : r jkm

.<
T m    T j 
 & N*Q   4*\  'Q;9 "  /% -  ' @/
=1A o :   /E  *7' E /
 & T G  1/
    =
D0A %  f )    Y& : T $ 
 ![ N*M  1- =
D0A  1
 % -
.(7 ' /
 & T G %   U*DG        ?> 
 
 B (NPV) '+& J E
MMRCPSPCDF   7 :A  Q8E ?InF   58<
     
 # ^ < .[e] 7 ' 
:< I = (  N*Q .[' N*M 1/ ' 


2.
Makespan Minimization

www.SID.ir
 ...    !  "#
$ % &
 '
$(  

 
    
  , 

 P/  A   #  . D' E  7 =

D0A n LF j
CF j+
Mj

:?  <
Max Z= (1 + ) x
i =1 t = EF j
t
.
m =1
jmt

CF jm
n LF j Mj
LF j Mj

(1 + ) .x (`)
n n
CFjm
CF (1 + ) (1 + ) (w)
+ FT j
Max Z = j t
.x jmt t jmt
i =1 t = EF j m =1
j =1 i =1 t = EF j m=1

s.t.
Mj LF j

 . x jmt = 1 , j (d)
m =1 t = EF j

 
   .
Mj LF j

(t d ).x
Mw LFw
  
*A  < *<    $  Y
"A #  t.x wmt jm jmt , j; w Pj (r)
m=1 t = EFw m =1 t = EF j
!< *<   $  .*7'  58<  
  'I1-   #
mD/  (FS) *+-   'I1-  
M j LFn Mj

max{d }
n
FTn = t.xnmt T , T jm
(b)
0A /  .*7' 8&, 2  % 1D/ (BS) N*Q X"F m =1 Ef n m =1 j =1

= ( N >-  '0  , >A  , <   = ( j 

 & Mj t + d jm 1

D
n

r x
jkm jmb Rk , k , t (e)
.7   j =1 m =1 b=t

.?
' :A  F*DG <     
*A S&  x jmt {0,1} , j , m, t ( h)
% 9 /
9
  8/ ' >8
 & F*DG 4 F*DG 
*+-   >-     #  !7  
% 9 /
  8/ ' /
 & T F*DG . S
X"F   >-  >S     (  7  
SI
, >A  , < B    < ?
DQA 

W8 B x jmt

]   *7 =
D0A T t %    T m   T j 
 &
$ (` ) ) P/  A 4 D( .< 5M   N*Q
of
<   ( /& )  "  /% - J E '+&
?/  /
9
 ?/  8/ ' >8
 & T*< F*DG  ?
8/
'5 "  /% - J E $ T D(   D'
>-  /   >S %*A'  7   % 9 /

. D' 3   ( /E)
= ( *+-   >-   ' /
 & 0A /  .  
 >A 
 & /   D' #
DsA (d)  / F*DG
 *7'  4 "8 B F*DG  8/  
ive

6  . =
D0A %  B t "
(  *7' T G '-  B
 8/   = ( X"F   >-   ' /
 &
T1 (b)  .*7'  u (r)  6<*A 
9

 # #
 x89  /
 & .*7' ="8  F*DG
  = (  /
 & F*DG  T*< F*DG  !F*DG (e) 6  .*7 =
D0A %S   Y&     D'
  D' #
DsA  [GA    /
ch

P[ d  `  /F*DG    ' 4 "8 !< >-  / 

4 F*DG  '& QA N*M  
 & B yz< .*7' :A  ?
DQA  /
W8 %* B  5M (h)  /
'-  /  '0 '& QA { ;8  y  *7' { ;8  /% - J E '+& $ P/  A 4 D( . D'
#0D %  #A   *+-   >-  !%S    N
  . D' <   ( /& )  "
Ar

  t + 1,, t + d jm  /*   t ES j (FS )  E   *- B

<n E *
7 U*  > 
 E ! / U*( %   E !U*DG D
( *
7
     .*7'   !'D V"   
Z& , .*7' 
  D8 E    '  =M*&
 >  .*7' #

A  D
(   %1
 S < 'I1-
  E %1
 !U*DG D
( E *
7   *7
  >-    = (  /
 & 
  j 
 & 1

 A  @S !7 /
 & 
+  "  /% - U*DG
T @/  ` F*DG  /
 & 
  *7' P[ *+-
:S <  )    58< %*A'  P/
N*M  /
 &  '0 1
 X"F   >-  .*7'
n LF j Mj
CF jm
   ' J
Q;A %S  '& QA  B  { ;8 '& QA Max Z = CFLSP (1 + )
FTn
(1 + ) .x t jmt (i)
   
9
  /
 &  '  #A   9, 
 i =1 t = EF j m =1

n
 /
 & 
  j 
 & .*7'   ! D V"  .7 ' CFLSP = CF j+ %S  
j =1
T @/  d F*DG  P[ X"F   >-    = (
U*( 2  &  ! / U*( %   E 
 @ F*DG   /
 &  -*A 1
 r F*DG  *7'
 B / =
D0A %  ft *D  7 J;9 C
   /
 >A '8
 & |
/ @ A  '    #  *7' T @/
 /
 &  B /  v*  1/ !<   /
 &

www.SID.ir
 ...    !  "#
$ % &
 '
$(  

 
   
  , 


  ' /{ ;8 T DA .*7'  G '9>-  '\ "A !G  /

 & >A   #  .7    = ( >- B
'1@ - *7' T G '+& 
D-  \ "A  G 
*A # %
  .7 ' T*< F*DG  /
 & !9  
 T* `~~ Pe PS A  '+& 
D-  .8/  y  *7' { ;8 
 & B '& QA N*Q /
 &
 ' 4 "8  =  
D- /  /T* #AX<  N >-  '0  '& QA N*Q  %S !'& QA  B J
Q;A
.7 '  - 
D-  PS  ; o Pe  
 & yz<  ?
'   X"F     *+-  
@+DF , .*7' 8&, 2  Pc 4 D8 '\ "A @+DF '>A %  A    # .?
' P[ r F*DG   7 { ;8
%* T*   @S *7 { ;8 = 
*A  '\ "A 
  S& # %    .*7' 0A r F*DG %7
1, !', 4*( = (  ^ <  '+& 
D-  #  (FS) *+-   >-  '0  < 7 =M  
 &
Pm 4 D8 C>- @+DF .S' *-*  &   *7' %S <  y .7 ' (BS) X"F   >-  @
A  1
 0A /  .' =DF  - 
D-        #  ' !X"F    *+-    

*A o Pr  *7' 
*A - T* `~~ Pr PS  G      B   T ] @0  'I1-
#

A C
  A   '  B
8 ?8*@ .< G X
AA PnE  d F*DG  /
 & *2 #  .

D
.*7' :(*8 !*D = 
*A 7  .?
' & u 4 F*DG  /
 & F*DG  >S { ;8
   / %S    #0D %  #80* @ %

SI
0*
* 1  /  .+ A   #   J
Q;A 
 &  *7' S 
9
 
T* /  < N*M #  7 I T*  8E < . '  !9   /
 & 
+ 0
 
B ; % n .< /
 & A n   % 2n
% 9 T* ' >8 % n  &  /*E  Q8E 
 &      .
of
'-   *,  8/ /
 & '-  / /  ! " # .
%  < 8&, ( T* % #
 j   '8
 & n  B /  
 B  '7 {*- / C D 
 I T* #  .< 7 J;9 T j + n  '7 '*A B !
 4 D( .*7'  58< *sF
.< C D = ( I = (A1I ,, AnI , M 1I ,, M nI )  y 
 & / %S   < 
9
 6  3 
ive

.*7' T G $
  /
 &  C
  
9
  /
 &
$23 4 5"6 .+ 
"  T D( .*7' 
  " /
 & 
" D( #
 < 7  58< '\ "A @+DF B   >9
 ?8*@   / % 9  < 7 =
09A *sF n  ! T  " /
&%
  o 7  [w] #DA / 6<*A  BA       #
 n + j  *\  < 
 4 D(  /
 & T G
ch

@+DF # !4 67 Y )A >- .< 7 8&,  0 [] .< 

 
 & #
 j T G  / % 9 
 # *sF
, .< 7  <*A     
 Pa2 = (A12 ,, An2 , M12 ,, Mn2 )  Pa1 = (A11,, An1, M11,, Mn1 ) $ %"& ' ( )* .
Ar

 '& QA F  .7 '\ "A @+DF  7 { ;8  )"  {*-  s& )" B    58< * ?8*@ 

*A [1, n 1]   !7 r1 < r2  v7 # r2  r1 p
M < #0D @ %
 .
,' N*M '& QA N*Q @
&  .8/ \ "A v "  J;9  *7' < 7 
*A ?8*@ 6<*A      #ES
(
CH1 = A1C1 ,, ArC11 , ArC11+1,, ArC21 , ArC21+1,, AnC1 , M1C1 ,, MrC11 , .7 87 ?8*@  -     '8/ 7 *@m
/
(
CH2 = A ,, ArC12 , ArC1+21 ,, 
C2
1 M rC11+1 ,, M rC21 , M rC21+1 ,, M nC1 )
.*7' 
*A ACr 2 , ACr 2+1,, ACn 2 , M1C2 ,, MrC2 , MrC2+1,, MrC2 , MrC2+1,, MnC2
2 2 1 1 2 2
) ,-  .+

(M C1
) (
,, MrC11 = M11,, Mr11 )  (A C1
) (
,, ArC11 = A11,, Ar11 ) 4 &    /  .+
1 1

b  < a = r1 + 1,, r2 ! M aC1 = M b2  AaC1 = Ab2 #

mD/  *) 
 
D-  /T* ! >9
 B
8 ?8*@ 
#
mD/ .7 Ab2 {A1C1 , , AaC11 }  < ' #80* < *<     
*A $   58<  '& QA
' #80* b  a=r2+1,,n+1 ! M aC1 = M b1  AaC1 = Ab1  A  '  "S T* 
*A S& .S' *-*
%*A'  9 '"\  .7 Ab1{A1C1,, AaC11}  <  G '7 T* !7 ' 1
 *;  
 
D- 
(
CH 2 = A1C2 ,, ArC1 2 , ArC1+21 ,, ArC22 , ArC22+1 ,, AnC2 , M1C2 ,, M rC1 2 2  ?8*@ '+& = %*F  
 
D-   .*7
.*D :A 1
  , M rC1+21 ,, M rC22 , M rC22+1 ,, M nC2 ) 
*A  /@+DF   58< %S  - =  *7' 8&,

www.SID.ir
 ...    !  "#
$ % &
 '
$(  

 
    
  , 

 - %  #80*  '-   !

 & B  0*) 
  .
 - %  #A'f*\    " % - #8,1  7 8&,  0  >9
 B
8 ?8*@  '9>- @+DF B

 & %S  7 
*A " % - #80* !7 87  < [`~] 5
  o 7  8&, '9>- @+DF # .<
6<*8  1
 
 & /  " % - . ' J
Q;A , .? <*A       %S >A G 
Xu  "  u 
 & % D/  / "  /% - C>-   7 '* I = ( A1I ,, AnI , M 1I ,, M nI )
* `  D7 4- .S' < !*7' 
  (RR ) S   E*0 *A a '& QA F .< 7 { ;8
.< 7 J;9   /  /8  X
A  [, 
9
 #ES AbI  
 Z& #
mD/ .*7' 
*A [1, n 1]

  AaI 
 & 
 #
 AcI 
 &  AaI 
 &
      
     .  [b + 1, c 1]   d T  @ '& QA F .7 I 
 &
Data Set
LSP & PEO I  @S 7 d<a, .*7' 
*A

1
RR
1.25 0.01 (A ,, A
1
I I
d 1 , AaI , AdI ,, AaI1 , AaI+1 ,, AnI ,
2
3
1.25
1.50
0.05
0.01  *7' #1@ - M1I ,, MdI 1, MaI , MdI ,, MaI1, MaI+1,, MnI )

D
4 1.50 0.05
?8*@ / 6<*A !=I   7 :A  /   B /
(A1I ,, AaI1 , AaI+1 ,, AdI 1 , I 
 & 
 7 d > a ,
AdI , AdI +1 ,, AnI , M 1I ,, M aI 1 , M aI +1 ,, M dI 1 , M dI , M dI +1 ,, M nI )
 h~*`~* b *d =bw~~ U*DG  [  7 =  `~
.*7' V*A
.< 8&[ N*M ?8*@ /    < 
E
 /*
7  ?8*@   " H 8 r  d  D7 4-
 /
 & A 4 %*8< ./' % 9  :+8; E
J
Q;A  !T %*8< ./' % 9    /  G
]
SI 
 .
    =I  #
"" #
  *@S
of
   =I   ; 8  *D =I  !< 48  
4- Y )  /' % 9  4  /8     8& 
 ; 8 #  n0 F*DG =I  .< 7 { ;8 (PSPLIB)
 ?8*@ /  'A & A T*< %*8< .7 ' `  D7
 [GA       4 Y)
7 8> {*- % 
  Y&* @ ?8*@  "
!`h !`b !`d !`~    , C7 .<    
P/  A #8> " 6<*8 T > %*8< ./' % 9 !<
ive

{ ;8 PSPLIB  '& QA N*M   G

] 
 & d~  `w
6<*8 ?G %*8< ./' % 9    `~ =  =M 
n039 ! n030 ! n019 ! n010 ! n02  A F X
AA   7
7 =M  {*- #8>   ?8*@ / ' P
 8/   `~ = 7 =I  , #  B / . n044 !
% 9 1
 ES %*8<  /' C D  ?8*@ % D/ 6<*A
 /% - .< 7 = ?8*@ / 6<*A   h~ # 
ch

#
 =M  {*- #8>   Y+) P 6<*8 /
yz<  7 
*A (0,1000]   '& QA N*Q "
.7 ' ?8*@ 
< 7 XA 
 & / - %   -*A =M  G
8
Ar

&'(     )*  ! + ,! "#$  %  . 

Number of
Relative Gap Absolute Gap CPU Ave.
the best Best Objective
Problem Data Ave. (%) Ave. (%) (Sec.)
solution
Size Set
GA SA GA SA GA SA GA SA GA SA

2907.3*
1 7* 3 2863.2 7.40* 8.33 9.65* 12.03 2.68* 4.07
1084.5*
2 7* 3 915.1 2.90* 6.96 4.31* 17.98 2.69* 4.06
j10 3978.1*
3 7* 3 3933.0 5.57* 7.62 6.67* 9.74 2.68* 4.08
1621.39
4 6* 5 1599.69 5.14 1.33* 1.10* 5.39 2.69* 4.09
*

1 9* 1 3156.1* 2967.8 7.31* 7.92 7.54* 13.56 3.59* 5.73

2 5* 5 705.6 725.8* 7.70 7.07* 11.88* 12.77 3.61* 5.72
j12
3 8* 2 4471.5* 4203.8 6.60* 6.70 7.54* 12.96 3.58* 5.72
4 2 8* 1270.5 1309.7* 2.58* 6.41 10.24* 10.89 3.59* 5.72

www.SID.ir
 ...    !  "#
$ % &
 '
$(  

 
   
  , 
-/

&'(     )*  ! + ,! "#$  %  .   

Number of
Relative Gap Absolute Gap CPU Ave.
the best Best Objective
Problem Data Ave. (%) Ave. (%) (Sec.)
solution
Size Set
GA SA GA SA GA SA GA SA GA SA

1 4 6* 3646.0* 3645.8 1.33* 6.71 4.18* 8.33 4.81* 8.21

2 5* 5* 1023.2* 962.1 4.04* 14.89 8.63* 22.18 4.80* 8.20
j14
3 10* 0 5183.2* 4883.1 6.74 6.14* 6.74* 11.68 4.82* 8.21
4 9* 1 1764.7* 1504.7 6.38* 7.10 7.31* 20.58 4.82* 8.21
1 5* 5* 3379.6* 3347.1 5.61* 9.12 8.32* 12.29 7.86* 12.54
2 9* 1 194.3* -31.0 7.89 5.80* 14.07 9.07* 7.87* 12.54
j16
3 7* 4 4831.0* 4715.1 5.10* 5.94 5.85* 8.92 7.87* 12.58
4 7* 3 604.9* 508.6 5.83* 10.56 8.48* 16.66 7.89* 12.54
1 8* 2 3800.2* 3601.6 8.32* 8.62 9.08* 14.32 11.07* 18.20
2 9* 1 196.8* -6.6 15.21 5.45* 21.72 8.18* 11.08* 18.16

D
j18
3 6* 4 5590.6* 5407.0 6.36* 7.32 7.11* 10.66 11.06* 18.15
4 4 6* 782.6* 701.3 19.87 15.83* 30.32 25.56* 11.08* 18.17
1 9* 1 4268.1* 4056.3 9.14* 9.33 9.79* 14.63 14.30* 23.66

SI
2 9* 1 473.7* 87.0 6.77 4.95* 9.15* 12.85 14.32* 23.73
j20
3 7* 3 6106.7* 5975.3 6.22* 7.32 6.76* 9.97 14.30* 23.70
4 5* 5* 958.6 964.1* 10.15 10.35 8.92* 16.71 14.31* 23.72

  &1 23$      )*  ! + ,! "#$  %  .0 
of
Number of the Relative Gap Absolute Gap CPU Ave.
Problem Data Best Objective
best solution Ave. (%) Ave. (%) (Sec.)
Size Set
GA SA GA SA GA SA GA SA GA SA

1 6* 4 3425.0* 3376.9 5.18* 6.64 6.05* 8.49 2.68* 4.07

2 8* 2 2548.5* 2440.7 7.60 6.55* 7.92* 10.28 2.69* 4.06
ive

j10 3 5* 5* 4547.5* 4575.4 3.84* 4.90 4.86* 5.45 2.68* 4.08

4 8* 2 3357.1* 3239.2 5.05 4.87* 5.22* 8.05 2.69* 4.09

1 9* 1 3903.3* 3765.0 6.18 5.09* 6.49* 8.79 3.59* 5.73

2 8* 2 2724.0* 2652.6 6.05* 7.12 7.08* 10.38 3.61* 5.72
j12 3 8* 2 5293.1* 5116.1 4.80 4.34* 5.58* 8.08 3.58* 5.72
4 5* 5* 3731.0* 3712.7 5.46* 7.46 6.79* 9.25 3.59* 5.72
ch

1 7* 3 4577.6* 4458.0 5.98* 7.76 6.90* 11.08 4.81* 8.21

2 10* 0 3304.9* 3145.6 6.35* 7.73 6.43* 12.46 4.80* 8.20
j14 3 9* 1 6184.1* 5973.2 4.79* 5.34 5.24* 8.93 4.82* 8.21
4 6* 4 4430.6* 4249.2 5.07 4.93* 6.33* 9.77 4.82* 8.21
Ar

1 7* 3 4741.4* 4620.9 4.83 4.35* 5.21* 6.97 7.86* 12.54

2 5* 5* 2738.6* 2696.8 5.37 5.19* 6.18* 7.44 7.87* 12.54
j16 3 6* 4 6433.7* 6360.9 3.64* 4.27 3.97* 5.61 7.87* 12.58
4 9* 1 3785.8* 3697.8 4.75 3.60* 4.96* 5.82 7.89* 12.54

1 5* 5* 5284.0* 5153.6 6.05* 6.52 6.76* 9.55 11.07* 18.20

2 6* 4 3284.3* 3269.2 4.95* 7.53 7.64* 9.80 11.08* 18.16
j18 3 6* 4 7225.0* 7161.6 3.77* 4.54 4.54* 6.06 11.06* 18.15
4 6* 4 4509.1* 4493.0 4.57 5.40* 6.04* 7.15 11.08* 18.17

1 7* 3 5691.8* 5584.5 5.82 5.61* 6.43* 7.87 14.30* 23.66

2 6* 4 3809.8* 3716.3 6.75* 5.81 8.42* 10.04 14.32* 23.73
j20 3 7* 3 7865.0* 7814.4 3.95* 5.72 4.93* 7.24 14.30* 23.70
4 8* 2 5285.4* 5024.4 5.77 4.65* 6.36* 9.61 14.31* 23.72

{*- ?8*@  * %~/d`   < 87  1 #  

 .
?8*@ '< *  /  %r/ie  . I  ' 0  /' % 9 7 =   bw~  ?8*@   "
#  < *D I P/  A   8> 6<*8 B
8  " #8> #8&   Y&* B
8 ?8*@ * %hw/h
%`/hi  %hd/e X
AA  Y+)  ' P  " A  <
7 ?8*@ * %r`/bh   < 7 P/  A

www.SID.ir
 ...    !  "#
$ % &
 '
$(  

 
    
  , 

'@D/  
  ' P 6<*8 , .7 '
 &, G
8 %*A' "  #  !?
I D Z& ?8*@
< A@D/ B
8 ?8*@   A  <
7 ?8*@
8D G
8   *7'  8&, '+  /
> T  89
'
.*7' B
8 ?8*@   8>  /{*- I  Y&*
6<*8 *)  /' % 9 1
 ?8*@  = %   "
=  A  <
7 ?8*@ %h`/b` >A B
8 ?8*@
.<  PM ( =I 

 
[1] Sprecher, A., Kolisch, R., Drexl, A., Semi-Active, Active,
and Non-Delay Schedules for the Resource-Constrained

D
Project Scheduling Problem, European Journal of
Operational Research, Vol. 80, 1995, PP. 94-102.

SI
[2] Icmeli, O., Erenguc, S.S., Zappa, C.J., Project
Scheduling Problems: A Survey, International Journal
of Operations and Production Management, Vol. 13,
1993, PP. 80-91.

[3] Herroelen, W.S., Van Dommelen, P., Demeulemeester,

of
E.L., Resource-Constrained Project Scheduling: A
Survey on Recent Developments, Computers and
Operations Research, Vol. 25, 1998, PP. 279-302.

[4] Kolisch, R., Padman, R., An Integrated Survey of

Deterministic Project Scheduling, OMEGA, The
ive

International Journal of Management Science, Vol. 29,

2001, PP. 249-272.

[5] Bey, R.B., Doersch, R.H., Patterson, J.H., The Net

Present Value Criterion: Its Impact on Project
ch

Scheduling, Project Management Quarterly, Vol. 12,

No. 2, 1981, PP. 35-45.

[6] Sung, C.S., Lim, S.K., A Project Activity Scheduling

Problem with Net Present Value Measure, International
Journal of Production Economics, Vol. 37, 1994, PP.
Ar

177-187.

[7] Ulusoy, G., Sivrikaya-Serifoglu, F., Sahin, S., Four

Payment Models for the Multi-Mode Resource
Constrained Project Scheduling Problem with
Discounted Cash Flows, Annals of Operations
Research, Vol. 102, 2001, PP. 237-261.

[8] Hartmann, S., A Competitive Genetic Algorithm for

Resource-Constrained Project Scheduling, Naval
Research Logistics, Vol. 45, 1998, PP. 733-750.

[9] Shadrokh, S., Kianfar, F., A Genetic Algorithm for

Resource Investment Project Scheduling Problem,
Tardiness Permitted with Penalty, European Journal of
Operational Research, Vol. 181, 2007, PP. 86-101.

www.SID.ir