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

Randy, write in factor form 9x3+9x5

write in factor form 9x3+9x5

Exponential smoothing, Exponential smoothing It is a weighted moving a...

Exponential smoothing It is a weighted moving average technique, this is described by: New forecast = Old forecast + a (Latest Observation - Old forecast) Whereas a = Sm

Lines, Standard form of the line Let's begin this section off along a q...

Standard form of the line Let's begin this section off along a quick mathematical definition of a line. Any equation that can be written in the following form,

Find the shortest paths in the digraph, 1. a) Find the shortest paths from ...

1. a) Find the shortest paths from r to all other nodes in the digraph G=(V,E) shown below using the Bellman-Ford algorithm (as taught in class).  Please show your work, and draw t

Series, find the series of the first twenty terms

find the series of the first twenty terms

What is fibonacci sequence, what is Fibonacci Sequence? The most famous...

what is Fibonacci Sequence? The most famous sequence in mathematical history is called the Fibonacci sequence, discovered by the 12th-century mathematician Leonardo Fibonacci o

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd