Resource-constrained project scheduling_ Notation, classific(21)

项目进度管理

P.Bruckeretal./EuropeanJournalofOperationalResearch112(1999)3±4123

IntypesNeumannofobjectiveandfunctionsZimmermann(9)are[141,142],considered.threeIff rk Yt

t 0Y1YFFFYÀ1

rk Yt Y 12

wenotedspeakusedbyof thejtempresourcej investmentproblemde-kmaxrk Yt bewherepurchased.inpracticeAwhen,whichissecondexpensivetypeofobjectiveresourcesfunctionhavetof rk Yt

1 rk Yt À k

13

t 0

measuressource kfromthedeviationoftheutilizationkP0. kmayaconsumptionofre-

betargetequalvaluetotheforaverageresourceresourceusagereplacedjP rjkpja FFF infunctionbywherejFFFjor FFF 2.AthirdtypeEq.(13)ofobjectivecanbef rk Yt

rk Yt Àrk YtÀ1

14

t 0

withtionforofrk YÀ1 rk Y 0considersthevaria-kindsexample,resourcereplacedofmanpower.ifutilizationthebyjFFFjorAgainresourcesover FFF 2 FFF representtimeandinEq.(14)di erentisused,

canbeentThefoundvaluesbasicofconceptsthecashof.

cash¯owsandnetpres-theinRussell[166]and¯owsHerroelenofaprojectetal.canbeproblemobjectivefunction Fofgthenetpresent[95].valueInj

per jtempj jb,bisthediscountrateactivityperiodpletionj,whichand Fisjthecash¯owassociatedwithpositivetimecurred).(paymentgassumedtooccuratthecom-j received)j pjofactivityornegativejand(costcanin-beformulatedThenetpresentvalueproblemcanthenbemax

asfollows:

FgP

jb

j

jsXtX 10 Y 11 7.2.Exactalgorithms

whetherAswiththereproblemisafeasible solutionjtempjgtomax ,jtesting

tempj

NP-complete. kf rk Yt or jtempj Fjbgj

isstrongly Forthe sourceYIjposedconstraintstempjnet Fjbgpresentvalueproblem

j

(11)),(thatDeis,Reyckthere[51]arehasnopro-re-O n4arecursivesearchprocedureproblem time.only ThisYIjalgorithmpre j generalizeswhichF

methodsrunsforin

jbgjmin

(thatGrinoldminimumtimelagsdij

pis,thereare

i)devisedbyHerroelen[78],dureetElmaghrabyandHerroelen[68],andtostartswithal.[93].theearliestDeReyck'sschedulerecursivei andproce-setsdelay®rstlyactivitiesjwith Ftriesj`0andsecondlypresentofconnectedactivitieswithnegativenetthevalueasfaraspossiblewithoutviolatingthetemporalmentalnetpresentconstraintsvalueof(10)theinproject.ordertoAnincreaseaverage,performancesolvedaninstanceanalysiswithhas100shownactivitiesthat,experi-onthe Forinthelessthan1susingaPCPentiumcan60.bebranch-and-boundjtempj general Fjbg,DenetReyckpresent[51]valuehasdevisedproblemjDemethod,whichisbasedupona schedulingjtempReyck'sjgbranch-and-boundalgorithmformax,wheretheresource-unconstrainedobjectivecursivefunctionproblemsarewithsolvednetbypresentDevalueas Reyck'sexperimentalprocedurefor YIjtempj Fjgre-jwithshownupto50performanceactivitiesandanalysis®vewithinstancesb.Anmethodthat,fectivenessforprocedureand injprinciple,temp theFgbranch-and-boundresourceshasj

e ciencyj jasbthehasthesameef- similar Ffor jtempjgcorrespondingmax.For jpre jjbgj

,Icmeli c[98]haveproposedatroducesbranch-and-boundandErengu

solveadditionalprecedencealgorithm,constraintswhichtoin-re-and-boundresourcecon¯ictsinanalogytotheHerroelenFor[48]procedurebyDemeulemeesterbranch-andexact f rtheresourcefor levelingjpre jproblemgmax.

YIjpre jkk Ytprogramming,algorithms withspecialobjectivefunctions,beenorbaseddynamicuponenumeration,programmingintegeret al.proposed[7],andbyAhuja[2],Easa[62],Bandellonihave YounisbasedYIjtempbranch-and-boundj andSaad[200].Forkf rk Yt procedure,atime-windowhasbeen