Stats 3 Chap 9

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

a

For an activity with more than one immediate predecessor activity, which of the following is used to compute its earliest finish (EF) time? a. the largest EF among the immediate predecessors. b. the average EF among the immediate predecessors. c. the largest LF among the immediate predecessors. d. the difference in EF among the immediate predecessor

a

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

b

Arcs in a project network indicate a. completion times. b. precedence relationships. c. activities. d. the critical path

b

Slack equals a. LF − EF. b. EF − LF. c. EF − LS. d. LF − ES.

b

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.

b

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.

b

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

b

Which of the following is a general rule for crashing activities? a. Crash only non-critical activities. b. Crash activities with zero slack. c. Crash activities with the greatest number of predecessors. d. Crash the path with the fewest activities.

b

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.

c

Activities with zero slack a. can be delayed. b. must be completed first. c. lie on a critical path. d. have no predecessors.

c

Which of the following is always true about a critical activity? a. LS = EF. b. LF = LS. c. ES = LS. d. EF = ES

c

For an activity with more than one immediate successor activity, its latest-finish time is equal to the a. largest latest-finish time among its immediate successors. b. smallest latest-finish time among its immediate successors. c. largest latest-start time among its immediate successors. d. smallest latest-start time among its immediate successors

d

In deciding which activities to crash, one must a. crash all critical activities. b. crash largest-duration activities. c. crash lowest-cost activities. d. crash activities on the critical path(s) only

d

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

d

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.

d

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.

d