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

Authors:
Öncü Hazır;Mohamed Haouari;Erdal Erel
Affiliations:
Industrial Engineering Department, Çankaya University, Ankara 06530, Turkey and Faculty of Business Administration, Bilkent University, Ankara 06800, Turkey;Department of Industrial and Systems Engineering, Faculty of Engineering, Ozyegin University, Istanbul, Turkey and Princess Fatimah Alnijris's Research Chair for AMT, College of Engineering, King ...;Faculty of Business Administration, Bilkent University, Ankara 06800, Turkey
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 1

Optimal reduction of two-terminal directed acyclic graphs

SIAM Journal on Computing
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

Mathematics of Operations Research
A Computational Study of Search Strategies for Mixed Integer Programming

INFORMS Journal on Computing
A survey on benders decomposition applied to fixed-charge network design problems

Computers and Operations Research
The discrete time/cost trade-off problem: extensions and heuristic procedures

Journal of Scheduling

Assembly line balancing under uncertainty: Robust optimization models and exact solution method

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

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.