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

Authors:
Mario Vanhoucke;Dieter Debels
Affiliations:
Department of Management Information, Operations Management and Technology Policy, Faculty of Economics and Business Administration, Ghent University, Gent, Belgium 9000 and Operations and Technol ...;Department of Management Information, Operations Management and Technology Policy, Faculty of Economics and Business Administration, Ghent University, Gent, Belgium 9000
Venue:
Journal of Scheduling
Year:
2007

Citing 6
Cited 5

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
The analysis of activity networks under generalized precedence relations (GPRs)

Management Science
Characterization and generation of a general class of resource-constrained project scheduling problems

Management Science
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

Mathematics of Operations Research
On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints

Management Science
Hardness of approximation of the discrete time-cost tradeoff problem

Operations Research Letters

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

Computers and Operations Research
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing
A hybrid genetic algorithm for the discrete time-cost trade-off problem

Expert Systems with Applications: An International Journal
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing
A new multi-objective multi-mode model for solving preemptive time-cost-quality trade-off project scheduling problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Time/cost trade-offs in project networks have been the subject of extensive research since the development of the critical path method (CPM) in the late 50s. Time/cost behaviour in a project activity basically describes the trade-off between the duration of the activity and its amount of non-renewable resources (e.g., money) committed to it. In the discrete version of the problem (the discrete time/cost trade-off problem), it is generally accepted that the trade-off follows a discrete non-increasing pattern, i.e., expediting an activity is possible by allocating more resources (i.e., at a larger cost) to it. However, due to its complexity, the problem has been solved for relatively small instances.In this paper we elaborate on three extensions of the well-known discrete time/cost trade-off problem in order to cope with more realistic settings: time/switch constraints, work continuity constraints, and net present value maximization. We give an extensive literature overview of existing procedures for these problem types and discuss a new meta-heuristic approach in order to provide near-optimal heuristic solutions for the different problems. We present computational results for the problems under study by comparing the results for both exact and heuristic procedures. We demonstrate that the heuristic algorithms produce consistently good results for two versions of the discrete time/cost trade-off problem.