Question 1

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 2

For an activity with more than one immediate successor activity, its latest-finish time is equal to the

Accepted Answer

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

Question 3

Crashing refers to an unanticipated delay in a critical path activity that causes the total time to exceed its limit.

Accepted Answer

A) True 
 B)False

Question 4

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 5

The project manager should monitor the progress of any activity with a large time variance even if the expected time does not identify the activity as a critical activity.

Accepted Answer

A) True 
 B)False

Question 6

When activity times are uncertain, total project time is normally distributed with mean equal to the sum of the means of all of the critical activities.

Accepted Answer

A) True 
 B)False

Question 7

The variance in the project completion time is the sum of the variances of all activities in the project.

Accepted Answer

A) True 
 B)False

Question 8

The earliest start time rule

Accepted Answer

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

Question 9

A path through a project network must reach every node.

Accepted Answer

A) True 
 B)False

Question 10

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 11

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

To determine how to crash activity times

For an activity with more than one immediate successor activity, its latest-finish time is equal to the

Crashing refers to an unanticipated delay in a critical path activity that causes the total time to exceed its limit.

The critical path

The project manager should monitor the progress of any activity with a large time variance even if the expected time does not identify the activity as a critical activity.

When activity times are uncertain, total project time is normally distributed with mean equal to the sum of the means of all of the critical activities.

The variance in the project completion time is the sum of the variances of all activities in the project.

The earliest start time rule

A path through a project network must reach every node.

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

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.

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

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 9: Project Scheduling: Pertcpm

To determine how to crash activity times

For an activity with more than one immediate successor activity, its latest-finish time is equal to the

Crashing refers to an unanticipated delay in a critical path activity that causes the total time to exceed its limit.

The critical path

The project manager should monitor the progress of any activity with a large time variance even if the expected time does not identify the activity as a critical activity.

When activity times are uncertain, total project time is normally distributed with mean equal to the sum of the means of all of the critical activities.

The variance in the project completion time is the sum of the variances of all activities in the project.

The earliest start time rule

A path through a project network must reach every node.

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

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.

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

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Nonlinear Optimization Models

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters