Skip to Main content Skip to Navigation
Journal articles

Discrete time/cost trade-off problem: A decomposition based solution algorithm for the budget version

Oncu Hazir 1 Mohamed Haouari Erdal Erel
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper investigates the budget variant of the discrete time/cost trade-off problem (DTCTP). This multi-mode project scheduling problem requires assigning modes to the activities of a project so that the total completion time is minimized and the budget and the precedence constraints are satisfied. This problem is often encountered in practice as timely completion of the projects without exceeding the budget is crucial. The contribution of this paper to the literatures is to describe an effective Benders Decomposition-based exact algorithm to solve the DTCTP instances of realistic sizes. Although Benders Decomposition often exhibits a very slow convergence, we have included several algorithmic features to enhance the performance of the proposed tailored approach. Computational results attest to the efficacy of the proposed algorithm, which can solve large-scale instances to optimality.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01185234
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 3:04:03 PM
Last modification on : Friday, January 8, 2021 - 5:48:02 PM

Links full text

Identifiers

Citation

Oncu Hazir, Mohamed Haouari, Erdal Erel. Discrete time/cost trade-off problem: A decomposition based solution algorithm for the budget version. Computers and Operations Research, Elsevier, 2010, 37 (4), pp.649-655. ⟨10.1016/j.cor.2009.06.009⟩. ⟨hal-01185234⟩

Share

Metrics

Record views

190