1 / 14

Project Management (2)

Project Management (2). Chapter 16, Part 2. Review of Project Management, Part 1. What is a project? Examples of projects Project performance expectations Project life cycle phases Ways to set up a project team Determining a project schedule (part 1): determine project duration.

ahanu
Download Presentation

Project Management (2)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Project Management (2) Chapter 16, Part 2

  2. Review ofProject Management, Part 1 • What is a project? • Examples of projects • Project performance expectations • Project life cycle phases • Ways to set up a project team • Determining a project schedule (part 1): determine project duration EJR 2006

  3. Determine Project Duration • Set up a network diagram • Identify the paths • Compute the length of each path • The longest path is the criticalpath. • Project duration = length of critical path EJR 2006

  4. Project ManagementOutline of Part 2 • Critical and non-critical activities • Scheduling definitions • Scheduling computations • Objectives • Formulas • Steps in scheduling computations • Early start and late start schedules EJR 2006

  5. Critical Activities • Critical activities are those on the critical path. • Critical activities should be completed on time to avoid delaying project completion. • If a critical activity is not completed on time, the schedule must be adjusted so that the project can still be finished on time. • This requires spending more money for additional equipment, extra workers, or overtime labor • For a critical activity, there is only one start date and one end date that will allow the project to be completed on time without spending extra money. EJR 2006

  6. Non-critical Activities • Non-critical activities are not on the critical path. • For a non-critical activity, there is a range of start dates and a range of end dates that will allow the project to be completed on time without spending extra money. • In scheduling non-critical activities, we can consider factors such as cash flow and resource availability. EJR 2006

  7. Spaghetti Example • We want to eat in 34 minutes, which is the duration of cooking time. • Find the earliest and latest start times for activity F. • Find the earliest and latest finish times for activity F. • Find the earliest and latest finish times for activity G. • Find the earliest and latest start times for activity G. EJR 2006

  8. Scheduling Terms • For each activity in a project: • The early start (ES) is the earliest time that an activity can be started. • The early finish (EF) is the earliest time that an activity can be finished. • The late finish (LF) is the latest time that an activity can be finished. • The late start is the latest time that an activity can be started. EJR 2006

  9. Objectives of Scheduling Computations • To determine the acceptable start and end dates for each activity. • These computations can also be used to determine project duration and the critical path. • To provide a basis for developing a project schedule EJR 2006

  10. Steps in Scheduling Computations • Set up a network diagram • Working from left to right (LR), compute ES and EF for each activity. • Project duration = EF for last activity. • Working from right to left (RL), compute LF and LS in that order for each activity. • For each activity, compute slack = LF – EF = LS – ES • The critical path is the set of activities with zero slack. EJR 2006

  11. Computing ES and EF • Work from left to right (LR) • For first activity, ES = 0 • For all other activities, ES = Largest {EF for immediately preceding activities} • For all activities, EF = ES + activity time (inside the circle or box) EJR 2006

  12. Computing LF and LS • Work from right to left (RL) • For last activity, LF = EF • For all other activities, LF = smallest {LS for immediately following activities} • For all activities, LS = LF – activity time EJR 2006

  13. Slack and the Critical Path • Slack tells us how much flexibility we have in scheduling each activity • slack = LF – EF = LS – ES • The critical path is the set of activities with zero slack. EJR 2006

  14. ES and LS Schedules • In an early start (ES) schedule, each activity begins at time ES and ends at time EF • In a late start (LS) schedule, each activity begins at time LS and ends at time LF • Other schedules may be possible. For all activities, we must have ES < start time < LS • The activity must start between ES and LS (inclusive) EJR 2006

More Related