also needs daves latest start and latest finish:
Earliest Start (ES) = the earliest time when the activity can begin
Earliest Finish (EF) = ES + Activity Duration
Latest Finish (LF) = the latest time by when the activity can be finished without changing the project completion duration
Latest Start (LS) = LF - Activity Duration
Slack = LS-ES = LF-EF
To find LF, we start with LF for the activity which has the highest EF. LF for all independent activities is equal to highest EF.
Computing using the above gives us the below -
Time | Earliest | Earliest | Latest | Latest | |||
Activity | Predecessor | (Weeks) | Start Time | Finish Time | Start Time | Finish Time | Slack |
A | - | 6 | 0 | 6 | 4 | 10 | 4 |
B | - | 7 | 0 | 7 | 0 | 7 | 0 |
C | A | 2 | 6 | 8 | 10 | 12 | 4 |
D | A | 2 | 6 | 8 | 15 | 17 | 9 |
E | B | 5 | 7 | 12 | 7 | 12 | 0 |
F | B | 5 | 7 | 12 | 12 | 17 | 5 |
G | C, E | 11 | 12 | 23 | 12 | 23 | 0 |
H | D, F | 6 | 12 | 18 | 17 | 23 | 5 |
Hence, Dave's ES and EF are -
Earliest | Earliest | |
Activity | Start Time | Finish Time |
A | 0 | 6 |
B | 0 | 7 |
C | 6 | 8 |
D | 6 | 8 |
E | 7 | 12 |
F | 7 | 12 |
G | 12 | 23 |
H | 12 | 18 |
Dave's LS and LF are -
Latest | Latest | |
Activity | Start Time | Finish Time |
A | 4 | 10 |
B | 0 | 7 |
C | 10 | 12 |
D | 15 | 17 |
E | 7 | 12 |
F | 12 | 17 |
G | 12 | 23 |
H | 17 | 23 |
Slack Times are -
Activity | Slack |
A | 4 |
B | 0 |
C | 4 |
D | 9 |
E | 0 |
F | 5 |
G | 0 |
H | 5 |
To find the critical path, let us draw the network diagram -
Possible Network paths and their duration are -
ACG --> 6+2+11 = 19 weeks
ADH --> 6+2+6 = 14 weeks
BEG --> 7+5+11 = 23 weeks
BFH --> 7+5+6 = 18 weeks
Hence, critical path is B-E-G
Total project completion duration = duration of critical path = 23 weeks
also needs daves latest start and latest finish: Dave Fletcher was able to determine the activity...
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...
PLEASE SOLVE FOR ALL :) determine ES, EF, LS, LF, and slack for each Dave Fletcher was able to determine the activity times for constructing his laser scanning machine. Fletcher would like activity. The total project completion time and the critical path should also be determined. Here are the activity times: Activity Time (weeks) Immediate Predecessor(s) Activity Time (weeks) Immediate Predecessor(s) E 4 A R 6 5 C A G 10 C, E D 1 A H 6 D.F Dave's...
I need Activity A-H Myo 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 Immediate TimeImmediate Activity (weeks) Predecessorís) Activity (weeks) Predecessors) G 10 C, E D. F Dae'sarlest start (ES) and eariest fnish (EF) are
What is the critical path? Start-A-D-G-End O Start-A-D-F-End Start-A-E-G-End O Start-B-E-G-End What is the EF (earliest finish) of activity E? o o ООООО < N N What is the LS (latest start) of activity E? ООООО The list of activities, their times (in weeks), and precedence relationships for a new project are given below. Activity Immediate Predecessor Activity Time A L - L 4 B - 1 2 C - A, B F DL 4 G C, D, E What...
Problem 15-8 (Algo) Based on the precedence table below, identify the critical path, earliest start and finish, and slack for each task. Activity Duration (Days) Immediate Predecessor none none none KUHIGT mono 00 00 ONTHOOOO D, E G, J, K b. Identify the earliest start and finish, and slack for each task. (Leave no cells blank - be certain to enter "0" wherever required.) Task Earliest Start s+ Start (ES) Earliest Completion (EC) Immediate Predecessors None None None B C...
1. The activities needed for a new project your company is undertaking are listed in the following table. ACTIVITY IMMEDIATE PREDECESSOR(S) A ---- B ---- C A D A, B E B F C, D, E G D, E H F I F, G J G The activity times were determined for the project, and were as below. ACTIVITY ACTIVITY TIME (days) A 11 B 9 C 7 D 12 E 8 F 9 G 10 H 6 I 7...
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...
Problem 5: For the given activity network, if there are 35 days required to complete the project, find the following Complete the network by filling in ES, LS, EF and LF Earliest start for activities D, E, F, H, G, L, M ill. Earliest finish for activities D, E, F, H,G,L,M Latest start for activities D, E, F, H, G, LM V. Latest finish activities D, E, F.H.GLM vi. Slack/Float time for each activities D, E, F, H, G, LM...
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...
Using the information shown in the table below, what is the latest start time for activity E? ACTIVITY Immediate Predecessor ACTIVITY TIME EARLIEST START EARLIEST FINISH LATEST START LATEST FINISH SLACK A None 2 0 0 2 0 B A 1 2 3 3 4 1 C A 3 2 5 2 5 0 D B 7 3 10 4 11 E B, C 3 5 8 11 F C 5 11 5 11 0 G D ,E, F 4...