# 3/5/2009Computer systems1 Introduction Project management fundamentals: Initiating projects Determining project feasibility scheduling projects planning.

## Presentation on theme: "3/5/2009Computer systems1 Introduction Project management fundamentals: Initiating projects Determining project feasibility scheduling projects planning."— Presentation transcript:

3/5/2009Computer systems1 Introduction Project management fundamentals: Initiating projects Determining project feasibility scheduling projects planning managing activities

3/5/2009Computer systems2 Project Initiation n identifying problems n defining the problem n selecting projects

3/5/2009Computer systems3 Identifying Problems n Performance – errors, slow, incomplete n employee – absenteeism, dissatisfaction, tardiness n external feedback from: – vendors, customers, suppliers

3/5/2009Computer systems4 Determining Feasibility n Objectives – improvements n Resources – Technical – Economic – Operational

3/5/2009Computer systems5Scheduling n Time estimation – analysis – design – implementation n Methods – Gantt Chart – PERT (critical path) (Program Evaluation and Review Techniques) n Microsoft “Project”

3/5/2009Computer systems6 GANTT Chart Incomplete activity Completed activity Partially completed activity

3/5/2009Computer systems7 PERT Critical Path 10 30 20 4050 A, 4 B, 2 C, 5 D, 3 E, 6

3/5/2009Computer systems8 Listing form of PERT Predecessor (A) = {} means no predecessor for activity A Predecessor (B) = {} means no predecessor for activity B Predecessor (C) = {A} means the predecessor for C is A Predecessor (E) = {C, D} means the predecessors for E are C and D Predecessor (D) = {B} Duration (A) = 4 Duration (B) = 2 Duration (C) = 5 Duration (D) = 3 Duration (E) = 6 Activities: A, B, C, D, E

3/5/2009Computer systems9 PERT Diagram Cont. Activities: A, B, C, D, E Events: 10, 20, 30, 40, 50 P(A)={}, P(B)={}, P(C)=A, P(D)=B, P(E)={C, D} D(A)=4, D(B)=2, D(C)=5, D(D)=3, D(E)=6 10 30 20 4050 A, 4 B, 2 C, 5 D, 3 E, 6

3/5/2009Computer systems10 PERT Example Activities: A, B, C, D, E, F, G P(A)={}, P(B)={}, P(C)=A, P(D)=P(E)={B} P(F)= P(G)={C, D}, P(H)={G, E} D(A)=4, D(B)=3, D(C)=4, D(D)=3, D(E)=5 D(F)=2, D(G)=7, D(H)=4

3/5/2009Computer systems11 PERT Example Cont. a F, 2 10 30 20 40 50 A, 4 B, 3 C, 4 D, 3 E, 5 45 G, 7 H, 4

3/5/2009Computer systems12 Agile Approach Also called: Agile development Agile methods Alternative way to develop systems

3/5/2009Computer systems13 Resource Trade-Offs Resource control variables: n Time – finishing on time – 80/20 rule 80% satisfied with 20% of the functionality n Cost n Quality

3/5/2009Computer systems14 Agile Practices Core Agile Practices: Short release 40-hour work week Onsite customer Pair programming

3/5/2009Computer systems15 Risk Handling Risk handling in Agile Approach: Resource Quality, Cost, Scope, Time Activities Designing, Testing, Coding, Listening QualityCostScopeTime DesigningListeningCodingTesting

3/5/2009Computer systems16 Development Process Development process for an agile project: Exploration Planning Iteration to the first release Production release Maintenance

Download ppt "3/5/2009Computer systems1 Introduction Project management fundamentals: Initiating projects Determining project feasibility scheduling projects planning."

Similar presentations