Question 1

Which is not a significant challenge of project scheduling?

Accepted Answer

A)  deadlines exist. 
B)  activities are independent. 
C)  many employees could be required. 
D)  delays are costly. 
A)  deadlines exist. 
B)  activities are independent. 
C)  many employees could be required. 
D)  delays are costly. B

Question 2

When activity times are uncertain, an activity's most likely time is the same as its expected time.

Accepted Answer

A) True 
 B)False  False

Question 3

The difference between an activity's earliest finish time and latest finish time equals the difference between its earliest start time and latest start time.

Accepted Answer

A) True 
 B)False  True

Question 4

For an activity with more than one immediate predecessor activity, which of the following is used to compute its earliest finish (EF) time?

Accepted Answer

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

Question 5

Which of the following is a general rule for crashing activities?

Accepted Answer

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

Question 6

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

Accepted Answer

A)  is 10. 
B)  is 12. 
C)  is 15. 
D)  cannot be determined. 
A)  is 10. 
B)  is 12. 
C)  is 15. 
D)  cannot be determined.

Question 7

In deciding which activities to crash, one must

Accepted Answer

A)  crash all critical activities. 
B)  crash largest-duration activities. 
C)  crash lowest-cost activities. 
D)  crash activities on the critical path(s) only. 
A)  crash all critical activities. 
B)  crash largest-duration activities. 
C)  crash lowest-cost activities. 
D)  crash activities on the critical path(s) only.

Question 8

PERT and CPM are applicable only when there is no dependence among activities.

Accepted Answer

A) True 
 B)False

Question 9

To determine how to crash activity times

Accepted Answer

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

Question 10

A project network is shown below. Use a forward and a backward pass to determine the critical path, and then fill out the table below. Activity times are in weeks.     Now assume that the times listed are only the expected times instead of being fixed times. Is the probability of being finished in more than 28 weeks more or less than 50%?

Accepted Answer

@#IMG-DLM& The probability is

Question 11

From this PERT/CPM network, determine the list of activities and their predecessors.

Accepted Answer

The answer of From this PERT/CPM network, determine the list...

Question 12

The earliest start time for an activity is equal to the smallest of the earliest finish times for all its immediate predecessors.

Accepted Answer

A) True 
 B)False

Question 13

The critical path

Accepted Answer

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

Question 14

All activities on a critical path have zero slack time.

Accepted Answer

A) True 
 B)False

Question 15

A project network is shown below. Use a forward and a backward pass to determine the critical path, and then fill out the table below. Activity times are in weeks.     Now assume that the times listed are only the expected times instead of being fixed times. Is the probability of being finished in fewer than 25 weeks more or less than 50%?

Accepted Answer

@#IMG-DLM& The probability is

Question 16

A path through a project network must reach every node.

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

A)  is 11. 
B)  is 14. 
C)  is 18. 
D)  cannot be determined. 
A)  is 11. 
B)  is 14. 
C)  is 18. 
D)  cannot be determined.

Question 18

Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish time with the earliest finish time of each predecessor.

Accepted Answer

A) True 
 B)False

Question 19

A cookie recipe gives the following numbered steps.
   Although the steps are numbered, they do not always reflect immediate precedence relationships. Develop a table that lists the immediate predecessors for each activity.

Accepted Answer

The answer of A cookie recipe gives the following numbered...

Question 20

A senior MIS design class project team has developed the following schedule of activities for their project, using their best estimate of completion times. Both written and oral reports are required. Draw the project network. Can they complete the project in the 38 class days remaining until the end of the semester?

Accepted Answer

@#IMG-DLM& and the c

Which is not a significant challenge of project scheduling?

When activity times are uncertain, an activity's most likely time is the same as its expected time.

The difference between an activity's earliest finish time and latest finish time equals the difference between its earliest start time and latest start time.

For an activity with more than one immediate predecessor activity, which of the following is used to compute its earliest finish (EF) time?

Which of the following is a general rule for crashing activities?

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

In deciding which activities to crash, one must

PERT and CPM are applicable only when there is no dependence among activities.

To determine how to crash activity times

From this PERT/CPM network, determine the list of activities and their predecessors.

The earliest start time for an activity is equal to the smallest of the earliest finish times for all its immediate predecessors.

The critical path

All activities on a critical path have zero slack time.

A path through a project network must reach every node.

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

Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish time with the earliest finish time of each predecessor.

A cookie recipe gives the following numbered steps. Although the steps are numbered, they do not always reflect immediate precedence relationships. Develop a table that lists the immediate predecessors for each activity.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters

Exam 9: Project Scheduling: Pertcpm

Which is not a significant challenge of project scheduling?

When activity times are uncertain, an activity's most likely time is the same as its expected time.

The difference between an activity's earliest finish time and latest finish time equals the difference between its earliest start time and latest start time.

For an activity with more than one immediate predecessor activity, which of the following is used to compute its earliest finish (EF) time?

Which of the following is a general rule for crashing activities?

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

In deciding which activities to crash, one must

PERT and CPM are applicable only when there is no dependence among activities.

To determine how to crash activity times

From this PERT/CPM network, determine the list of activities and their predecessors.

The earliest start time for an activity is equal to the smallest of the earliest finish times for all its immediate predecessors.

The critical path

All activities on a critical path have zero slack time.

A path through a project network must reach every node.

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

Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish time with the earliest finish time of each predecessor.

A cookie recipe gives the following numbered steps. Although the steps are numbered, they do not always reflect immediate precedence relationships. Develop a table that lists the immediate predecessors for each activity.

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Nonlinear Optimization Models

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Filters