Consider the following project activities:
a.
Activity | Optimistic time-a | Expected completion time-m | Pessimistic time-b | Expected time= (a+4*m+ b)/6 |
A | 1 | 2 | 4 | 2.17 |
B | 2 | 3 | 7 | 3.50 |
C | 1 | 3 | 5 | 3.00 |
D | 3 | 6 | 9 | 6.00 |
E | 2 | 3 | 7 | 3.50 |
F | 4 | 5 | 7 | 5.17 |
G | 3 | 4 | 8 | 4.50 |
H | 1 | 2 | 3 | 2.00 |
I | 2 | 4 | 6 | 4.00 |
b.
c & d
step 1 | find early start, and early finish from the start of the project for each activity |
step 2 | Find Maximum EF and keep it as the LF of last activities. Max of EF's is 17.67 |
step 3 | calculate LS for each activity after calculating its EF |
Activity | Duration, D | Early start, ES=Max of early finish of preceding activities | Early finish, EF = ES + D | Late finish, LF= Min of LS of successor activities | Late start, LS= LF - D | Total slack= LF-EF |
A | 2.17 | 0.00 | 2.17 | 2.17 | 0.00 | 0.00 |
B | 3.50 | 2.17 | 5.67 | 5.67 | 2.17 | 0.00 |
C | 3.00 | 2.17 | 5.17 | 5.67 | 2.67 | 0.50 |
D | 6.00 | 5.67 | 11.67 | 11.67 | 5.67 | 0.00 |
E | 3.50 | 5.17 | 8.67 | 9.17 | 5.67 | 0.50 |
F | 5.17 | 2.17 | 7.33 | 9.17 | 4.00 | 1.83 |
G | 4.50 | 8.67 | 13.17 | 13.67 | 9.17 | 0.50 |
H | 2.00 | 11.67 | 13.67 | 13.67 | 11.67 | 0.00 |
I | 4.00 | 13.67 | 17.67 | 17.67 | 13.67 | 0.00 |
Consider the following project activities: Calculate the expected time (te) for each activity. Draw an Activity...
tual code de a Activity Predecessor Normal time A 2 B 3 C B A С 5 G. F H 15 HH 2 D И N M, J 1 - Calculate early start (ES), early finish (EF), late start (LS) and late finish (LF) for each activity - Draw Activity on Arrow network (AOA) - Draw Activity on Node network (AON) - Calculate slack of each activity - Determine the critical paths. There must be at least 2 critical paths...
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...
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...
A Question 11 The following table provides a list of activities in a project, along with their respective durations and precedence requirements: Immediate Duration Activity Predecessor(s) (weeks) 2 B 3 C B D А E A.C 1 F DE 3 с 3 2 6 G Determine the amount of slack time for Activity E: a. O weeks b. 1 week C. 2 weeks O d. 3 weeks Question 12 Assume that activity A has the following times: Early start time...
Question 13 The following table provides a list of activities in a project, along with their respective durations and precedence requirements: Immediate Duration Activity Predecessor(s) (weeks) A 2 B 3 с 2 D A,B 5 E CD F D 4 G E 2 1 Determine the duration of the project. a. 13 weeks b. 12 weeks OC. 11 weeks d. 10 weeks e. 9 weeks Question 14 Assume that activity F has the following times: Early start time (ES) =...
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.
Consider the network described in the table below. Activity Immediate Predecessor(s) Pessimistic Probable Optimistic J -- 15 10 8 K -- 9 8 7 L J 10 6 5 M J 3 3 3 N K, M 9 5 1 O K, M 10 7 4 P L, N 10 8 3 Draw the network diagram and answer the following questions. (a) Calculate the expected duration of each activity. (b) Calculate the expected duration and variance of the critical path....
A small software development project has eight major activities. The times are estimated and provided in the table below: Activity Optimistic Time Most Likely Time Pessimistic Time Immediate Predecessor(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 C, D G 7 8 9 D, E H 2 6 10 F Answer the following questions based on above table 1-2...
3. (20 points) A landscaping upgrade project consists of following activities. Times are given in weeks. Activity | Immediate Predecessor Activity Time A А ထင်ထ F B, DC D D 3 3 a. Draw the network diagram and find the ES, EF, LS, LF, and slack for each activity b. Construct an early-start-date Gantt chart for the project. C. As a project manager, where would you focus your attention, given your analysis?
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...