|
ACTIVITY |
DURATION |
ES |
EF |
LS |
LF |
SLACK |
CRITICAL |
|
A |
5 |
0 |
5 |
0 |
5 |
0 |
YES |
|
B |
8 |
5 |
13 |
5 |
13 |
0 |
YES |
|
C |
7 |
5 |
12 |
6 |
13 |
1 |
|
|
D |
6 |
0 |
6 |
7 |
13 |
7 |
|
|
E |
8 |
13 |
21 |
13 |
21 |
0 |
YES |
|
F |
3 |
6 |
9 |
18 |
21 |
12 |
|
|
G |
3 |
6 |
9 |
18 |
21 |
12 |
FORWARD PASS
We calculate the ES and EF values using a forward pass where the ES of an activity is the maximum EF of all the predecessor activities.
BACKWARD PASS
We calculate the LS and LF values using a backward pass where the LF of the activity is the minimum of all the successor activities.
SLACK
Slack is the value which is determined by subtracting EF from the LF or ES from the LS.
CRITICAL PATH
Critical path is the chain in the project network where the slack value of all the activities is 0, what this means is that any delay in these activities would result in delaying the entire project.
CRITICAL PATH = A-B-E
DURATION OF PROJECT = 21

3. (20 points) A landscaping upgrade project consists of following activities. Times are given in weeks....
A network consists of the following list. Times are given in weeks. Activity Preceding Time (weeks) Activity Predecessor Duration A 4 B 9 C A 5 D B A 3 E D C 4 Calculate the ES, EF, LS, LF, slack for each activity. List the critical activities for this project.
A Question 11 The following table provides a list of activities in a project, along with their respective durations and precedence requirements: Immediate Duration Activity Predecessor(s) (weeks) 2 B 3 C B D А E A.C 1 F DE 3 с 3 2 6 G Determine the amount of slack time for Activity E: a. O weeks b. 1 week C. 2 weeks O d. 3 weeks Question 12 Assume that activity A has the following times: Early start time...
: A network consists of the following list. Times are given in weeks. Activity Preceding Duration A -- 9 B A 2 C A 12 D A 5 E B 6 F B 8 G C, F 3 H D 2 I H 8 J G, I 6 K E, J 2 Draw the network diagram. Find ES, EF, LS, LF, and the slack times for each of the activities. Which activities are critical? Determine the critical path(s). What is...
Dave Fletcher was able to determine the activity times for constructing his laser scanning machine. Fletcher would like to determine ES, EF, LS, LF, and slack for each activity. The total project completion time and the critical path should also be determined. Here are the activity times: Time Activity (weeks) А 7 Immediate Predecessor(s) Time Activity (weeks) E 3 F 7 G 11 H 8 Immediate Predecessor(s) B B CE D. B с D 2 3 A A Dave's earliest...
Consider the following project where times are in weeks. Activity Duration Immediate Predecessors A B с D E F G H A.B B A с E,F 8 12 7 4 2 3 7 3 DF a) Determine the activity schedule (ES, EF, LS, and LF) as well as slack using the information from the table above (11 marks) b) Determine all the possible paths of this project and determine the shortest possible time this project can be completed? (4 marks)...
The ABC Manufacturing Co. has made a decision to replace an existing production line with new equipment. This project will require several tasks (jobs) with precedence relationships and duration (days) as shown in the following table. The project will be finished when activities A-J are all finished. Activity predecessor Optimistic Most likely Pessimistic Expected A - 4 5 12 B A 3 4.5 15 C A 2 3 4 D C 6 8 22 E B 4 6 8 F...
Consider the following project activities:
Calculate the expected time (te) for each
activity.
Draw an Activity on Node (AON) diagram to reflect the flow of
these activities.
Calculate the Early Start (ES), Early Finish (EF), Late Start
(LS), and Late Finish (LF) for each activity.
Calculate the slack for each activity.
Identify all activities on the Critical Path.
Use the data to calculate the probability the project will
finish in 20 weeks (Hint: z-score).
Activity A 8 с D E...
Question 24 (20 points) Use the following table of related activities with their activity times (weeks). Q24-1) Type your answers by the order of ES, EL, LS, LF, Slack for each activity. For example, A. Х, Х, Х, Х, Х Q24-2) Determine the critical path. Immediate Activity Activity Predecessor Time ESEFLSLqslack (weeks 4 C A DIB E A FIB G C,D H |D,F 7 6 5 4 6 G, H, I J
Question 24 (20 points) Use the following table...
A small software development project has eight major activities. The times are estimated and provided in the table below: Activity Optimistic Time Most Likely Time Pessimistic Time Immediate Predecessor(s) A 3 4 5 -- B 5 7 9 -- C 2 3 10 A D 2 5 8 B E 1 7 7 B F 3 5 7 C, D G 7 8 9 D, E H 2 6 10 F Answer the following questions based on above table 1-2...
Consider a project having the following six activities: Immediate Max Crash cost Activity Predecessors Time (weeks) Crash* per week A none 6 6 N/A B none 5 2 $500 C A 3 2 $1000 D A, B 4 2 $2000 E C, D 5 2 $1250 F D 6 2 $1000 *Shortest possible time for the task 1. Draw the project network and list...