Scheduling Problem

Schedule Question Explained
By guts @ aiqus
Wednesday, November 30, 11
ES
LS
ES
LS
ES
LS
30
ES LS
30
10
ES LS
ES
LS
ES
LS
ES
LS
60
15
10
We will start from nding out what are the Early Start Time (ES) of each state
ES
LS
ES
LS
ES
LS
30
ES LS
30
10
ES LS
ES
LS
ES
LS
ES
LS
60
15
10
First, we know that ES(s) = 0, so the start is easy
ES
LS
ES
LS
ES
LS
30
ES LS
30
10
ES LS
ES
LS
ES
LS
ES
LS
60
15
10
Next, we will continue with the selected state, using the following formula
ES
LS
ES
LS
ES
LS
30
ES LS
30
10
ES LS
ES
LS
ES
LS
ES
LS
60
15
10
This mean, we take a look at the ES of the state A, and add it by the duration of the state A. State A must be the one that come before state B
ES
LS
ES
LS
ES
LS
30
ES LS
30
10
ES LS
ES
LS
ES
LS
ES
LS
60
15
10
The maximum means that if there are many states that come before B, nd the sum of each one, and choose the maximum one
ES
LS
ES
LS
ES
LS
30
ES LS
B
LS ES
30
10
ES LS
ES
LS
ES
LS
A
60 15 10
In this case, we only have one state A, that is the start state
ES
LS
ES
LS
ES
LS
30
ES LS
B
LS ES
30
10
ES LS
ES
LS
ES
LS
A
60 15 10
Hence the result becomes ES(B) = ES(A) + Duration(A) ES(B) = 0 + 0
ES
LS
ES
LS
ES
LS
30
ES LS
A
LS ES
30
B
LS ES
10
ES LS
ES
LS
60
15
10
Once we nished, we now move on the next state, now this new state will be our new B
ES
LS
ES
LS
ES
LS
30
30
ES LS
A
LS ES
30
B
LS ES
10
ES LS
ES
LS
60
15
10
Hence the result becomes ES(B) = ES(A) + Duration(A) ES(B) = 0 + 30 = 30
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
A
LS ES
10
B
LS
ES
LS
ES
LS
ES
60
15
10
And then we repeat the same process... ES(B) = ES(A) + Duration(A) ES(B) = 30 + 30 = 60
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A
ES LS ES LS ES LS
ES
LS
B
60 15 10
But now that we reach the nal state, we cannot nd its ES yet. This is because there are two states that come before the nal state.
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
ES LS
ES
LS
ES
LS
ES
LS
A
60 15 10
B So we will go back to the beginning, and take the other path.
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
ES LS
S
0
ES
LS
ES
LS
ES
LS
60
60
15
10
From there, we can repeat the process that we did before in the upper path
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
ES LS
S
0
ES
LS
ES
LS
ES
LS
60
75
60
15
10
I will not go into the calculation here. Please try it yourself and see if you understand!
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A1
LS
ES
LS
S
0
ES
LS
ES
LS
ES
60
75
B
10
60
15
A2 Now we reach the nal state, but this time we have all the information we need to nd the ES of the nal state
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A1
LS
ES
LS
S
0
ES
LS
ES
LS
ES
60
75
B
10
60
15
A2 Since we have two states before the nal state, we need to calculate both of them 1.) A1 -> ES(A1) + Duration(A1) = 60 + 10 = 70 2.) A2 -> ES(A2) + Duration(A2) = 75 + 10 = 85
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A1
85
LS
ES
LS
S
0
ES
LS
ES
LS
ES
60
75
B
10
60
15
A2
1.) A1 -> ES(A1) + Duration(A1) = 60 + 10 = 70 2.) A2 -> ES(A2) + Duration(A2) = 75 + 10 = 85 Then, we take the maximum value of the two, which is 85. So, ES(B) = ES(A2) + Duration(A2) = 75 + 10 = 85
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A1
85
LS
ES
LS
85
S
0
ES
LS
ES
LS
ES
60
75
B
10
60
15
A2 And since ES(F) = LS(F), we can work out the LS of the nal state
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
ES LS
85
85
S
0
ES
LS
ES
LS
ES
LS
60
75
60
15
10
From this point on, we are going to work backward to nd Late Start Time(LS) of each state
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A
ES LS ES LS ES LS
ES
LS
85
85
S
0
60
75
B
10
60
15
The state that we wish to nd its LS will be called A, the state that come right after will be called B.
ES
LS
ES
LS
ES
LS
30
60
30
ES LS
30
10
A
ES LS ES LS ES LS
ES
LS
85
85
S
0
60
75
B
10
60
15
This means, we take the LS of state B and subtract it by the duration of state A. The min means if there are many B states, then we choose the one that the result is the lowest value
ES
LS
ES
LS
ES
LS
30
60
75
30
ES LS
30
10
A
ES LS ES LS ES LS
ES
LS
85
85
S
0
60
75
B
10
60
15
So, our LS(A) would be... LS(A) = LS(B) - Duration(A) = 85 - 10 = 75

ES
LS
ES
LS
ES
LS
30
45
60
75
30
ES LS
30
10
A
ES LS ES LS ES LS
B
75
ES
LS
85
85
S
0
60
60
15
10
Then we move on to the next state, and repeat LS(A) = LS(B) - Duration(A) = 75 - 30 = 45
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
30
10
A
ES LS ES LS
B
ES LS
ES
LS
85
85
S
0
60
75
60
15
10
Then we move on to the next state, and repeat LS(A) = LS(B) - Duration(A) = 45 - 30 = 15
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
B1
LS ES
30
10
ES LS
85
85
ES
LS
ES
LS
60
75
60
B2 Similar to nding the ES of the nal state, the LS of the start state required that we have to know LS of all the states that come after it. Time to go back and take another path from the nal state.
15
10
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
30
10
ES LS
85
85
S
0
ES
LS
ES
LS
ES
LS
F
75
60
75
60
15
10
Again, I will not go into details here...
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
30
10
ES LS
85
85
S
0
ES
LS
ES
LS
ES
LS
F
75
60
60
75
60
15
10
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
30
10
ES LS
85
85
S
0
ES
LS
ES
LS
ES
LS
F
75
60
60
75
60
15
10
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
B1
LS ES
30
10
ES LS
85
85
ES
LS
ES
LS
F
75
60
60
75
60
15
10
B2 And now we are back to the start state with enough information this time.
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
B1
LS ES
30
10
ES LS
85
85
ES
LS
ES
LS
F
75
60
60
75
60
15
10
B2 Similar to what we did to the nal state, we need to nd the minimum value between the one we got from B1 and B2
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
B1
LS ES
30
10
ES LS
85
ES LS ES LS
85
F
75
60
60
75
60
15
10
B2 B1 -> LS(B1) - Duration(A) = 15 - 0 = 15 B2 -> LS(B2) - Duration(A) = 0 - 0 = 0 Apparently, the minimum value is 0. So the LS(S) will be 0
ES
LS
ES
LS
ES
LS
15
30
45
60
75
30
ES LS
30
10
ES LS
85
ES LS ES LS ES LS
85
S
0
F
75
60
60
75
60
15
10
And with this, we have completed the ES and LS of all the states.

Scheduling Problem

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Scheduling Problem

Uploaded by

Copyright:

Available Formats

Schedule Question Explained

Wednesday, November 30, 11

First, we know that ES(s) = 0, so the start is easy

Wednesday, November 30, 11

Wednesday, November 30, 11

Hence the result becomes ES(B) = ES(A) + Duration(A) ES(B) = 0 + 0

Wednesday, November 30, 11

Wednesday, November 30, 11

Hence the result becomes ES(B) = ES(A) + Duration(A) ES(B) = 0 + 30 = 30

Wednesday, November 30, 11

Wednesday, November 30, 11

B So we will go back to the beginning, and take the other path.

Wednesday, November 30, 11

Wednesday, November 30, 11

Wednesday, November 30, 11

Wednesday, November 30, 11

Wednesday, November 30, 11

Wednesday, November 30, 11

So, our LS(A) would be... LS(A) = LS(B) - Duration(A) = 85 - 10 = 75

Wednesday, November 30, 11

Again, I will not go into details here...

Wednesday, November 30, 11

Again, I will not go into details here...

Wednesday, November 30, 11

Again, I will not go into details here...

Wednesday, November 30, 11

Wednesday, November 30, 11

Wednesday, November 30, 11

You might also like