Consider the following project scheduling network, which can be found
here .
In the table below, let pj be the processing time
associated with activity j and let cj be the cost of
reducing pj by one unit.
j | pj | cj
| 1 | 1 | 6 |
2 | 1 | 4 |
3 | 5 | 1 |
4 | 6 | 3 |
5 | 6 | 1 |
6 | 4 | 1 |
7 | 2 | 2 |
8 | 4 | 3 |
9 | 6 | 7 |
- List critical paths in the network.
- List 5 different minimal cut sets in the network.
- Suppose that you want to reduce the project length by 1 unit of
time while spending the smallest amount of money. What would you do,
and how much would it cost?
- List all critical paths with the new processing times.
- Suppose that you had $10 to spend on reducing the project and you
have the restrictions that no processing time can decrease by more than
2 units, and that no processing time can decrease below 1. What would
you do and what would the resulting schedule length be.