lecture21 Flashcards
What we are after this lecture is when do we leave home and when to arrive to campus
We follow early path (early rising people)
Or
we follow just on time
We call those early start for the activity (earliest it can start earliest it can finish)
or
late finish activity
What drive late finsih is the successor.
For example what drives your walking to the campus to reach class, is the time of class.TO be just on time on class u just see when class will starts and u finish walking at just when class start so u will be there at time
SO ur current activity will finish just when ur next successor will start
Also if we take the project example, like the project takes 8 hours and u need to deliver at 8 am, so u start working on it at 12 am so u will be just on time
on the other hand early path , u start working on it before a day and get it done before and relax
The early path method have a leeway (float ) , meaning if i face something I will still have time to solve it
TRUE
What determines the early starts is finishing the predecssors (the prerequisetes) and the duration of the activity itself
true
What on the other hand determines late finish is when ur next successor will start
Consider the example in the slides ( you have eleven activities)
Activity K has 2 predessecors ( B and F)
Activity H and G have ( E and B)
The dotted lines just serve to show dependencies (What is the prerequisite of what)
How do we determine a schedule for this project
1st point;
We set a starting point ( you can start with day zero or day one , it will not matter; but u need to remember what day u started with so u wont mix)
Let us u started working in the morning of day one
What are the starting activities
A, B , and C (they dont have prerequisites)
What is the soonest activity A can finish
Morning of day 4 (night day of 3)
B finishes morning of day 3
true
C fiinishes morning of day 2
True
To do the schedule agree on starting point (Day 0 or Day 1)
Second we ddo forward path (u start from the starting point and u walk through the network)
Now we reached D;
D needs 4 days ;
When is it the soonest D can start ( D can start as soon as A finishes) So if A finishes at 4th day morning and D star ts, D will finish at morning of Day 8.
Same for E , starts when A is done
Similarly C and F
true
What about K
K can starts as soon as both B and F are done, which is the duration of the largest of them
The formula of the forward path for early start for an activitiy is
the early start of an activity is the maximum early finish of all of the predesscessor like in K above
Early finish=early start plus duration
true
For G 13
For H 11
true
For M 15
true
This is called forward path method
true
U can deduce project duration
14 days (U will finish at 15 but it take 14 days)
Second thing u can infer
U can infer the critical path which will drive the schedule
M, G , E , A
To get it exact u need to do the backword path
The forward path method is early start early finish
true
The backward path
We start from day finish and we walk backward
In backward path method
u say I took the forward path method and It took 14 days (finish at morning of day 15)
Morning of day 15 is soonest when I can finsih the project .
If he say 20 days in the given then u will start from day 20; else u use the forward path method to find the finishing day
Now u walk back from day finish
Equation that governs , minimum U start ending activities at 15 (anyone that doesnot have a successorL, K and M) M 15-2=13 K 15-3 =12 H Minimum of 13 and 14; 13-3=10 D has one successor L 14-4=10 We backword