Skip to main content

Robust Optimization for the Discrete Time-Cost Tradeoff Problem with Cost Uncertainty

  • Chapter
  • First Online:
Handbook on Project Management and Scheduling Vol. 2

Abstract

Projects are subject to various sources of uncertainty that hamper reaching project targets; hence, it is crucial importance to use effective approaches to generate robust project schedules, which are less vulnerable to disruptions caused by uncontrollable factors. In this vein, this chapter examines analytical models and algorithms of robust multi-mode project scheduling, specifically, the robust discrete time-cost tradeoff problem (DTCTP). The models and algorithms presented in this chapter can support project managers from a wide range of industries in scheduling activities to minimize deviations from project goals. Furthermore, some surrogate measures that aim at providing an accurate estimate of the schedule robustness are developed and related experimental results are presented. Finally, some potential research areas are proposed and discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Aissi H, Bazgan C, Vanderpooten D (2009) Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur J Oper Res 197(2):427–438

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Al-Fawzan M, Haouari M (2005) A bi-objective model for robust resource-constrained project scheduling. Int J Prod Econ 96(2):175–187

    Article  Google Scholar 

  • Artigues C, Leus R, Talla Nobibon F (2013) Robust optimization for resource-constrained project scheduling with uncertain activity durations. Flex Serv Manuf J 25:175–205

    Article  Google Scholar 

  • Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98:49–71

    Article  Google Scholar 

  • Bertsimas D, Brown D, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464–501

    Article  Google Scholar 

  • Chtourou H, Haouari M (2008) A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling. Comput Ind Eng 55(1):183–194

    Article  Google Scholar 

  • Cohen I, Golany B, Shtub A (2007) The stochastic time-cost tradeoff problem: a robust optimization approach. Networks 49(2):175–188

    Article  Google Scholar 

  • De P, Dunne EJ, Ghosh JB, Wells CE (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81(2):225–238

    Article  Google Scholar 

  • De P, Dunne EJ, Ghosh JB, Wells CE (1997) Complexity of the discrete time/cost trade-off problem for project networks. Oper Res 45:302–306

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Erenguc SS, Tufekci S, Zappe CJ (1993) Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition. Nav Res Log 40(1):25–50

    Article  Google Scholar 

  • Gabrel V, Murat C (2010) Robustness and duality in linear programming. J Oper Res Soc 61:1288–1296

    Google Scholar 

  • Gabrel V, Murat C, Wu L (2013) New models for the robust shortest path problem: complexity, resolution and generalization. Ann Oper Res 207(1):97–120

    Article  Google Scholar 

  • Garaix T, Artigues C, Briand C (2013) Fast minimum float computation in activity networks under interval uncertainty. J Sched 16(1):93–103

    Article  Google Scholar 

  • Goren S, Sabuncuoglu I (2008) Robustness and stability measures for scheduling: single-machine environment. IIE Trans 40(1):66–83

    Article  Google Scholar 

  • Hazır O, Schmidt K (2013) An integrated scheduling and control model for multi-mode projects. Flex Serv Manuf J 25(1–2):230–254

    Article  Google Scholar 

  • Hazır O, Haouari M, Erel E (2010a) Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37(4):649–655

    Article  Google Scholar 

  • Hazır O, Haouari M, Erel E (2010b) Robust scheduling and robustness measures for the discrete time/cost trade-off problem. Eur J Oper Res 207(2):633–643

    Article  Google Scholar 

  • Hazır O, Erel E, Gunalay Y (2011) Robust optimization models for the discrete time/cost trade-off problem. Int J Prod Econ (1):87–95

    Article  Google Scholar 

  • Herroelen W (2005) Project scheduling: theory and practice. Prod Oper Manag 14(4):413–432

    Article  Google Scholar 

  • Herroelen W, Leus R (2005) Project scheduling under uncertainty: survey and research potentials. Eur J Oper Res 165(2):289–306

    Article  Google Scholar 

  • Kalai R, Lamboray C, Vanderpooten D (2012) Lexicographic α robustness: an alternative to min-max criteria. Eur J Oper Res 220(3):722–728

    Article  Google Scholar 

  • Klerides E, Hadjiconstantinou E (2010) A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations. Comput Oper Res 37(12):2131–2140

    Article  Google Scholar 

  • Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega-Int J Manag S 29(3):249–272

    Article  Google Scholar 

  • Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Nonconvex optimization and its applications, vol 14. Kluwer Academic, Dordrecht

    Book  Google Scholar 

  • Li H, Womer K (2009) Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm. J Sched 12:281–298

    Article  Google Scholar 

  • McCarthy SC, Tiong RLK (1991) Financial and contractual aspects of build-operate-transfer projects. Int J Proj Manag 9(4):222–227

    Article  Google Scholar 

  • Sherali HD, Bae KH, Haouari M (2010) Integrated airline schedule design and fleet assignment: polyhedral analysis and benders decomposition approach. INFORMS J Comput 22(4):500–513

    Article  Google Scholar 

  • Tian W, Demeulemeester E (2013) On the interaction between roadrunner or railway scheduling and priority lists or resource flow networks. Flex Serv Manuf J 25:145–174

    Article  Google Scholar 

  • Vanhoucke M, Debels D (2007) The discrete time/cost trade-off problem under various assumptions exact and heuristic procedures. J Sched 10:311–326

    Article  Google Scholar 

  • Wȩglarz J, Józefowska J, Mika M, Waligóra G (2011) Project scheduling with finite or infinite number of activity processing modes: a survey. Eur J Oper Res 208(3):177–205

    Article  Google Scholar 

  • Xu J, Zheng H, Zeng Z, Wu S, Shen M (2012) Discrete time-cost-environment trade-off problem for large-scale construction systems with multiple modes under fuzzy uncertainty and its application to Jinping II hydroelectric project. Int J Proj Manag 30(8):950–966

    Article  Google Scholar 

  • Yamashita D, Armentano VA, Laguna M (2007) Robust optimization models for project scheduling with resource availability cost. J Sched 10:67–76

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Öncü Hazır .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hazır, Ö., Haouari, M., Erel, E. (2015). Robust Optimization for the Discrete Time-Cost Tradeoff Problem with Cost Uncertainty. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol. 2. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05915-0_9

Download citation

Publish with us

Policies and ethics