c. (5 points) If time is measured in days, what is the minimum number of days the project can be completed?
Activity | Predecessor | Duration | ES | EF | LS | LF | Slack | ||||
A | - | 9 | 0 | 9 | -3 | 6 | -3 | ||||
B | - | 6 | 0 | 6 | 2 | 8 | 2 | ||||
C | A | 10 | 9 | 19 | 6 | 16 | -3 | ||||
D | B | 4 | 6 | 10 | 12 | 16 | 6 | ||||
E | B | 8 | 6 | 14 | 8 | 16 | 2 | ||||
F | A | 7 | 9 | 16 | 28 | 35 | 19 | ||||
G | C,D | 8 | 19 | 27 | 16 | 24 | -3 | ||||
H | B | 5 | 6 | 11 | 25 | 30 | 19 | ||||
I | E | 13 | 14 | 27 | 16 | 29 | 2 | ||||
J | F | 4 | 16 | 20 | 35 | 39 | 19 | ||||
K | G | 15 | 27 | 42 | 24 | 39 | -3 | ||||
L | H | 9 | 11 | 20 | 30 | 39 | 19 | ||||
M | I | 10 | 27 | 37 | 29 | 39 | 2 | ||||
N | J,K,L,M | 4 | 42 | 46 | 42 | 46 | 0 | ||||
O | J,K,L,M | 10 | 42 | 52 | 39 | 49 | -3 | ||||
P | N | 3 | 46 | 49 | 46 | 49 | 0 | ||||
Critical Path=A-C-G-K-N-O-P | |||||||||||
FIVE ACTIVITIES HAVE NEGATIVE SLACK INDICATING THE ACTIVITIES ARE EXTREMELY CRITICAL AND NEED TO BE BROUGHT | |||||||||||
UNDER CONTROL TO SAVE THE TIME TO COMPLETE THE JOB ON SCHEDULE. | |||||||||||
THIS IS DUE TO ACTIVITIES HAVING MULTIPLE PREDECESSORS AND MAY REQUIRE RESCHEDULING TO SUCCESSFULLY COMPLETE JOB ON SCHEDULE | |||||||||||
The minimum number of days=49+3+3+3+3+3=64 days to complete as the activities with the negative slack will increase the time by 3 days each | |||||||||||
c. (5 points) If time is measured in days, what is the minimum number of days...
You must save 3 days on this project. How can you do so most efficiently? Fill in the AoA network with the new information in order to save day 1, day 2 and day 3 GIJ 4. Use the following table to complete the rest of the tasks: o) Vack Time Cost 0 Cost Activity Predecessors Normal CrashNormal Crash A,C 10 12 D,E D,E D,E G H 12 a. Draw the AoA network and identify the critical path (the drawing...
activity immediate processor activity time (days) A - 6 B - 8 C A,B 5 D B 4 E C 7 F C,D 3 G D 6 H E,F,G 5 Given the following information for a project. SHOW ALL WORK. a) Draw the AON(Activity-On-Node) project network b) Write the estimated slack times for activities A-H c) Identify the critical path d) Determine the total completion time of the project.
(3) Determine the critical path and critical time of the network shown below. Use the critical path method (the table of ES, EF, etc.). (3) Determine the critical path and critical time of the network shown below. Use the critical path method (the table of ES, EF, etc.). po Problem . Example a 100 For all starting activities, ES is taken as 0. Activities 1-2, 1-3 gets ES of O. Find EF-ES +time. Activity Time ES E F LS L...
PART I: PERT Consider the following table: ACTIVITY PREC. ACT. TIME ESTIMATES (days) to tml tp te A --- 2 3 4 B A 2 4 6 C A 4 6 8 D A 4 5 6 E B 6 7 8 F D 1 3 5 G E, C, F 3 5 7 1. Construct a PERT network. (20 points) [NOTE: This...
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...
DSIM 350: Managing Product and Service Operations Final Exam - Total Points (100) Problem 2: Ch 9 Project Management (50 Points) Following table gives the details about all tasks needed to be completed for a pro their respective predecessors and task times (weeks). ject along with 1. Activity Activity predecessor Time (Weeks) b, c 7 6 4 a. Draw the network diagram b. Calculate ES-EF-LF-LS times and determine the slack for each activity. Show all calculations on the diagram. Establish...
question 3.12 Chapter 3 Project Management 91 Table for 3.8 Time Activity Immediate Code Description in hours) Predecesur Planning Find location determine resource requirements Purchasing Requisition of lumber and sand Excavation Planning Dig and grade Sawing Planning Saw lumber inte appropriate sizes Placement Purchasing Position lumber in comect locations Sawing. c om Assembly Nail lamber together Placement Tafill Put sand in and under the equipment Ambly Outfill Put dirt a nd the equipment Assembly Decoration Put grass all over the...
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...
(15 points) Activity Immediate Predecessor Optimistic Time Most likely Time Pessimistic Time A NONE 4 7 9 B A 2 4 6 C A 6 9 9 D B, C 5 5 5 E C 2 5 9 F D, E 3 3 6 Use both the longest path method and ES/EF; LS/LF method for the following questions (e) What are the slack values for non-critical activities? (4 points) (f) What is the probability that the project will be...
NETWORK: PERT 4 - Consider the following table: ACTIVITY PREC. ACT. TIME ESTIMATES tml - 2 (days) tp c D, E 1) Construct a PERT network. [NOTE: This is the most crucial part of the exercise. Make sure you have the correct network before proceeding to the next sections.) 2) By using ES, EF, LF, LS, find the slack of each activity and the critical path. 3) Find the completion time (x) and the standard deviation (6) for the project-...