Summary Design Test Operations
Made by Lisa van der Feer in Year 2018-2019
, Critical Path Analysis
EST = Earliest start time
LST = Lastest start time
Float = The maximal time the activity can be delayed without changing the end time
Critical path = Everywhere the float is 0
Then you need something like the table on the left.
Look at the preconditions, if something else has to happen before something.
Then you can fill out these blocks to create the network
Step 1: Start with a start block (node)
Step 2: Put in the activity without preconditions (A, B & C in the example above). Also
add the duration
Step 3: Then put in the next blocks (nodes) behind it’s preconditions. If there are 2
preconditions, like K has in the example, just draw two lines.
Step 4: All ends of the network should end in the finish block.
Now your network looks like this.
Now you have to fill in the nodes (blocks).
Step 5: To find out the EST, add the duration of the previous node to the EST of the
previous node. If there are multiple, take the one that is the highest.
Step 6: To find out the LST, start at the finish. The LST for finish is the same as the EST.
Then simply take the LST of the previous node and subtract the duration of that
node and that is your LST. If there are multiple, take the lowest.
Step 7: The float is the difference between the EST and the LST
Step 8: The Critical Path is where the float is 0.
This is what it should look like
Made by Lisa van der Feer in Year 2018-2019
, Critical Path Analysis
EST = Earliest start time
LST = Lastest start time
Float = The maximal time the activity can be delayed without changing the end time
Critical path = Everywhere the float is 0
Then you need something like the table on the left.
Look at the preconditions, if something else has to happen before something.
Then you can fill out these blocks to create the network
Step 1: Start with a start block (node)
Step 2: Put in the activity without preconditions (A, B & C in the example above). Also
add the duration
Step 3: Then put in the next blocks (nodes) behind it’s preconditions. If there are 2
preconditions, like K has in the example, just draw two lines.
Step 4: All ends of the network should end in the finish block.
Now your network looks like this.
Now you have to fill in the nodes (blocks).
Step 5: To find out the EST, add the duration of the previous node to the EST of the
previous node. If there are multiple, take the one that is the highest.
Step 6: To find out the LST, start at the finish. The LST for finish is the same as the EST.
Then simply take the LST of the previous node and subtract the duration of that
node and that is your LST. If there are multiple, take the lowest.
Step 7: The float is the difference between the EST and the LST
Step 8: The Critical Path is where the float is 0.
This is what it should look like
