Exam 9: Project Scheduling: Pertcpm

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

PERT and CPM

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.

To calculate an activity's latest finish time, you should consider its

Activities with zero slack

Generally, the more serial (as opposed to parallel) relationships present in a project network, the less time will be required to complete the project.

The critical path for this network is A - E - F and the project completion time is 22 weeks. If a deadline of 17 weeks is imposed, give the linear programming model for the crashing decision.

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.

Arcs in a project network indicate

Activities following a node

When activity times are uncertain,

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

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

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

Slack equals

The length of time an activity can be delayed without affecting the project completion time is the slack.

From this schedule of activities, draw the PERT/CPM network.

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

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.