3. Compute the early, late, and slack times for the activities in the network th
ID: 443080 • Letter: 3
Question
3. Compute the early, late, and slack times for the activities in the network that
follows, assuming a time-constrained network. Which activities are critical?
What is the time-constrained project duration?
Note: Recall, in the schedule resource load chart the time-constrained scheduling
interval (ES through LF) has been shaded. Any resource scheduled beyond
the shaded area will delay the project.
Assume you have only three resources and you are using a computer that
uses software that schedules projects by the parallel method and following heuristics.
Schedule only one period at a time!
Minimum slack
Smallest duration
Lowest identification number
Keep a log of each activity change and update you make each period—e.g.,
period 0–1, 1–2, 2–3, etc. (Use a format similar to the one on page 261.) The log
should include any changes or updates in ES and slack times each period,
activities scheduled, and activities delayed. (Hint: Remember to maintain the
technical dependencies of the network.) Use the resource load chart to assist
you in scheduling (see pages 262–263—Figures 8.4 and 8.5).
List the order in which you scheduled the activities of the project. Which
activities of your schedule are now critical?
Recompute your slack for each activity given your new schedule. What is the
slack for activity 1? 4? 5?
Explanation / Answer
1) Early Start = ES+ t
=0+2
=2
2)1+1 = 2
3)2+1=3
4)0+1=1
5)1+2=3
6)1+2=3
LF = LF - t
LF= Latest Finish time
1)2-1=1
2)2-1=1
3)0-1=-1
4)2-1=1
5)2-2=0
6)0-2=-2
_______________________________________________________________________________________
Slack = LF - EF
1) 1 - 2
=-1
2)1-2=-1
3)-1 - (-1)=+2
4) 1+1 =2
5)0+3=3
6) -2 +3= - 1
______________________________________________________________________________________
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.