Title of article
Discrete time/costtrade-offproblem:Adecomposition-basedsolutionalgorithm for thebudgetversion
Author/Authors
O¨ ncu¨ Haz r، نويسنده , , MohamedHaouaric، نويسنده , , d، نويسنده , , ErdalErelb، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
7
From page
649
To page
655
Abstract
This paperinvestigatesthebudgetvariantofthediscretetime/costtrade-offproblem(DTCTP).This
multi-mode projectschedulingproblemrequiresassigningmodestotheactivitiesofaprojectsothat
the totalcompletiontimeisminimizedandthebudgetandtheprecedenceconstraintsaresatisfied.
This problemisoftenencounteredinpracticeastimelycompletionoftheprojectswithoutexceeding
the budgetiscrucial.ThecontributionofthispapertotheliteraturesistodescribeaneffectiveBenders
Decomposition-based exactalgorithmtosolvetheDTCTPinstancesofrealisticsizes.AlthoughBenders
Decomposition oftenexhibitsaveryslowconvergence,wehaveincludedseveralalgorithmicfeaturesto
enhance theperformanceoftheproposedtailoredapproach.Computationalresultsattesttotheefficacy
of theproposedalgorithm,whichcansolvelarge-scaleinstancestooptimality.
Keywords
Project scheduling , Benders decomposition , Time/cost trade-off
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927678
Link To Document