Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem

2013-10-01
Degirmenci, G.
Azizoğlu, Meral
Show full item record
175
views
0
downloads
The time/cost trade-off models in project management aim to reduce the project completion time by putting extra resources on activity durations. The budget problem in discrete time/cost trade-off scheduling selects a time/cost mode for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally and each solution may have a different total cost value. In this study we consider the budget problem and aim to find the minimum cost solution among the minimum project completion time solutions. We analyse the structure of the problem together with its linear programming relaxation and derive some mechanisms for reducing the problem size. We solve the reduced problem by branch and bound based optimization and heuristic algorithms. We find that our branch and bound algorithm finds optimal solutions for medium-sized problem instances in reasonable times and the heuristic algorithms produce high quality solutions very quickly.
Project management, Time/cost trade-off, Budget problem
https://hdl.handle.net/11511/48810
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Department of Industrial Engineering, Article

Suggestions

A mixed integer model for optimization of discrete time cost tradeoff problem
Tatar, Ali Can; Bilir, Mert; Sönmez, Rifat; Atan, Sabri Tankut (null; 2016-06-25)
In construction projects, activity durations can be expedited by allocating additional resources. Decreasing activity durations by means of crashing, usually leads to increase in the direct expenses. This trade-off between time and cost is called as the time-cost trade-off problem. Since in practice many resources are available in discrete units, numerous research has focussed on the discrete version of this problem called the discrete time-cost trade-off problem (DTCTP). Achieving the project schedule that...
Pareto oriented optimization of discrete time cost trade off problem using particle swarm optimization
Aminbakhsh, Saman; Sönmez, Rifat (2015-09-07)
In project scheduling, it is feasible to reduce the duration of a project by allocating additional resources to its activities. However, crashing the project schedule will impose additional costs. Numerous research has focused on optimizing the trade-off between time and cost to achieve a set of non-dominated solutions. However, the majority of the research on time-cost trade-off problem developed methods for relatively simple problems including up to eighteen activities, which are not representing the comp...
Linear programming based approaches for the discrete time/cost trade-off problem in project networks
Hafizoglu, A. B.; Azizoğlu, Meral (Informa UK Limited, 2010-04-01)
In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the pro...
A genetic algorithm for the resource constrained project scheduling problem
Özleyen, Erdem; Sönmez, Rifat; Department of Civil Engineering (2011)
The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard (Non-Deterministic Polynomial-Time Hard) in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study a genetic algorithm is proposed for the RCPSP. The proposed genetic algorithm (GA) aims to find near-o...
The budget constrained discrete time/cost trade-off problem in project networks
Değirmenci, Güvenç; Azizoğlu, Meral; Department of Industrial Engineering (2008)
The time/cost trade-off models in project management aim to compress the project completion time by accelerating the activity durations at an expense of additional resources. The budget problem in discrete time/cost trade-off scheduling selects the time/cost mode -among the discrete set of specified modes- for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally, however each solution may ha...
Citation Formats
G. Degirmenci and M. Azizoğlu, “Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 1474–1484, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48810.
METU IIS - Integrated Information Service open@metu.edu.tr