The following table of probabilistic time estimates (in weeks)
and activity predecessors are provided for a project.
Time Estimates (weeks) |
Activity |
a |
m |
b |
Activity Predecessor |
A |
3 |
5 |
7 |
-- |
B |
4 |
8 |
10 |
A |
C |
2 |
3 |
5 |
A |
D |
6 |
9 |
12 |
B, C |
E |
5 |
9 |
15 |
D |
Table 9.2
Reference: Ref 9-2
Using Table 9.2, the earliest start (ES) time for activity D is
Select one:
A. 21.67 weeks.
B. 8.17 weeks.
C. 12.67 weeks.
D. 18.33 weeks.
Expected time of an activity = (optimistic + (4 * most likely) + pessimistic) / 6
Early start time of activity D is 12.67. Hence the correct option is c. 12.67
The following table of probabilistic time estimates (in weeks) and activity predecessors are provided for a project....
The following table of probabilistic time estimates (in weeks) and activity predecessors are provided for a project. Time Estimates (weeks) Activity a m b Activity Predecessor A 3 5 7 -- B 4 8 10 A C 2 3 5 A D 6 9 12 B, C E 5 9 15 D Table 9.2 Reference: Ref 9-2 Using Table 9.2, the variance for activity E is Select one: A. 2.582. B. 1.667. C. 1.291. D. 2.778.
The following table shows estimates of activity times (weeks) for a project: Activity Optimistic Time Most Probable Time Pessimistic Time A 3 4.5 9 B 1.5 2 2.5 C 5 6 7 D 4 4.5 8 E 5 6 7 F 1 2.5 7 G 7 9 11 Suppose that the critical path is A-B-D-F-G. Use Appendix A to answer the questions. Do not round intermediate calculations. Round your answers to three decimal places. What is the probability that the...
A project consists of the following four activities with activity times in days: Activity Predecessor Time A 6 B A 5 C A 4 D B,C 8 Table 9.3 Reference: Ref 9-3 Using Table 9.3, the critical path for this project is Select one: A. A-B-C-D. B. A-B-D. C. A-B-C. D. A-C-D.
Consider the following project where times are in weeks. Activity Duration Immediate Predecessors A B с D E F G H A.B B A с E,F 8 12 7 4 2 3 7 3 DF a) Determine the activity schedule (ES, EF, LS, and LF) as well as slack using the information from the table above (11 marks) b) Determine all the possible paths of this project and determine the shortest possible time this project can be completed? (4 marks)...
A network consists of the following list. Times are given in weeks. Activity Preceding Time (weeks) Activity Predecessor Duration A 4 B 9 C A 5 D B A 3 E D C 4 Calculate the ES, EF, LS, LF, slack for each activity. List the critical activities for this project.
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...
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...
Using Table 2.13 below, if the expected time for activity E is changed to nine weeks, by how many weeks will the project's expected completion time increase? Table 2.13 (All activity times for the project are in weeks.) Activity Optimistic Time Most Likely Time Pessimistic Time Immediate Predecessors(s) A 3 4 5 --- B 5 7 9 --- C 2 3 10 A D 2 5 8 B E 1 7 7 B F 3 5 7 CD G 7...
Consider a project with the following information: Activity Duration Predecessors A 5 -- B 7 A C 9 B D 5 B E 7 C, D F 6 D G 4 C H 7 E, F, G Activity Duration ES EF LS LF Float A 5 0 5 0 5 B 7 5 12 5 12 C 9 12 21 12 21 D 5 12 17 16 21 E 7 21 28 21 28 F 6 17 23 22 28...
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...