Construction methods Do 4-3 5. Answer the following two questions, 5-1 and S-2 5-1) Draw the...
3 & 15. For the following schedule, draw the node network, perform the CPM calculations, mark the critical path, and complete the table. Repeat exercise 3 with an imposed finish date of 15 and then 20 days. Activity Duration IPA ES EF LS LF TF FF A 2 - B 4 A C 6 A D 9 A E 5 B F 7 B, C G 3 D, E, F
5 & 17. For the following schedule, draw the node network, perform the CPM calculations, mark the critical path, and complete the table. Repeat exercise 5 with an imposed finish date of 26 and then 35 days. Activity Duration IPA ES EF LS LF TF FF A 6 - B 2 - C 9 - D 4 A, B E 7 B F 5 D G 10 D, E H 8 C, F, G I 3 C, G J 2...
3. For the following schedule, draw the node network, perform the CPM calcula tions, mark the critical path, and complete the table TF FE LS LF ES IPA Duration Activity 2 A - A 4 A 6 C A 5 F B, C D, E, F 7 F 3 G
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...
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...
(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...
Consider a project having the following six activities: Immediate Max Crash cost Activity Predecessors Time (weeks) Crash* per week A none 7 7 N/A B none 3 2 $500 C A 5 3 $1000 D A, B 6 4 $2000 E C, D 4 3 $1250 F D 3 2 $1000 *Shortest possible time for the task 1. Draw the project network and list...
CPM -5% A Subcontractor must do the following: a) Framing (5 days) b) Drywall Installation (4 days) c) Drywall finish and paint (3 days) Assuming he wants to make sure each activity finishes at least 1 day after its predecessor has finished, draw these three activities in a precedence diagram (logic network) and calculate how much time the subcontractor would need to finish all three activities Scheduling Basics-Copyright 2013 Bill Morales
1. Consider the following project. Activity Duration (weeks)5 Immediate Predecessor(s) Cost (S) 1000 | 400 I 200 | 1200 | 500 | 700 | 1200 | 800 | 1800 | 1500 | 400 (a) Construct the activity-on-node (AoN) network for the relations among the activities in the (b) Using the activity-on-node (Ao) network developed in part (a), determine the critical path and the minimum time required to complete the project. Develop the earliest start and finish times, the latest finish...
Using the following information about Project A, its activities and predecessor activities below: Activity Predecessors A в B C D E, F D G The following table contains the pessimistic, likely, and optimistic estimates for how long activities are estimated to take for Project A. Activity Pessimistic Likely Optimistic 2 5 20 H 16 e. Calculate the time estimates (TE) f. Calculate the variance (s) g. Convert the TE to whole integers and place them in the network diagram for...