- #1
evinda
Gold Member
MHB
- 3,836
- 0
Hello! (Wave)
The nodes $A,B,C,D,E,F,G,H,I$ are given and are related as follows:View attachment 5084
The nodes $B,C,D,E,F,G,H,I$ are tasks that are done so that a work is completed , for example a building, and the cost $p(a,b)$ are the days that are needed so that the work $b$ finishes if the work $a$ has already finished.
For example, $p(A,B)=22$: 22 days are needed so that the work B is done.
$p(B,E)$: 16 days are needed so that the work E is done if the work B has finished.
Of course, some works can be done simultaneously.
Find the minimum time needed so that the building gets finished.How do we use the fact that some works can be done simultaneously?
The nodes $A,B,C,D,E,F,G,H,I$ are given and are related as follows:View attachment 5084
The nodes $B,C,D,E,F,G,H,I$ are tasks that are done so that a work is completed , for example a building, and the cost $p(a,b)$ are the days that are needed so that the work $b$ finishes if the work $a$ has already finished.
For example, $p(A,B)=22$: 22 days are needed so that the work B is done.
$p(B,E)$: 16 days are needed so that the work E is done if the work B has finished.
Of course, some works can be done simultaneously.
Find the minimum time needed so that the building gets finished.How do we use the fact that some works can be done simultaneously?