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 4 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

2. List the tasks on the critical path

3. What is the expected project duration in weeks?

4. What is the slack for each activity?

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.)