End

Figure 8-8: Sample of network construction.

Figure 8-9: Networking concurrent activities.

Figure 8-9: Networking concurrent activities.

Figure 8-10: Activity c not required fore.
Figure 8-11: a precedes d; a and precede e; b and c precede f (a doe not precede f).

time is expected rarely to be less than the optimistic time or more than the pes simistic time. (More on this matter shortly.)

As described earlier, we start the network by finding those activities that hav no predecessors. In the table activities a, b, and c meet the test. Therefore, they ca all be drawn emerging from our starting node.

Next, we look for activities that only require a, b, or c, or some combination a, b, and c, to precede them. Activity d requires that a be completed, and e, f, an g all require that b and c be completed. Note that a dummy will be necessary u less we begin the network from separate nodes for b and c. Last, h requires that c be completed. To this point, the network might look like Figure 8-12.

liable 8-1 Project Activity Times and Precedences

Activity

Optimistic Time

Most Likely Time

Pessimistic Time

Immediate Predecesso Activities

Immediate Predecesso Activities

Was this article helpful?

0 0
Stocks and Shares Retirement Rescue

Stocks and Shares Retirement Rescue

Get All The Support And Guidance You Need To Be A Success At Investing In Stocks And Shares. This Book Is One Of The Most Valuable Resources In The World When It Comes To

Get My Free Ebook


Post a comment