Question

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 the earliest and latest activity start time. (hint: calculate EF and LF first) L 2. For the following project find the earliest and latest activity times and slack for each activity, the critical path and the project duration. Ιλ 3. Show the network presentation of the following project e, c c, d, e f, g 4. Consider the following project: Dummu Chvith a. Find the critical path for the project by calculating EF, LF, and S for each activity b. Show the ES and LS of each activity in one table. a:12 2

Answer 1

3 18 E6 20 6 The podh are Possible IO tO 3-C IS IS 6 12 1 8 15 18 3 1 S 18 O So the cfficol path cohere Et- L

w飞 (o 10 as 16 20 t ac &규 (O 13 18 15, 436 Q0 au 없다 Sう6 6う弁 21 36 มา 36 * Immidiate predecceo mean of an adiuit the next ache; oth start.

u28 LuS E)-S3 E6を to Earlst me 32 LS (6 2 Iaa 13 a UL2 IO 12 Qs 26 Sa 28 6 3- 4 プ5 6 31 03 t S a良 Sa 43 S3