
Question 14 Assume that activity F has the following times: Early start time (ES) = 7...
Question 13 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) A 2 B 3 с 2 D A,B 5 E CD F D 4 G E 2 1 Determine the duration of the project. a. 13 weeks b. 12 weeks OC. 11 weeks d. 10 weeks e. 9 weeks Question 14 Assume that activity F has the following times: Early start time (ES) =...
21. Using the CPM method, calculate early start (ES), late start (LS), early finish (EF), late finish (LF) and total float (TF) for each activity in the following network and answer the questions 21-1. The ES of activity His: a) 18 b) 22C) 5 d) 2 21-2. The LF of activity B is: a) 20 b) 22c) 18d) 19 ) 13 d) 59 21-3. The TF of activity A is: a) 5 b ) 17 c) 18 21-4. The project...
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...
also needs daves latest start and latest finish:
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 e 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) C, E D, F Dave's earliest start (ES) and earliest finish (EF) are: Activity ES...
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...
4. A project manager calculated early and late start and finish times for all activities in her eight-activity project but spilled her energy drink on the paper and the acid in the beverage wiped out some of the table entries. The remaining legible entries are correct. Activity Predecessor Duration ES EF LS LF Slack A -- B A 12 12 C A 5 18 D B 8 E C 9 0 F D,E 27 34 0 G E 6 33...
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...
A construction company has a project proposal, which takes 10 activities as follows: Activity Predecessors Activity Duration Time (In DAYS ) Early Start (ES) (In DAYS ) Early Finish (EF) (In DAYS ) Late Start (LS) (In DAYS ) Late Finish (LF) (In DAYS ) SLACK (In DAYS ) A - 14 B - 13 C A 11 D A 15 E B 14 F B 11 G D, E 13 H F 15 J C 12 K G,H 11...
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...
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...