All right? If you run it, you have a sense of the upper bound, about how much time it's going to take to do this computation, so you're not going to get surprised by something showing up.
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.