Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computer Engineering 203 R Smith Project Scheduling 12/2007 1 Scheduling Now we know how much work there is to do, when can it be done? What kind of schedule.

Similar presentations


Presentation on theme: "Computer Engineering 203 R Smith Project Scheduling 12/2007 1 Scheduling Now we know how much work there is to do, when can it be done? What kind of schedule."— Presentation transcript:

1 Computer Engineering 203 R Smith Project Scheduling 12/2007 1 Scheduling Now we know how much work there is to do, when can it be done? What kind of schedule are you doing? Breaking the work down Factors to consider Dependencies Critical Paths Tools

2 Computer Engineering 203 R Smith Project Scheduling 12/2007 2 Types of Schedules Shortest possible schedule – Use whatever resources are needed Resource constrained Most efficient schedule Most likely Fixed target – Adjusting the work to fit the time and resources

3 Computer Engineering 203 R Smith Project Scheduling 12/2007 3 Work Breakdown Structures Starting from the top down or the bottom up? – Advantages – Disadvantages Breaking down the big picture – Looking for dependencies between tasks

4 Computer Engineering 203 R Smith Project Scheduling 12/2007 4 Work Breakdown Structures How small to break down tasks? – Logically consistent – Measurable completion – Clearly defined Assigning resources

5 Computer Engineering 203 R Smith Project Scheduling 12/2007 5 Scheduling Factors to consider How many resources are available? Dependencies between tasks Contingencies Vacations, holidays, sick leave How much productive time in a day? – Meetings – Multiple projects – Interruptions

6 Computer Engineering 203 R Smith Project Scheduling 12/2007 6 Dependencies Lead times – Hiring – Completion of other work Dependency – On start – On completion Hard or soft dependency

7 Computer Engineering 203 R Smith Project Scheduling 12/2007 7 Scheduling Examples Research paper – Factors to consider Amount of work Other class work Other commitments Vacations – Factors to consider Dependencies on others Costs and availability

8 Computer Engineering 203 R Smith Project Scheduling 12/2007 8 Critical Path What is longest path? Can tasks be broken down further? Can multiple resources be assigned?

9 Computer Engineering 203 R Smith Project Scheduling 12/2007 9 Pert Charts Program Evaluation and Review Technique – Developed in the 50s for the Polaris missile project. Activity on the Node network – Predecessors, successors or parallel – Critical Path Analysis Activity estimates – Optimistic Time, 4xMost Likely Time, Pessimistic Time and then divide by 6

10 Computer Engineering 203 R Smith Project Scheduling 12/2007 10 Pert Charts Layers of detail – Large projects can not be fully shown by a single WBS/Pert The relationship between nodes is most often not cut and dry.

11 Computer Engineering 203 R Smith Project Scheduling 12/2007 11 What is needed for Critical Path Analysis? A work breakdown structure Dependencies between tasks Available resources

12 Computer Engineering 203 R Smith Project Scheduling 12/2007 12 Tools Tools assist the project manager in doing their job. Tools assist in communication. Tools assist in understanding. Tools assist in remembering.

13 Computer Engineering 203 R Smith Project Scheduling 12/2007 13 Tools What are some of the basic tools that will allow us to do a better job managing our projects? – Check lists – Basic Charts – Cause and effect diagrams – Pert Charts – Requirements tools

14 Computer Engineering 203 R Smith Project Scheduling 12/2007 14 Checklists Checklists are: – Common sense – Low tech, low overhead Used for: – Inspections – Testing – Phase entry/exit criteria – Common error list – Planning

15 Computer Engineering 203 R Smith Project Scheduling 12/2007 15 Basic Charts Pareto Diagrams – A ranked ordered histogram Histograms Scatter diagrams Control Charts – Statistical Process Control – Issues with direct correlations in Software Development

16 Computer Engineering 203 R Smith Project Scheduling 12/2007 16 Cause and Effect Diagrams Also known Root Cause Analysis or fish bone diagram Identify the issue Identify the main factors that cause the issue Identify detailed factors for each of the main factors Continue refining

17 Computer Engineering 203 R Smith Project Scheduling 12/2007 17 Requirements Tools Why is there a need for requirements tools – Keep all documents synchronized – Provide a communications tool – Define the links between requirements, testing, code, etc (Traceability Matrix) – Tracking status

18 Computer Engineering 203 R Smith Project Scheduling 12/2007 18 Requirements Tools There are two basic classes of tools – Database centric – Document centric

19 Computer Engineering 203 R Smith Project Scheduling 12/2007 19 Other Tools Estimating and Scheduling – COCOMO II, SLIM, CHECKPOINT – Need for accurate historical data Spreadsheets 4GLs, Delphi, Powerbuilder


Download ppt "Computer Engineering 203 R Smith Project Scheduling 12/2007 1 Scheduling Now we know how much work there is to do, when can it be done? What kind of schedule."

Similar presentations


Ads by Google