Estimate the probability - noncritical path , Mathematics

Assignment Help:

An advertising project manager developed the network diagram shown below for a new advertising campagign. In addition, the manager gathered the time information for each activity, as shown in the below table.

Estimate the probability that the noncritical path B-F-G will take more than 20 weeks. Hint: Subtract from 1.0 the probability that B-F-G will take less than 20 weeks.

Activity Optimistic Most likely Pessimistic Immediate Predecessor(s)

A 1 4 7 -

B 2 6 7 -

C 3 3 6 B

D 6 13 14 A

E 3 6 12 A,C

F 6 8 16 B

G 1 5 6 E,F

Related Discussions:- Estimate the probability - noncritical path

Two circles touching internally prove that ox:oy=oa:ob, Two circles touchin...

Two circles touching internally at O. OXY, OAB straight lines, the latter passing through the centres. Prove that OX : OY = OA : OB. Given : Two circles touching internally a

Binomial theorem, 1/(1-z)(1-z)(1-z)(1-z)

1/(1-z)(1-z)(1-z)(1-z)

Control a liner interpolation between original mesh, Use your keyboard to c...

Use your keyboard to control a linear interpolation between the original mesh and its planar target shape a. Each vertex vi has its original 3D coordinates pi and 2D coordinates

Subtract, Ask question Minimum 100 words accepted# 1000-101

Ask question Minimum 100 words accepted# 1000-101

Patrice has worked a certain how many hours has she worked, Patrice has wor...

Patrice has worked a certain amount of hours so far this week. Tomorrow she will work four more hours to finish out the week along with a total of 10 hours. How many hours has she

Fracrions, how do u do fractions on a nummber line

how do u do fractions on a nummber line

Find the distance of the journey, A train covered a certain distance at a u...

A train covered a certain distance at a uniform speed. If the train would have been 6km/hr faster, it would have taken 4hours less than the scheduled time. And if the train were

Prove that a simple graph is connected, Prove that a simple graph is connec...

Prove that a simple graph is connected if and only if it has a spanning tree. Ans: First assume that a simple graph G has a spanning tree T. T consists of every node of G.

Unitarymethod, who discovered and when

who discovered and when

Determine fog and gof, Let g be a function from the set G = {1,2,3,...34,35...

Let g be a function from the set G = {1,2,3,...34,35,36). Let f be a function from the set F = {1,2,3,...34,35,36}. Set G and F contain 36 identical elements (a - z and 0 - 9).

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages