A project contains the following activities and relations.
a) Construct the associated project network.
b) Find earliest and latest occurence time of each activity.
c) Find the critical path of the project.
d) Construct time schedule of the project.
e) Compute total floats and free floats for the noncritical activities of the network and
discuss their use in finalizing a schedule for the project (give at least one example).
> please do not upload old answer
sasha195456. Sat, Apr 24, 2021 8:42 AM
Answer [A] Project Network
Answer [C]
Critical Path = A-C-D-F-G-H-J-L-N-S-T
Project Duration = 38
Answer [B]
Free float = subtracting the early finish (EF) of the activity from the early start (ES) of the successor activity.
Total Float = Late finish - Early finish Or Early finish - early start
Activity time |
Early Start |
Early Finish |
Late Start |
Late Finish |
Total Float |
Free Float |
|
A |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
B |
2 |
0 |
2 |
10 |
12 |
10 |
0 |
C |
1 |
1 |
2 |
1 |
2 |
0 |
0 |
D |
2 |
2 |
4 |
2 |
4 |
0 |
0 |
E |
6 |
2 |
8 |
12 |
18 |
10 |
10 |
F |
10 |
4 |
14 |
4 |
14 |
0 |
0 |
G |
3 |
14 |
17 |
14 |
17 |
0 |
0 |
H |
1 |
17 |
18 |
17 |
18 |
0 |
0 |
I |
1 |
14 |
15 |
27 |
28 |
13 |
0 |
J |
5 |
18 |
23 |
18 |
23 |
0 |
0 |
K |
2 |
15 |
17 |
36 |
38 |
21 |
0 |
L |
1 |
23 |
24 |
23 |
24 |
0 |
0 |
M |
2 |
14 |
16 |
22 |
24 |
8 |
8 |
N |
4 |
24 |
28 |
24 |
28 |
0 |
0 |
O |
2 |
23 |
25 |
27 |
29 |
4 |
0 |
P |
2 |
25 |
27 |
29 |
31 |
4 |
0 |
Q |
1 |
27 |
28 |
37 |
38 |
10 |
0 |
R |
7 |
27 |
34 |
31 |
38 |
4 |
0 |
S |
7 |
28 |
35 |
28 |
35 |
0 |
0 |
T |
3 |
35 |
38 |
35 |
38 |
0 |
0 |
Answer [D]: Time Schedule
F: The activities in the following table describe the construction of a new house. Activity Predecessor(s) Duration(days) A: Clear site B: Bring utilities to site Excavate D: Pour foundation E: Outside plumbing B, C Frame house D G: Do electric wiring H: Lay floor Lay roof F Inside plumbing E, H K: Shingling Outside sheathing insulation F.J M: Install windows and outside doors F Do brick work L, M 0: Insulate walls and ceiling GJ Cover walls and ceiling 0...
for each problem I have this setup so far. I need help on each part and im not too sure if I am on the right track for each question on the picture. this chapter is on project management for statistics 1. A project is shown by the following network. The durations of activities (in weeks) are indicated on the arrows. a. Identify all of the paths, compute the length of each, identify the critical path and the b. Determine...
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...
The following is a table of activities associated with a project at Rafay Ishfaq's software firm in Chicago, their durations and what activities each must precede: Activity Duration (weeks) Precedes A (start) 2 B, C B 2 E C 6 F E 3 F F (end) 4 — This exercise contains only parts b, c, and d. b) Define the critical path, listing all critical activities in chronological order. Critical path activities are the activities that lie on the longest...
.8-6. A project consists of 12 activities, represented by the project network below, where number by each arc represents the duration (in days) of the associated activity 4 12 4 12 10 a) Find the earliest time, latest time, and slack for each event as well as the slack for each activity. Also identify the critical path. (b) The project has been scheduled to be completed in the minimum possible time.If all previous activities have begun as early as possible...
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...
1. The activities needed for a new project your company is undertaking are listed in the following table. ACTIVITY IMMEDIATE PREDECESSOR(S) A ---- B ---- C A D A, B E B F C, D, E G D, E H F I F, G J G The activity times were determined for the project, and were as below. ACTIVITY ACTIVITY TIME (days) A 11 B 9 C 7 D 12 E 8 F 9 G 10 H 6 I 7...
11. In CPM/PERT, an activity that is on the critical path A. has equal values for "Latest Start" and "Earliest Start" ( LS = ES ) B. has equal values for "Latest Finish" and "Earliest Finish" ( LF = EF ) C. is used in calculating total project duration D. has slack equal to zero E. all of the above 12. In CPM/PERT, the critical path through the network A. will require the most time of any path B. will...
Given is a PERT project network diagram as shown below: Start End ctivity |StarA KEnd 15 me 10 13 12 20 a) The Project Completion time = b) The Earliest Start time, ES, of Activity F- c) The Earliest Start time, ES, of Activity K = d) The Latest Start time, LS, of Activity. E = e) The non-critical activities are comma, no space) (ex. type in critical activities as ABCD, no
2) The following tasks been assigned for a project following the steps needed to develop a project network. Show al necessary steps and graphical representations. Find: 1 Critical Path for this project 2) Total free slack times for each activity 3) Total completion Time 4) The latest time that the activity D must be started to complete the project by day 54 Activity Predecessor Activity Time A |None None M,L.K 3) How would you calculate the duration of an activity...
> very urgent please solve the questions one by one
sasha195456. Sat, Apr 24, 2021 8:36 AM