Discrete time/costtrade-offproblem:Adecomposition-basedsolutionalgorithm for thebudgetversion

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.