Research Article
Robust Proactive Project Scheduling Model for the Stochastic Discrete Time/Cost Trade-Off Problem
Table 1
Computations for the example problem.
| | Mode | Total cost | Makespan | Feasible | Activity 3 | Activity 4 |
| 0 | 1 | 1 | 86 | 7 | No | 1 | 2 | 77 | 9 | No | 2 | 1 | 74 | 13 | Yes | 2 | 2 | 65 | 13 | Yes |
| 1 | 1 | 1 | 86 | 7 | No | 1 | 1* | 89 | 7 | No | 1 | 2 | 77 | 9 | No | 1 | 2* | 80 | 10 | No | 1* | 1 | 90 | 9 | No | 1* | 1* | 93 | 9 | No | 1* | 2 | 81 | 9 | No | 1* | 2* | 84 | 10 | No | 2 | 1 | 74 | 13 | Yes | 2 | 1* | 77 | 13 | No | 2 | 2 | 65 | 13 | Yes | 2 | 2* | 68 | 13 | Yes | 2* | 1 | 78 | 15 | No | 2* | 1* | 81 | 15 | No | 2* | 2 | 69 | 15 | Yes | 2* | 2* | 72 | 15 | Yes |
| 2 | 1* | 1* | 93 | 9 | No | 1* | 2* | 84 | 10 | No | 2* | 1* | 81 | 15 | No | 2* | 2* | 72 | 15 | Yes |
|
|
This mode uses the worst-case value.
|