If submitting using a copy of this document, circle your answers. If using plain paper, write the question number and your answer choice (a, b, etc) along with the additional information requested in #6.

1. Which of the following is the critical path?

1. A, B, D, F, G
2. A, C, E, F, G
3. A, C, B, F, E
4. A, D, E, F, G
5. None of the above

2. What is the duration of the critical path?

1. 12
2. 13
3. 14
4. 10
5. 11

3. Which of the following activities has slack?

1. A
2. B
3. E
4. F
5. G

4. If it is decided to use all of the available slack in the activity that you selected in #3, which of the following activities would still have available slack?

1. A
2. B
3. C
4. D
5. none

5. It is desired to reduce the duration of this project by one week. All activities can each be crashed by one week (and only one week); no activity can be crashed to zero (0). Reducing which activity by one week provides the least cost way of reducing the project duration by one week?

1. A
2. B
3. C
4. D
5. E

6. What is the lowest possible total cost to reduce this project by a total of three weeks? Remember that each activity can only be crashed by one week; no activity can be crashed to zero (0). (Note: your answer to 5 is the first week to be crashed; you need to select two additional activities to each be crashed by one week and then calculate the total cost for all three weeks. Clearly write-in which two additional activities you are crashing.)

1. $4000
2. $5000
3. $6000
4. $7000
5. $8000

A company must perform a maintenance service project consisting of seven activities. The activities, the predecessors, and respective time estimates are as follows. Immediate Crashing cost Activity Designation Predecessor Time in Weeks $ per week Break down both machines A None 2 3000 Clean machine 1 B A 3 1000 Clean machine 2 A 4 2000 Re-set machine 1 D B 4 2000 Re-set machine 2 E C 3 1000 Re-calibrate both machines F D and E 1 Not available Final test both machines G F 3 2000 Activities can only be crashed by one week each (except F which cannot be crashed at all) . Earliest Start Time (ES)=Latest EF for all immediate predecessors Earliest Finish Time (EF)= ES + activity's duration Latest Start Time (LS)= LF - activity's duration Latest Finish Time (LF)= Earliest LS for all immediate successors Slack = amount of allowable delay in an activity= Equal to LS-ES or LF - EF for an activity Use the following space to sketch your diagram or use blank sheets. Be sure to show all four times for each activity. (If you do not do this, and you show/select the wrong answer, there will be no basis for awarding partial credit.) A company must perform a maintenance service project consisting of seven activities. The activities, the predecessors, and respective time estimates are as follows. Immediate Crashing cost Activity Designation Predecessor Time in Weeks $ per week Break down both machines A None 2 3000 Clean machine 1 B A 3 1000 Clean machine 2 A 4 2000 Re-set machine 1 D B 4 2000 Re-set machine 2 E C 3 1000 Re-calibrate both machines F D and E 1 Not available Final test both machines G F 3 2000 Activities can only be crashed by one week each (except F which cannot be crashed at all) . Earliest Start Time (ES)=Latest EF for all immediate predecessors Earliest Finish Time (EF)= ES + activity's duration Latest Start Time (LS)= LF - activity's duration Latest Finish Time (LF)= Earliest LS for all immediate successors Slack = amount of allowable delay in an activity= Equal to LS-ES or LF - EF for an activity Use the following space to sketch your diagram or use blank sheets. Be sure to show all four times for each activity. (If you do not do this, and you show/select the wrong answer, there will be no basis for awarding partial credit.)