This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 12: PROJECT SCHEDULING: PERT/CPM MULTIPLE CHOICE 1. PERT and CPM a. are most valuable when a small number of activities must be scheduled. b. have different features and are not applied to the same situation. c. do not require a chronological relationship among activities. d. have been combined to develop a procedure that uses the best of each. 2. Which is not a significant challenge of project scheduling? a. deadlines exist. b. activities are independent. c. many employees could be required. d. delays are costly. 3. Arcs in a project network indicate a. completion times. b. precedence relationships. c. activities. d. the critical path. 4. The critical path a. is any path that goes from the starting node to the completion node. b. is a combination of all paths. c. is the shortest path. d. is the longest path. ANSWER: d TOPIC: Critical path 5. The earliest start time rule a. compares the starting times of all activities for successors of an activity. b. compares the finish times for all immediate predecessors of an activity. c. determines when the project can begin. d. determines when the project must begin. 6. Activities following a node a. can begin as soon as any activity preceding the node has been completed. b. have an earliest start time equal to the largest of the earliest finish times for all activities entering the node. c. have a latest start time equal to the largest of the earliest finish times for all activities entering the node. d. None of the alternatives is correct. 7. Activities G, P, and R are the immediate predecessors for activity W. If the earliest finish times for the three are 12, 15, and 10, then the earliest start time for W a. is 10. b. is 12. c. is 15. d. cannot be determined. 1 2 Chapter 12 Project Scheduling: PERT/CPM 8. Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The latest finish time for activity H a. is 11. b. is 14. c. is 18. d. cannot be determined. 9. When activity times are uncertain, a. assume they are normally distributed. b. calculate the expected time, using (a + 4m + b)/6. c. use the most likely time. d. calculate the expected time, using (a + m + b)/3. 10. To determine how to crash activity times a. normal activity costs and costs under maximum crashing must be known. b. shortest times with crashing must be known. c. realize that new paths may become critical. d. All of the alternatives are true. 11. Slack equals a. LF – EF. b. EF – LF. c. EF – LS. d. LF – ES. 12. Activities with zero slack a. can be delayed. b. must be completed first. c. lie on a critical path. d. have no predecessors. 13. In deciding which activities to crash, one must a. crash all critical activities....
View Full Document
This note was uploaded on 01/26/2012 for the course ADMS ADMS 3330 taught by Professor Adms3330 during the Spring '10 term at York University.
- Spring '10