MIT1_204S10_assn5

# MIT1_204S10_assn5 - 1.204 Computer Algorithms in Systems...

This preview shows pages 1–2. Sign up to view the full content.

1.204 Computer Algorithms in Systems Engineering Spring 2010 Problem Set 5: Project management Due: 12 noon, Wednesday, April 7, 2010 1. Problem statement The most widely used scheduling technique is the critical path method (CPM) for scheduling, often referred to as critical path scheduling . This method calculates the minimum completion time for a project along with the possible start and finish times for the project activities. The critical path represents the set or sequence of predecessor/successor activities which will take the longest time to complete. The duration of the critical path is the sum of the activities' durations along the path. Thus, the critical path can be defined as the longest possible path through the "network" of project activities. The duration of the critical path represents the minimum time required to complete a project. Any delays along the critical path imply that additional time would be required to complete the project. Table 1 gives an example project: TABLE 1 Precedence Relations and Durations for a Nine Activity Project Example Activity Description Predecessors Duration A Site clearing

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/04/2011 for the course ESD 1.204 taught by Professor Georgekocur during the Spring '10 term at MIT.

### Page1 / 3

MIT1_204S10_assn5 - 1.204 Computer Algorithms in Systems...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online