Software Project Planning and Estimation Techniques

Software Project Planning and Estimation Techniques

Activities and Precedents

  • Activity Identification and Duration:     * A: Hardware selection - Duration: 66 weeks. Precedents: None.     * B: System configuration - Duration: 44 weeks. Precedents: None.     * C: Instal hardware - Duration: 33 weeks. Precedents: A.     * D: Data migration - Duration: 44 weeks. Precedents: B.     * E: Draft office procedures - Duration: 33 weeks. Precedents: B.     * F: Recruit staff - Duration: 1010 weeks. Precedents: None.     * G: User training - Duration: 33 weeks. Precedents: E, F.     * H: Instal and test system - Duration: 22 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 11 through 1313).     * 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 (75%75\% 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:     * Float=Late Finish−Early Finish\text{Float} = \text{Late Finish} - \text{Early Finish}     * Float=Late Start−Early Start\text{Float} = \text{Late Start} - \text{Early Start}
  • 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 (ESES) and Early Finish (EFEF) times.     6. Backward Pass: Identify the Late Start (LSLS) and Late Finish (LFLF) 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 (Slack=0\text{Slack} = 0).

Detailed CPM Example 1

  • Data Set:     * A: Duration 77, Predecessor: None.     * B: Duration 33, Predecessor: None.     * C: Duration 66, Predecessor: A.     * D: Duration 33, Predecessor: B.     * E: Duration 33, Predecessor: D, F.     * F: Duration 22, Predecessor: B.     * G: Duration 33, Predecessor: C.     * H: Duration 22, Predecessor: E, G.

  • Calculation Results:     * A: Start 00, Finish 77. (LS 00, LF 77). Slack = 00.     * B: Start 00, Finish 33. (LS 77, LF 1010). Slack = 77.     * C: Start 77, Finish 1313. (LS 77, LF 1313). Slack = 00.     * G: Start 1313, Finish 1616. (LS 1313, LF 1616). Slack = 00.     * H: Start 1616, Finish 1818. (LS 1616, LF 1818). Slack = 00.     * D: Start 33, Finish 66. (LS 1010, LF 1313). Slack = 77.     * E: Start 66, Finish 99. (LS 1313, LF 1616). Slack = 77.     * F: Start 33, Finish 55. (LS 1111, LF 1313). Slack = 88.

Detailed CPM Example 2 (Numerical Table)

  • Task Data:     * A: Time 1212, Predecessor -.     * B: Time 33, Predecessor -.     * C: Time 1414, Predecessor -.     * D: Time 44, Predecessor A, B.     * E: Time 1717, Predecessor B.     * F: Time 33, Predecessor C.     * G: Time 66, Predecessor D.     * H: Time 22, Predecessor D.     * I: Time 55, Predecessor E, F.     * J: Time 11, Predecessor F.

  • Calculating Start and Finish Times:     * Finish=Start+Time−1\text{Finish} = \text{Start} + \text{Time} - 1

  • Task Analysis (ES, EF, LS, LF, Slack):     * A: ES 11, EF 1212, LS 44, LF 1515. Slack = 33.     * B: ES 11, EF 33, LS 11, LF 33. Slack = 00 (Critical).     * C: ES 11, EF 1414, LS 44, LF 1717. Slack = 33.     * D: ES 1313, EF 1616, LS 1616, LF 1919. Slack = 33.     * E: ES 44, EF 2020, LS 44, LF 2020. Slack = 00 (Critical).     * F: ES 1515, EF 1717, LS 1818, LF 2020. Slack = 33.     * G: ES 1717, EF 2222, LS 2020, LF 2525. Slack = 33.     * H: ES 1717, EF 1818, LS 2424, LF 2525. Slack = 77.     * I: ES 2121, EF 2525, LS 2121, LF 2525. Slack = 00 (Critical).     * J: ES 1818, EF 1818, LS 2525, LF 2525. Slack = 77.

  • Final Decision: Slack = 00 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 00, EF 66.     * B (4w): ES 00, EF 44.     * F (10w): ES 00, EF 1010.     * C (3w): Precedent A. ES 66, EF 99.     * D (4w): Precedent B. ES 44, EF 88.     * E (3w): Precedent B. ES 44, EF 77.     * G (3w): Precedent E, F. EF of F (1010) is greater than E (77), so ES for G is 1010. EF 1313.

  • Backward Pass Phase:     * G (3w): LF 1313, LS 1010.     * F (10w): LF 1010, LS 00.     * H (2w): LF 1313, LS 1111.     * C (3w): LF 1111, LS 88.     * A (6w): LF 88, LS 22.     * D (4w): LF 1111, LS 77.     * E (3w): LF 1010, LS 77.     * B (4w): Successors D (LS 77) and E (LS 77). LF for B is 77, LS is 33.

  • Identification of Slack and Critical Path:     * Task A: Slack = 22     * Task B: Slack = 33     * Task C: Slack = 22     * Task D: Slack = 33     * Task E: Slack = 33     * Task F: Slack = 0     * Task G: Slack = 0     * Task H: Slack = 22     * Critical Path: F - G (Duration: 1313 weeks).