Mgt 3325 - Home   Spring 2010   Email to Dr. Lyons     PatLyons Home
[ Calendar12:20 | 1:25 | Class Participation AI | App of OM | Table of Contents | Search ] 
[ Ch 1 | 2 | 3 | 4 | 5 | 6 | 6S | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | | HW1 | 2 | 3 | 4 | | Career1| 2 | 3 | 4 ]
[ SJU | TCB | CareerCenter | StudentInfo | CareerLinks | Internships ] [NYC Teaching Fellows] [ SJU Closing ] [H1N1SelfAssessment]

Ch 3 - Project Management

1. Introduction        (p59)
   1. Def - Project - a series of related tasks directed toward a major output that usually requires a long completion time.
   2. Examples - constructing a building, developing a new product, auditing a company, merging two organizations
2. Project Scheduling       (p61)
   1. Determining:
      1. Activities - tasks which make up the project
      2. Precedent relationships - activities which must be completed before another activity can start
      3. Activity time - time it takes to perform an activity
3. Gantt Chart         (p61)
   1. Def - Gantt Chart - a popular tool for scheduling small projects
   2. Example - Servicing a Jet during a Layover - Fig 3.4, p61
4. Critical Path Method        (p63)
   1. Def - Basic Critical Path Method (CPM) - a method to determine the activities which are critical to completing a project on time.
   2. Example 1 - Milwaukee Paper - p65

      Activity	Precedent   Relationship	Activity   Time (weeks)
      A – Build internal components   B – Modify roof and floor   C – Construct collection stack   D – Pour concrete and install frame   E – Build high-temperature burner   F – Install pollution control system   G – Install air pollution device   H – Inspect and test	– – A A, B C C D, E F, G	2 3 2 4 4 3 5 2

5. *Basic CPM Procedure
   1. Use Precedent Relationships to draw Network Diagram - see below.
   2. Compute earliest start (ES) time and earliest finish (EF) time for each activity (p69)
      1. ES of activities with no precedent relationships = 0
      2. EF for a given activity = its ES + its activity time
      3. ES for a given activity = largest EF of the immediately preceding activities.
   3. Compute latest start (LS) time and latest finish (LF) time for each activity (p71)
      1. LF of any final activity = the largest EF
      2. LS for a given activity = its LF - its activity time
      3. LF for a given activity = smallest LS of the immediately succeeding activities.
   4. Compute slack time for each activity: Slack = LS – ES
   5. Identify the critical path
      An activity is on the critical path if its slack time = 0.
      Note: If an activity on the critical path takes longer than estimated, then final date will be affected.
      
      
   6. Milwaukee Paper - Figs 3.11 with overlays    (p70)
      

Activity	Slack = LS - ES
A B C D E F G H	0 - 0 = 0 1 - 0 = 1 2 - 2 = 0 4 - 3 = 1 4 - 4 = 0 10 - 4 = 6 8 - 8 = 0 13 - 13 = 0

Critical path: A, C, E, G, H
        Do assigned HW 
                             (This page was last edited on January 15, 2010 .)