Class Notes: 2/15/06

 

Note Takers: Catherine & Thomas

 

·         What did we do last time?

o       Presentation – by Sara

§         Same food, different portions

§         Rice differentiation

§         Nicole +1

§         Americans eat more than Korea

§         Chicken Sandwich – Spicy à hot

·         Today’s Presentation

o       Akron

Today

CPM (Critical Path Method)

PERT (Program Evaluation Review Technique) - Lance +1

What to do with these two above? To finish project in a good timely/costly fashion by lowering the cost.

Job can be done simultaneously - Lisa +1

CPM

PERT

Class Assignment:

Internet References (Google search: “critical path method”):

            http://www.netmba.com/operations/project/cpm/

    http://hadm.sph.sc.edu/COURSES/J716/CPM/CPM.html

    http://www.buildersnet.org/cpmtutor/cpmtutor.html

 

CPM: 4 words: ES (Early Start), EF (Early Finish), LS (Late Start), LF (Late Finish).

 

E stands for Early

Early means how early you can start, finish

EF=early finish - Tahidul +1

 

What does L mean? Late

S means start.

F means finish.

 

What's the earliest you can start?

What's the latest you can finish?

 

Every node/activity has ES, EF, LS, and LF.

Every node/activity has a completion time.

Immediate predecessor: activities that must be completed before node/activity can start.

Every node can have one before it? Predecessor - Steve +1

2 ways to do CPM:

Forward Pass – start from beginning and compute ES and EF. Backward Pass – start from end and compute LS and LF.

 

CMP works with a fixed time. Ex. Go to mechanic for 50,000 mile tune-up (they know when the parts need to be replaced).

 

Slack – allowable delay. If slack is 0 (zero), it’s in the critical path, any delay will delay whole project.

 

 

Compute Slack: 2 ways

LS - ES and LF - EF (result of backward pass minus forward pass). If result is 0, it’s in the critical path.

 

What is the latest and earliest start?

 

 

Each Node:

Name of the node, duration that it takes, ES, EF, LS, LF, Slack

 

Finding ES (forward pass):

            ES = Max(EF of all immediate predecessors)

 

EF of each node is calculated within the node itself.

 

Finding LF (backward pass):

            LF = Min(LS of all immediate predecessors)

Summary

For every node, find earliest start and latest finish.

Critical Path = 0

 

Find a way to remember it!!!

____________________________________________________________________________________

 

Director of TLC - Professor Ebrahimi

 

Why changed it this year? Good Friday

 

Time Slot Example: Delta

Nicole - Previous question +1

 

                    ________________________

 

Three you should know

 

1. Uniqueness/Quality Differentiation

2. Low Cost

3. Response - Ralph & Scott +1

                        __________________

 

From pg. 57 in book:

Activity

Description

Time (weeks)

A

Build internal components

2

B

Modify roof and floor

3

C

Constructs collection  stack

2

D

Pour concrete and install frame

4

E

Build high-temperature burner

4

F

Install pollution control system

3

G

Install air pollution device

5

H

Inspect and test

2

 

Total Time (weeks)

25

 

1st Row - Node

3rd Row - Time

 

How many weeks to build this unit? 25

Done in 6 steps:

       1 – Define Project

2 – Predecessor Table

3 – Time Table

4 – Network Diagram

5 – Forward Pass (calculate ES and EF – “the earlier you finish, the sooner I’ll start”).

6 – Backward Pass (calculate LS and LF)

7 – Critical Path and Slack

5 & 6 are hardest

Examples:

Finished @ 9:42 PM