Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming.threads > #3821

About PERT and Statistical PERT and Monte Carlo simulation

Show all headers | View raw

Hello......


About PERT and Statistical PERT and Monte Carlo simulation

Please read carefully the following method of statistical PERT:

https://www.statisticalpert.com/learn-more/

and read this also:

https://www.pluralsight.com/blog/it-ops/statistical-pert-estimates


This method is not efficient, because, first, it doesn't scale
as Monte Carlo simulation, because Monte Carlo simulation  will
tell you how much each activity will influence the critical path
before putting the Risk.. so statistical PERT is not scalable in this 
regard, because statistical PERT has to put the Risk before knowing how 
much each activity will influence the critical path..

So statistical PERT is not efficient as Monte Carlo simulation.

But Monte Carlo simulation can not know efficiently how much Risk
is on the very sensitive parts of activities, because it is difficult
to put a Risk on real world problems, so this is still inefficient. So 
this is why i think PERT is still useful as a tool.

So i think i will stay with my PERT library that is still useful.

Here it is:

PERT (The program evaluation and review technique) for Delphi and 
Freepascal was updated to version 1.21..

I have just taken a look at the following statistical PERT:

https://www.pluralsight.com/blog/it-ops/statistical-pert-estimates

And i think you don't need it, because i have just added the following 
function to my PERT library:

function InvNormalDist(const Mean, StdDev, PVal: Extended; const Less: 
Boolean): Extended;

For InvNormalDist(), you pass the best estimate of completion time to 
Mean, and you pass the critical path standard deviation to StdDev, and 
you will get the length of the critical path of the probability PVal, 
and when Less is TRUE, you will obtain a cumulative distribution.

Also my PERT library uses a CPM algorithm that uses Topological sorting 
to render CPM a linear-time algorithm for finding the critical path of 
the project, so it's fast.

And i have also included a 32 bit and 64 bit windows executables called 
PERT32.exe and PERT64.exe (that take the file, with a the file format 
that i specified above, as an argument) inside the zip, it is a very 
powerful tool, you need to compile CPM.java with compile.bat before 
running them.

Now my PERT library is more professional.

You can download the new version 1.21 of my PERT library from:

https://sites.google.com/site/aminer68/pert-the-program-evaluation-and-review-technique-for-delphi-and-freepascal


Thank you,
Amine Moulay Ramdane.

Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread

Thread

About PERT and Statistical PERT and Monte Carlo simulation rami18 <coco@coco.com> - 2017-07-04 14:32 -0400

csiph-web