Consider a project having the following six activities:
Immediate Max Crash cost
Activity Predecessors Time (weeks) Crash* per week
A none 7 7 N/A
B none 3 2 $500
C A 5 3 $1000
D A, B 6 4 $2000
E C, D 4 3 $1250
F D 3 2 $1000
*Shortest possible time for the task
1. Draw the project network and list the earliest start (ES), earliest finish (EF), latest start (LS) and latest finish (LF) for each task (1.5 pts.)
2. List the tasks on the critical path (0.4 pts.)
3. What is the expected project duration in weeks? (0.4 pts.)
4. What is the slack for each activity? (1.2 pts.) A: B: C: D: E: F:
5. The project needs to be crashed by 2 weeks. What are the activities crashed to achieve the 2 week crash at lowest cost? List the new duration of each task and any associated crash costs (0.5 pts.) Activity Duration Crash Cost A B C D E F
6. Draw the NEW project network and list the earliest start (ES), earliest finish (EF), latest start (LS) and latest finish (LF) for each task (0.6 pts.)
7. List the tasks on the critical path (0.4 pts.)
1. We draw project network listing the earliest start (ES), earliest finish (EF), latest start (LS) and latest finish (LF) for each task as follow:

The legend for the values mentioned in the box is shown in above figure at the top:
Earliest start = ES, earliest finish = EF, latest start = LS, latest finish = LF, Slack = SLK, Duration of activity = DUR
2) As seen from above network diagram, the path in red is critical path. Hence, task A-C-E are on critical path
3) As seen from above network diagram, the longest LF is 16 weeks. Hence, the project duration is 16 weeks.
4) As seen from above network diagram, slack on each activity:
A: 0 weeks
B: 4 weeks
C: 0 weeks
D: 4 weeks
E: 0 weeks
F: 4 weeks
__________________________________________________________________________________________________
Other questions have to be posted separately.
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...
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...
Problem 5: For the given activity network, if there are 35 days required to complete the project, find the following Complete the network by filling in ES, LS, EF and LF Earliest start for activities D, E, F, H, G, L, M ill. Earliest finish for activities D, E, F, H,G,L,M Latest start for activities D, E, F, H, G, LM V. Latest finish activities D, E, F.H.GLM vi. Slack/Float time for each activities D, E, F, H, G, LM...
The ABC Manufacturing Co. has made a decision to replace an existing production line with new equipment. This project will require several tasks (jobs) with precedence relationships and duration (days) as shown in the following table. The project will be finished when activities A-J are all finished. Activity predecessor Optimistic Most likely Pessimistic Expected A - 4 5 12 B A 3 4.5 15 C A 2 3 4 D C 6 8 22 E B 4 6 8 F...
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...
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...
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...
Consider the following project activities:
Calculate the expected time (te) for each
activity.
Draw an Activity on Node (AON) diagram to reflect the flow of
these activities.
Calculate the Early Start (ES), Early Finish (EF), Late Start
(LS), and Late Finish (LF) for each activity.
Calculate the slack for each activity.
Identify all activities on the Critical Path.
Use the data to calculate the probability the project will
finish in 20 weeks (Hint: z-score).
Activity A 8 с D E...
Provide step by step please thank you, no exce
Assume you have a project with ten activities labeled A-J, as shown. Derive the earliest completion time (or early finish-EF), latest completion time (or late finish-LF), and slack for each of the following tasks (begin at time 0) the critical path on your network diagram. . Which tasks are on the critical path? Highligh Preceding Expected Critical Path? Activity Event Duration EF LF Slack A, D C,E D, E F, G...
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) =...