Since, activity D is the immediate predecessor of K and M, the latest finish time of D is the minimum among the latest start time of the succeeding activities(Activity K and M).Here latest start time of activities K and M are 99 and 106. So The latest finish time of activity D should be at the end of day 99
Activity D is the immediate predecessor of activities K and M. If the latest 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...
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...
You are STA FIN The duration of activity K, M, N, and P are 36, 39, 26, and 35 days, respectively. The duration of activity E, F,G, and H are 24, 27, 32, and 37 days, respectively The latest start times of activity Q, R, and S at the end of day of 95, 99, and 85, respectively. Perform the backward pass of CPM The latest finish time of activity E is at the end of day The latest finish...
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...
Consider the following project. Activity ImmediateActivity Time (days) Predecessor CD E,F What is the critical path? O ACFG O ADFG OBEG ACDFG What is the latest finish time for activity F? 0 9 O 13 O 16 What is the latest possible time that Activity E can be started without delaying the completion of the project? What is the latest time that activity B can finish without delaying any other activities? 4 What is the latest time that activity B...
From this schedule of activities: Activity Immediate Predecessor Activity Time A --- 4 B A 2 C B 3 D B 5 E A 1 F C, D 3 G E, F 2 a. Draw the PERT/CPM network b. Complete the forward and backward pass c. Determine the critical path d. Determine the total duration of the project.
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...
The following represent activities in Marc Massoud's Construction Company project: Activity Immediate Predecessor(s) Time (weeks) Activity Immediate Predecessor(s) Time (weeks) = C, E WLUI WNVN = n a a) Choose the correct network to represent this situation. OA. OB b) The critical path is B-E-F-H c) The length of the critical path is . weeks.
Question 8-10, CHAPTER 18: A home-remodeling project consists of eight activities. The immediate predecessors and activity times in weeks are shown below. Activity Predecessor(s) Normal Time Crash Time Normal Cost $400 Crash Cost $700 1600 2000 800 1100 1000 NNW 600 1200 1450 800 800 500 650 400 600 900 1300 F G H1 1000 650 8. Draw the network for this project. (10 points) 9. Please indicate the Earliest Start, Earliest Finish, Latest Start, and Latest Finish on the...
2. Consider the network described in the table below. Immediate Predecessor(s) Activity J K L M N O Р Pessimistic 15 9 10 3 9 10 10 J J KM KM LN Probable 10 8 6 3 5 7 8 Optimistic 8 7 5 3 1 4 3 Draw the network diagram and answer the following questions, DuC duUCULUU AabbLCU AOBOLcud Red E 1 Normal 1 No Spac... Heading 1 Heading 2 Title Subtitle Subtle Em... Sel Styles Edit Paragraph...