Skip to main content
SpringerLink
Log in

Linear programming based approaches for the discrete time/cost trade-off problem in project networks

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

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 project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1

Similar content being viewed by others

References

  • Akkan C, Drexl A and Kimms A (2005). Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur J Opl Res 165: 339–358.

    Article  Google Scholar 

  • Bein WW, Kamburowski J and Stallmann MFM (1992). Optimal reduction of two-terminal directed acyclic graphs. SIAM J Comput 21: 1112–1129.

    Article  Google Scholar 

  • Butcher WS (1967). Dynamic programming for project cost-time curves. J Construct Div-ASCE 93: 59–73.

    Google Scholar 

  • De P, Dunne EJ, Ghosh JB and Wells CE (1997). Complexity of the discrete time–cost tradeoff problem for project networks. Opns Res 45: 302–306.

    Article  Google Scholar 

  • Deineko VG and Woeginger GJ (2001). Hardness of approximation of the discrete time–cost tradeoff problem. Opns Res Lett 29: 207–210.

    Article  Google Scholar 

  • Demeulemeester E, Herroelen W and Elmaghraby SE (1996). Optimal procedures for the discrete time/cost trade-off problem in project networks. Eur J Opl Res 88: 50–68.

    Article  Google Scholar 

  • Demeulemeester E, De Reyck B, Foubert B, Herroelen W and Vanhoucke M (1998). New computational results on the discrete time/cost trade-off problem in project networks. J Opl Res Soc 49: 1153–1163.

    Article  Google Scholar 

  • Elmaghraby SE (1993). Resource allocation via dynamic programming in activity networks. Eur J Opl Res 64: 199–215.

    Article  Google Scholar 

  • Fulkerson DR (1961). A network flow computation for project cost curves. Mngt Sci 7: 167–178.

    Article  Google Scholar 

  • Kelley JE (1961). Critical-path planning and scheduling: Mathematical basis. Opns Res 9: 296–320.

    Article  Google Scholar 

  • Phillips S and Dessouky MI (1977). Solving the project time/cost tradeoff problem using the minimal cut concept. Mngt Sci 24: 393–399.

    Article  Google Scholar 

  • Robinson DR (1975). A dynamic programming solution to the cost–time tradeoff for CPM. Mngt Sci 22: 158–166.

    Article  Google Scholar 

  • Skutella M (1998). Approximation algorithms for the discrete time–cost tradeoff problem. Math Opns Res 23: 195–203.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Arizona State University, Tempe, AZ-85287, USA

    A B Hafızoğlu

  2. Middle East Technical University, Ankara, 06531, Turkey

    M Azizoğlu

Authors
  1. A B Hafızoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M Azizoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hafızoğlu, A., Azizoğlu, M. Linear programming based approaches for the discrete time/cost trade-off problem in project networks. J Oper Res Soc 61, 676–685 (2010). https://doi.org/10.1057/jors.2009.20

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2009.20

Keywords

Search

Navigation