Robust scheduling and robustness measures for the discrete time/cost trade-off problem

Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that are less vulnerable to disruptions caused by uncontrollable factors. In this...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2010-12, Vol.207 (2), p.633-643
Main Authors: Hazır, Öncü, Haouari, Mohamed, Erel, Erdal
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Computation
cost trade-off Robustness Simulation
Estimates
Exact sciences and technology
Operational research
Operational research and scientific management
Operational research. Management science
Optimization
Project management
Project scheduling
Project scheduling Time
Robustness
Schedules
Scheduling
Scheduling algorithms
Scheduling, sequencing
Simulation
Studies
Time/cost trade-off
Tradeoff analysis
Tradeoffs
Uncertainty
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that are less vulnerable to disruptions caused by uncontrollable factors. In this paper, we investigate the robust discrete time/cost trade-off problem, which is a multi-mode project scheduling problem with important practical relevance. We introduce surrogate measures that aim at providing an accurate estimate of the schedule robustness. The pertinence of each proposed measure is assessed through computational experiments. Using the insights revealed by the computational study, we propose a two-stage robust scheduling algorithm. Finally, we provide evidence that the proposed approach can be extended to solve a complex robust problem with tardiness penalties and earliness revenues.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2010.05.046