Title of article
A decomposition-basedstochasticprogrammingapproachforthe project schedulingproblemundertime/costtrade-offsettingsand uncertain durations
Author/Authors
E. Klerides، نويسنده , , E.Hadjiconstantinou ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
2131
To page
2140
Abstract
Resourceallocationinprojectnetworksallowsforthecontroloftheprocessingtimeofanactivity
under time–costtradeoffsettings.Inpractice,projectdecisionsaremadeinadvancewhenactivity
durationsarestillhighlyuncertain.Givenanactivity-on-nodeprojectnetworkandasetofexecution
modesforeachactivity,weconsidertheproblemofdecidinghowandwhentoexecuteeachactivityto
minimizeprojectcompletiontimeortotalcostwithrespecttocapturedactivitydurations.Theinherent
stochasticityisrepresentedusingasetofdiscretescenariosinwhicheachscenarioisassociatedwitha
probabilityofoccurrenceandarealizationofactivitydurations.Inthispaper,weproposeapath-based
two-stagestochasticintegerprogrammingapproachinwhichtheexecutionmodesaredeterminedin
the firststagewhilethesecondstageperformsactivityschedulingaccordingtotherealizationsof
activitydurations,hence,providingflexibilityintheschedulingprocessatsubsequentstages.The
solution methodologyisbasedonadecompositionalgorithmwhichhasbeenimplementedandwidely
tested usingalargenumberoftestinstancesofvaryingsizeanduncertainty.Thereported
computationalresultsdemonstratethattheproposedalgorithmconvergesfasttotheoptimalsolution
and presentthebenefitsofusingthestochasticmodelasopposedtothetraditionaldeterministicmodel
that considersonlyexpectedvaluesofactivitydurations.
Keywords
Decomposition , Project scheduling , Time–cost trade-off , Stochastic programming
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927816
Link To Document