1 / 12

Gantt and PERT charts

Gantt and PERT charts. Representing and Scheduling Project Plans. Gantt Charts Useful for depicting simple projects or parts of large projects Show start and completion dates for individual tasks PERT Charts PERT = Program Evaluation Review Technique

helen-pierce
Download Presentation

Gantt and PERT charts

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. Gantt and PERT charts

  2. Representing and Scheduling Project Plans • Gantt Charts • Useful for depicting simple projects or parts of large projects • Show start and completion dates for individual tasks • PERT Charts • PERT = Program Evaluation Review Technique • Show order of activities or dependencies between activities

  3. Figure 3-16Graphical diagrams that depict project plans (a) A Gantt Chart (b) A PERT chart

  4. Sample PERT Chart

  5. Gantt Visually shows duration of tasks Visually shows time overlap between tasks Visually shows slack time PERT Visually shows dependencies between tasks Visually shows which tasks can be done in parallel Shows slack time by data in rectangles Comparison of Gantt and PERT Charts

  6. Critical Path Analysis The PERT Algorithm By Example

  7. D A G C 3 2 5 7 2 4 2 E B F The Original Graph

  8. 3 2 D A G C 2 4 2 5 2 3 7 E B F Label all vertices without predecessors. (A & B) Red numbers are the new labels.

  9. 3 8 2 D A G C 7 3 2 2 4 2 5 E B F Label all vertices whose predecessors are all labeled. (C) Red numbers are the new labels. Blue labels are from previous steps.

  10. 12 3 8 10 2 15 D A G C 2 7 3 2 5 4 2 E B F Label all vertices whose predecessors are all labeled.(D, E, F) Red numbers are the new labels. Blue labels are from previous steps.

  11. 12 3 8 10 2 15 D A G C 4 3 2 2 7 2 5 E B F Label all vertices whose predecessors are all labeled.(G) 17 Red numbers are the new labels. Blue labels are from previous steps.

  12. 3 2 5 7 2 4 2 The largest number, 17, is the minimum amount of time needed to complete the task and ACFG is the critical path. D 12 A 3 G C E 8 17 10 B 2 F 15 Red arrows represent the critical path.

More Related