ESD = Earliest Start Date
EFD = Earlies Finish Date
LSD = Latest Start Date
LFD = Latest Finish Date
Critical path is the path of activities having maximum duration
ESD = LSD of previous activity (Note; If there is more than one predecessors, take the highest value of LSD)
:LSD = ESD + Duration
LFD = EFD of succeeding activity (Note; If there is more than one predecessors, take the lowest value of EFD)
EFD = LFD - Duration
TF = (LFD - EFD) or (EFD - ESD)
Sample calculation
Activity E
ESD = LSD of previous activity
= 11
:LSD = ESD + Duration
= 11 + 1 = 12
LFD = EFD of succeeding activity
= 15
EFD = LFD - Duration
= 15 - 1 = 14
TF = (LFD - EFD) or (EFD - ESD)
= (15 - 12) or (14 - 11)
= 3
----------------------------------------------------------------------------------------------------------------------------------------------------------
Critical Path is the path of activities having Total float equal to 0
From the above network diagram, we can conclude that A-C-F-H is the critical path
Therefore option C is the correct answer
---------------------------------------------------------------------------------------------------------------------------------------------------------
Using the precedence table given, draw an activity-on-node diagram network and determine the ESD EFD. LSDLFD,...
Draw the bar chart, and Precedence Diagram for the given project and highlight the critical path. Determine the project total duration, ES, EF, LS, LF, and TF for each given activity. + Activity Description Duration Predecessor A Move in 2 B Set up Scaffolds 3 A C Tear off Shingles 3 B ID Inspect Roof Truss & Deck 2 C E Remove Old Shingles 3 C IF Purchase New Shingles G G Install New Shingles 15 C,D H 3 G...
Consider the following table: Activity Initial Node Final Node Estimated Duration A 1 1 a. Draw an AOA network diagram for the above activity list for a project. b. What is the critical path for this project? c. What is the shortest possible time it will take to complete this project? d. What are the total slacks and free slacks for activity F and activity G?
PROBLEM 3: ACTIVITY-ON-THE-NODE PROBLEM FOR PRECEDENCE DIAGRAM. Figure A-3 shows an activity on the node of the precedence diagram in which the activity durations are shown below the activity numbers in the nodes. The upper numbers represent the activities. Solve for T, T, critical path, TE, FF, INTF and INDF (60 Points) 15 17 14 13 18 12 16 10 FIGURE A-3 TF Total Float FF Free Float INTF #TF-FF INDF Min. EST,-Max. LFTN- Note: Numbers below in the nodes...
9. Given the following information in the table, construct an activity on the node diagram. Label the critical path as well as the early and late start/finish times and the slack for each activity. (20 points) Predecessor Duration (Days) Activity A, B C, D F,G 9. Given the following information in the table, construct an activity on the node diagram. Label the critical path as well as the early and late start/finish times and the slack for each activity. (20...
Activity Duration Precedence Problem# 3 For the project information given below (wecks) information a) Draw the network diagram to accurately B must be after C represent the information given C must be after A 10 15 b) Determine the earliest start, earliest D must be after B E must be after C F must be after D and E G must be after F H must be after G 1 must be after F finished, latest start, latest finish for...
NETWORK SCHEDULING Using the PDM, draw the network diagram, identify the critical path and calculate the total project duration. Feel free to verify your answer using MS Project or a similar tool. Activity Dependency Activity Duration (weeks) A B None None AB B F G H 8 9 DE F, G, HI 7 8 5 Draw the Network Diagram using the convention discussed in the class. (If challenged with drawing tools, you can hand draw, take a picture, and paste...
Given the information in the following table: Activity Duration Predecessor A 4 None B 6 A C 4 A D 2 C E 4 B F 5 B, D G 3 C H 4 F, G I 2 E, H Construct the (AON) Activity on Node network diagram Find each activity’s ES, EF, LS and LS Identify all paths. Which path is the critical path? Calculate the slack for each activity. How long will it take to complete the project?
Given the following network diagram for a project, determine each of the following (activity times are in weeks): a) Identify all paths in the network. b) Determine each path's length. c) Identify the Critical Path(s). d) Calculate the expected project duration. a. Path b. Path length c. Critical Path (CP) d. Project duration
Given the following Project Activities and Precedence Relations table; determine the Critical Path, and the minimum Project Duration. Create the Gantt Chart for the project represented in the table. Project Activities and Precedence Relations ACTIVITY DURATION PRECEDED BY: A 3 B 2 A C 2 D 1 E 1 B F G 2 1 D D H 4 BD 2 J J 1 4 K F L 3 G M N 3 3 IJ H 0 4 HKL MNO Р...
Given the following Project Activities and Precedence Relations table; determine the Critical Path, and the minimum Project Duration. Create the Gantt Chart for the project represented in the table. Project Activities and Precedence Relations ACTIVITY DURATION PRECEDED BY: А 3 B 2 A C 2 1 D E 1 B F 2 1 D D G H 4 2 BD E J 1 E F 4 K L 3 G M N 3 3 H 0 4 HKL P MNO...