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

Exam 9: Project Scheduling: Pertcpm

Consider a project that has been modeled as follows: a. Draw the PERT/CPM network for this project and determine project's expected completion time and its critical path. b. Can activities E and G be performed simultaneously without delaying the minimum project completion time? c. Can one person perform A, G, and I without delaying the project? d. By how much can activities G and L be delayed without delaying the entire project? e. How much would the project be delayed if activity G was delayed by 7 hours and activity L was delayed by 4 hours? Explain.

(Essay)

4.9/5

(36)

Question 21

PERT and CPM

(Multiple Choice)

4.7/5

(24)

Question 22

The earliest finish time for the final activity is the project duration.

(True/False)

4.9/5

(43)

Question 23

A path through a project network must reach every node.

(True/False)

4.7/5

(32)

Question 24

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

(Multiple Choice)

4.9/5

(47)

Question 25

The linear programming model for crashing presented in the textbook assumes that any portion of the activity crash time can be achieved for a corresponding portion of the activity crashing cost.

(True/False)

4.7/5

(36)

Question 26

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.

(True/False)

4.8/5

(33)

Question 27

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

(True/False)

4.8/5

(37)

Question 28

Use the following network of related activities with their duration times (weeks) to complete a row for each activity under the column headings below.

(Essay)

4.7/5

(32)

Question 29

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

(True/False)

4.8/5

(28)

Question 30

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?

(Essay)

4.8/5

(34)

Question 31

When activity times are uncertain,

(Multiple Choice)

4.9/5

(31)

Question 32

The normal distribution tends to be a better approximation of the distribution of total time for shorter projects where the critical path has relatively few activities.

(True/False)

4.9/5

(32)

Question 33

In deciding which activities to crash, one must

(Multiple Choice)

4.8/5

(42)

Question 34

A critical activity can be part of a noncritical path.

(True/False)

4.9/5

(31)

Question 35

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.

(True/False)

4.9/5

(33)

Question 36

Critical activities are those that can be delayed without delaying the entire project.

(True/False)

4.9/5

(39)

Question 37

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.

(True/False)

4.9/5

(40)

Question 38

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

(True/False)

4.7/5

(38)

Question 39

Joseph King has ambitions to be mayor of Williston, North Dakota. Joe has determined the breakdown of the steps to the nomination and has estimated normal and crash costs and times for the campaign as follows (times are in weeks). Joe King is not a wealthy man and would like to organize a 16-week campaign at minimum cost. Write and solve a linear program to accomplish this task.

(Essay)

4.9/5

(29)

Question 40

Showing 21 - 40 of 59

PERT and CPM

The earliest finish time for the final activity is the project duration.

A path through a project network must reach every node.

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

The linear programming model for crashing presented in the textbook assumes that any portion of the activity crash time can be achieved for a corresponding portion of the activity crashing cost.

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.

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

Use the following network of related activities with their duration times (weeks) to complete a row for each activity under the column headings below.

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

When activity times are uncertain,

The normal distribution tends to be a better approximation of the distribution of total time for shorter projects where the critical path has relatively few activities.

In deciding which activities to crash, one must

A critical activity can be part of a noncritical path.

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.

Critical activities are those that can be delayed without delaying the entire project.

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.

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

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

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: 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

PERT and CPM

The earliest finish time for the final activity is the project duration.

A path through a project network must reach every node.

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

The linear programming model for crashing presented in the textbook assumes that any portion of the activity crash time can be achieved for a corresponding portion of the activity crashing cost.

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.

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

Use the following network of related activities with their duration times (weeks) to complete a row for each activity under the column headings below.

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

When activity times are uncertain,

​The normal distribution tends to be a better approximation of the distribution of total time for shorter projects where the critical path has relatively few activities.

In deciding which activities to crash, one must

A critical activity can be part of a noncritical path.

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.

Critical activities are those that can be delayed without delaying the entire project.

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.

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

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

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

The normal distribution tends to be a better approximation of the distribution of total time for shorter projects where the critical path has relatively few activities.