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

Creative Commons License

Hazir O., Haouari M., EREL E.

HANDBOOK ON PROJECT MANAGEMENT AND SCHEDULING, VOL 2, pp.865-874, 2015 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Publication Date: 2015
  • Doi Number: 10.1007/978-3-319-05915-0_9
  • Journal Name: HANDBOOK ON PROJECT MANAGEMENT AND SCHEDULING, VOL 2
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED)
  • Page Numbers: pp.865-874
  • Keywords: Project management, Robust optimization, Scheduling, Uncertain cost, OFF PROBLEM, BENDERS DECOMPOSITION, PROJECT NETWORKS, MIN-MAX, ALGORITHM, ENVIRONMENT, MODELS, FLOWS
  • TED University Affiliated: Yes

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.