Software Project Planning and Estimation Techniques
Software Project Planning and Estimation Techniques
Activities and Precedents
- Activity Identification and Duration: * A: Hardware selection - Duration: weeks. Precedents: None. * B: System configuration - Duration: weeks. Precedents: None. * C: Instal hardware - Duration: weeks. Precedents: A. * D: Data migration - Duration: weeks. Precedents: B. * E: Draft office procedures - Duration: weeks. Precedents: B. * F: Recruit staff - Duration: weeks. Precedents: None. * G: User training - Duration: weeks. Precedents: E, F. * H: Instal and test system - Duration: weeks. Precedents: C, D.
Sequencing and Scheduling Activities
- Project Plan as a Bar Chart: * This visualization maps tasks to specific individuals over a timeline (Weeks through ). * Task/Person Assignments: * Andy: Task A (Overall design), Task B (Specify Module 1), Task C (Specify Module 2), Task D (Specify Module 3). * Bill: Task E (Code Module 1), Task F (Code Module 3). * Charlie: Task G (Code Module 2), Task H (Integration testing). * Dave: Task I (System testing). * Activity Key Details: * A: Overall design * B: Specify Module 1 * C: Specify Module 2 * D: Specify Module 3 * E: Code Module 1 * F: Code Module 3 * G: Code Module 2 * H: Integration testing * I: System testing
Gantt Charting
Building a House Example (Detailed Timeline): * Project Duration: Start 09/17/2010 to Due Date 03/25/2011. * Task Breakdown: * Find Plot of Land: 09/17/2010 - 10/09/2010 ( done). * Draw Plans: 10/01/2010 - 10/28/2010. * Survey Land: 10/03/2010 - 10/12/2010. * Hire Project Manager: 10/28/2010 - 10/31/2010. * Hire Contractor: 10/31/2010 - 11/02/2010. * Dig: 11/29/2010 - 12/31/2010. * Lay Foundation: 12/31/2010 - 01/16/2011. * Purchase Building Materials: 12/31/2010 - 01/28/2011. * Build Frame: 01/28/2011 - 02/14/2011. * Wire Electric: 02/14/2011 - 02/28/2011. * Install Drywall: 02/28/2011 - 03/07/2011. * Add Roof: 03/07/2011 - 03/15/2011. * Paint: 03/15/2011 - 03/25/2011.
Software Project Gantt Chart Example: * Sequence: 1. Project kick off 2. Gather Business Requirements 3. Develop the database 4. Develop the UI 5. Testing 6. Implementation 7. Customer Acceptance 8. Maintenance
Activity Float (Slack Time)
- Definition: The amount of time an activity can be delayed without delaying the overall project.
- Free Float: The amount of time a task can be delayed without delaying a successor task.
- Total Float: The amount of time a task can be delayed without delaying project completion.
- Calculation Formulas: * *
- Types of Float Time: * Positive: Most common scenario. * Negative: Occurs when lead time is required. * Zero: Applies to all activities on the Critical Path.
Critical Path Method (CPM)
- Core Concepts: * Nodes: Represent activities. * Arrows: Represent relationships (e.g., Activity A occurs before B). * Node Structure: * ES: Early Start * EF: Early Finish * LS: Late Start * LF: Late Finish
- CPM Process Steps: 1. Identify the activities. 2. Determine the sequence of activities. 3. Create a network diagram connecting activities via predecessor and successor tasks. 4. Enter the completion time for every activity on the nodes. 5. Forward Pass: Identify the Early Start () and Early Finish () times. 6. Backward Pass: Identify the Late Start () and Late Finish () times. 7. Identify float and the Critical Path.
- Critical Path Properties: * It is the earliest time the project can be completed. * It is the path with no slack or float ().
Detailed CPM Example 1
Data Set: * A: Duration , Predecessor: None. * B: Duration , Predecessor: None. * C: Duration , Predecessor: A. * D: Duration , Predecessor: B. * E: Duration , Predecessor: D, F. * F: Duration , Predecessor: B. * G: Duration , Predecessor: C. * H: Duration , Predecessor: E, G.
Calculation Results: * A: Start , Finish . (LS , LF ). Slack = . * B: Start , Finish . (LS , LF ). Slack = . * C: Start , Finish . (LS , LF ). Slack = . * G: Start , Finish . (LS , LF ). Slack = . * H: Start , Finish . (LS , LF ). Slack = . * D: Start , Finish . (LS , LF ). Slack = . * E: Start , Finish . (LS , LF ). Slack = . * F: Start , Finish . (LS , LF ). Slack = .
Detailed CPM Example 2 (Numerical Table)
Task Data: * A: Time , Predecessor -. * B: Time , Predecessor -. * C: Time , Predecessor -. * D: Time , Predecessor A, B. * E: Time , Predecessor B. * F: Time , Predecessor C. * G: Time , Predecessor D. * H: Time , Predecessor D. * I: Time , Predecessor E, F. * J: Time , Predecessor F.
Calculating Start and Finish Times: *
Task Analysis (ES, EF, LS, LF, Slack): * A: ES , EF , LS , LF . Slack = . * B: ES , EF , LS , LF . Slack = (Critical). * C: ES , EF , LS , LF . Slack = . * D: ES , EF , LS , LF . Slack = . * E: ES , EF , LS , LF . Slack = (Critical). * F: ES , EF , LS , LF . Slack = . * G: ES , EF , LS , LF . Slack = . * H: ES , EF , LS , LF . Slack = . * I: ES , EF , LS , LF . Slack = (Critical). * J: ES , EF , LS , LF . Slack = .
Final Decision: Slack = marks the Critical Path: B-E-I.
Critical Chain Method (CCM)
- Definition: A management technique that improves delivery reliability by focusing on resource constraints and using shared buffers rather than padding individual tasks.
- Modifications: Modifies the project schedule when resources are limited.
- Managing Uncertainty: Uses duration buffers (extra time). * Project Buffers: Extra time added to the absolute end of the project. * Feeding Buffers: Extra time added to the end of a specific non-critical activity chain where it merges into the critical path.
Resource Leveling and Schedule Compression
Resource Leveling: * Adjusting the schedule so resource demand does not exceed available supply. * Often results in delaying tasks or extending project duration. * May change the critical path. * Necessary if resources are over-allocated.
Schedule Compression: * Shortens the schedule without changing the scope. * Crashing: Shortening duration for least incremental cost (e.g., overtime, more resources, expedited delivery). * Fast Tracking: Doing activities in parallel (overlapping) instead of sequentially. Increases risk of rework.
Schedule Baseline and Formats
- Schedule Baseline: An approved version of the schedule used to compare planned vs. actual start and finish dates.
- Project Schedule Formats: * Tabular Form * Graphical Form * Milestone Schedule * Bar Charts (Gantt) * Network Diagrams
Comprehensive Final Exercise (Hardware/Software Project)
Forward Pass Phase: * A (6w): ES , EF . * B (4w): ES , EF . * F (10w): ES , EF . * C (3w): Precedent A. ES , EF . * D (4w): Precedent B. ES , EF . * E (3w): Precedent B. ES , EF . * G (3w): Precedent E, F. EF of F () is greater than E (), so ES for G is . EF .
Backward Pass Phase: * G (3w): LF , LS . * F (10w): LF , LS . * H (2w): LF , LS . * C (3w): LF , LS . * A (6w): LF , LS . * D (4w): LF , LS . * E (3w): LF , LS . * B (4w): Successors D (LS ) and E (LS ). LF for B is , LS is .
Identification of Slack and Critical Path: * Task A: Slack = * Task B: Slack = * Task C: Slack = * Task D: Slack = * Task E: Slack = * Task F: Slack = 0 * Task G: Slack = 0 * Task H: Slack = * Critical Path: F - G (Duration: weeks).