Abstract
We consider the problem of allocating resources to projects performed under given due dates and stochastic time-cost tradeoff settings. In particular, we show how to implement a state-of-the-art methodology known as "robust optimization" to solve the problem. In contrast to conventional approaches, the model we develop results in management policies rather than optimal values for the original decision variables. Hence, the project manager can postpone decisions to the point of time when they are actually required and then make them according to the optimal policy (which employs cumulative data on the project progress). The solutions are guaranteed to be robust-that is, ensuring feasibility except when the uncertain parameters assume extreme values. Still, as we demonstrate through an extensive numerical example, the price we need to pay to obtain that robustness is relatively small even for high uncertainty levels.
Original language | English |
---|---|
Pages (from-to) | 175-188 |
Number of pages | 14 |
Journal | Networks |
Volume | 49 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2007 |
Keywords
- Linear programming
- Project management
- Robust optimization
- Time-cost tradeoff
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications