P374 - Project Management (ch.4)

Foundations of Project Management

  • Project Definition:

    • A project is defined as a series of related jobs directed toward some major, non-routine output.

    • It requires a significant period of time to perform.

    • It frequently demands significant capital investment.

  • Project Management Definition:

    • The discipline of planning, directing, and controlling resources (including people, equipment, and material) to meet the technical, cost, and time constraints of a project.

  • Organizational Importance:

    • At the highest levels of an organization, management regularly involves overseeing and balancing a portfolio of diverse projects rather than managing repetitive, day-to-day operations alone.

Organizational Structures for Project Management

  • Categorization of Project Structures:

    • Projects within organizations are fundamentally structured in one of three organizational forms: Pure Project, Functional Project, or Matrix Project.

  • Pure Project Structure:

    • Core Concept: A self-contained team works full-time on the project under direct project management.

    • Advantages:

    • The project manager possesses full and direct authority over the project.

    • Team members report to one single boss, avoiding conflicting directives.

    • Communication lines are shortened, accelerating decision-making.

    • Team pride, motivation, and organizational commitment remain exceptionally high.

    • Disadvantages:

    • Duplication of resources across multiple projects within the parent organization.

    • Broader organizational goals and policies can easily be ignored due to project-level insularity.

    • Lack of technology and knowledge transfer across project teams.

    • Team members have no functional area "home" (resulting in post-project job insecurity).

  • Functional Project Structure:

    • Core Concept: Responsibility for the project is embedded entirely within a single functional area (e.g., Engineering, R&D, Manufacturing). Employees from that functional division work on the project, typically on a part-time basis while retaining their regular duties.

  

Functional Project Organizational Structure

  • Organizational Alignment:

    • The President oversees core departments: Research and Development, Engineering, and Manufacturing.

    • Specific projects reside strictly within their host function: Research and Development hosts Project A, Project B, and Project C; Engineering hosts Project D, Project E, and Project F; Manufacturing hosts Project G, Project H, and Project I.

  • Advantages:

    • Team members can work on multiple projects simultaneously.

    • Technical expertise is preserved and developed within the functional department.

    • The functional area provides a permanent "home" for employees once the project is finished.

    • Maintains a critical mass of specialized knowledge within each department.

  • Disadvantages:

    • Project aspects not directly tied to the host functional area often get short-changed or deprioritized.

    • Motivation of team members is often weak because project work is viewed as secondary to primary functional duties.

    • Needs of the external or internal client become secondary, resulting in slow responses.

    • Matrix Project Structure:

  • Core Concept: A hybrid blend of pure and functional structures. Personnel from various functional disciplines are assigned to work on the project, often on a part-time basis, while remaining tied to their functional departments.

  

Matrix Project Organizational Structure

  • Organizational Alignment:

    • The President oversees vertical functional departments: Research and Development, Engineering, Manufacturing, and Marketing.

    • Horizontal project lines intersect these vertical silos: Manager Project A, Manager Project B, and Manager Project C draw personnel directly across functional divisions.

  • Advantages:

    • Facilitates enhanced communication and cross-pollination between different functional areas.

    • A designated project manager is held directly accountable for overall project success.

    • Resource duplication across the parent firm is minimized.

    • Team members maintain a secure functional "home" for career progression.

    • Parent organization policies, standards, and strategic objectives are consistently followed.

  • Disadvantages:

    • Team members face a dual-command structure ("too many bosses"), answering to both a functional department head and a project manager.

    • Project success relies heavily on the project manager\'s political and negotiating skills to secure departmental resources.

    • Risk of sub-optimization, where individual functional heads prioritize their departmental metrics over overall project optimization.

Project Definition and Work Breakdown Structure (WBS)

  • Key Project Management Terminology:

    • Statement of Work (SOW): A formal written description detailing the overarching objectives to be achieved by the project.

    • Task: A further subdivision of an overall project; typically shorter than several months in duration and performed by a single group or organization.

    • Work Package: A set of activities combined so that they can be assigned to a single organizational unit.

    • Project Milestone: Specific, identifiable milestone events that mark meaningful progress in the life of the project.

    • Work Breakdown Structure (WBS): A structural framework defining the comprehensive hierarchy of project tasks, subtasks, and work packages.

    • Activities: Discrete pieces of work that consume time.

    • Gantt Chart: A graphical scheduling display illustrating the amount of time required and the sequence in which activities can be performed.

  • Hierarchical Levels of a Work Breakdown Structure:

  

Work Breakdown Structure Hierarchy

  • Program Level: High-level strategic umbrella program.

  • Level 1 (Project): Subdivided into distinct projects (e.g., Project 1, Project 2).

  • Level 2 (Task): Subdivided into discrete project tasks (e.g., Task 1.1, Task 1.2).

  • Level 3 (Subtask): Detailed breakdown into subtasks (e.g., Subtask 1.1.1, Subtask 1.1.2).

  • Level 4 (Work Package): Actionable work packages assignable to functional teams (e.g., Work package 1.1.1.1, Work package 1.1.1.2).

    • Indented/Tabular WBS Example — Large Optical Scanner Design:

  

Alternate Format Work Breakdown Structure for Large Optical Scanner Design

  • Level 1:

    • 1 Optical simulator design

  • Level 2:

    • 1.1 Optical design

    • 1.2 System performance analysis

    • 1.3 System integration

    • 1.4 Cost analysis

    • 1.5 Management

    • 1.6 Long lead item procurement

  • Level 3:

    • Under 1.1 (Optical design):

      • 1.1.1 Telescope design/fab

      • 1.1.2 Telescope/simulator optical interface

      • 1.1.3 Simulator zoom system design

      • 1.1.4 Ancillary simulator optical component specification

    • Under 1.2 (System performance analysis):

      • 1.2.1 Overall system firmware and software control

      • 1.2.2 Far beam analyzer

      • 1.2.3 System inter- and intra-alignment method design

      • 1.2.4 Data recording and reduction requirements

    • Under 1.4 (Cost analysis):

      • 1.4.1 Cost/system schedule analysis

      • 1.4.2 Cost/system performance analysis

    • Under 1.5 (Management):

      • 1.5.1 System design/engineering management

      • 1.5.2 Program management

    • Under 1.6 (Long lead item procurement):

      • 1.6.1 Large optics

      • 1.6.2 Target components

      • 1.6.3 Detectors

  • Level 4:

    • Under 1.2.1 (Overall system firmware and software control):

      • 1.2.1.1 Logic flow diagram generation and analysis

      • 1.2.1.2 Basic control algorithm design

Network-Planning Models and the Critical Path Method (CPM)

  • Network Principles:

    • A project is organized as a sequence of activities connected in a network representation.

    • The path taking the longest time through this activity network is the critical path.

    • The critical path dictates the shortest possible time in which the entire project can be completed.

    • Any delay along an activity on the critical path causes an equivalent delay to the final completion date of the project.

    • The Critical Path Method (CPM) provides detailed scheduling information (start dates, completion dates, and available slack) critical for tracking and controlling execution.

  • Four-Step CPM Procedure:

    1. Identify each activity to be done and estimate how long each will take.

    2. Determine the required sequence of predecessor/successor relationships and construct a network diagram.

    3. Determine the critical path through the network.

    4. Determine the early start/finish schedule and the late start/finish schedule for every activity.

Calculating Activity Schedules and Slack in CPM

  • Activity Node Precedence Format:

  

Precedence Diagram Format for an Individual Activity

  • Top Left: Earliest Start (ESES)

  • Top Right: Earliest Finish (EFEF)

  • Center Circle: Activity identifier and duration, denoted as Activity (duration)

  • Bottom Left: Latest Start (LSLS)

  • Bottom Right: Latest Finish (LFLF)

    • Scheduling Equations and Computational Logic:

  • Earliest Start Time (ESES):

    • The earliest possible time an activity can begin, assuming all prior predecessors finish as early as possible.

    • Computed as the maximum (latest) Earliest Finish (EFEF) among all immediate predecessor activities:       ES=max⁡(EF of all immediate predecessors)ES = \max(\text{EF of all immediate predecessors})

    • Rule: If a project contains more than one initial activity with no predecessors, set ES=0ES = 0 for all of them.

  • Earliest Finish Time (EFEF):

    • The earliest possible completion time for the activity:       EF=ES+DurationEF = ES + \text{Duration}

  • Latest Finish Time (LFLF):

    • The latest time an activity can finish without delaying the overall project completion deadline.

    • Computed in a backward pass as the minimum (earliest) Latest Start (LSLS) among all immediate successor activities:       LF=min⁡(LS of all immediate successors)LF = \min(\text{LS of all immediate successors})

    • Rule: For ending activities, initialize LFLF equal to the project\'s overall completion time (the maximum EFEF among terminal activities).

  • Latest Start Time (LSLS):

    • The latest point in time an activity can commence without postponing final project completion:       LS=LF−DurationLS = LF - \text{Duration}

  • Slack Time (Float):

    • The allowable delay time an activity can experience without delaying the project\'s finish date:       Slack=LS−ES\text{Slack} = LS - ES       Slack=LF−EF\text{Slack} = LF - EF

    • Any activity where Slack=0\text{Slack} = 0 lies on the critical path.

    • Walkthrough of a Simple 4-Node Activity Network:

  • Network Layout:

    • Activity AA has a duration of 11 week.

    • Activity BB has a duration of 22 weeks; predecessor is AA.

    • Activity CC has a duration of 11 week; predecessor is AA.

    • Activity DD has a duration of 11 week; predecessors are BB and CC.

    

Simple CPM Network Diagram

  • Forward Pass Execution (Left to Right):

    

Forward Pass Calculation on Simple CPM Network
* For Activity AA: Starts at ES=0ES = 0. Finish time is EF=0+1=1EF = 0 + 1 = 1.
* For Activity BB: Predecessor is AA. Starts at ES=1ES = 1. Finish time is EF=1+2=3EF = 1 + 2 = 3.
* For Activity CC: Predecessor is AA. Starts at ES=1ES = 1. Finish time is EF=1+1=2EF = 1 + 1 = 2.
* For Activity DD: Predecessors are BB (EF=3EF = 3) and CC (EF=2EF = 2). Activity DD cannot start until both are complete. Therefore, ES=max⁡(3,2)=3ES = \max(3, 2) = 3. Finish time is EF=3+1=4EF = 3 + 1 = 4.
* The earliest project completion time is 44 weeks.

  • Backward Pass Execution (Right to Left):

    

Backward Pass Calculation on Simple CPM Network
* Set the terminal activity DD\'s late finish equal to its early finish: LFD=4LF_D = 4.
* For Activity DD: LSD=LFD−Duration=4−1=3LS_D = LF_D - \text{Duration} = 4 - 1 = 3.
* For Activity BB: Successor is DD. Therefore, LFB=LSD=3LF_B = LS_D = 3. Late start is LSB=3−2=1LS_B = 3 - 2 = 1.
* For Activity CC: Successor is DD. Therefore, LFC=LSD=3LF_C = LS_D = 3. Late start is LSC=3−1=2LS_C = 3 - 1 = 2.
* For Activity AA: Successors are BB (LS=1LS = 1) and CC (LS=2LS = 2). While CC could wait until week 2, BB must start by week 1. Thus, LFA=min⁡(1,2)=1LF_A = \min(1, 2) = 1. Late start is LSA=1−1=0LS_A = 1 - 1 = 0.

  • Slack Analysis:

    • Activity AA: LS−ES=0−0=0LS - ES = 0 - 0 = 0 (Critical)

    • Activity BB: LS−ES=1−1=0LS - ES = 1 - 1 = 0 (Critical)

    • Activity CC: LS−ES=2−1=1LS - ES = 2 - 1 = 1 week of slack

    • Activity DD: LS−ES=3−3=0LS - ES = 3 - 3 = 0 (Critical)

    • Critical Path: A→B→DA \rightarrow B \rightarrow D with total length of 44 weeks.

Comprehensive CPM Network Scheduling Example

  • Activity Designations, Precedences, and Durations (Example 4.2):

  | Activity | Designation | Immediate Predecessors | Time (Weeks) |   | :--- | :--- | :--- | :--- |   | Design | AA | — | 2121 |   | Build prototype | BB | AA | 55 |   | Evaluate equipment | CC | AA | 77 |   | Test prototype | DD | BB | 22 |   | Write equipment report | EE | C,DC, D | 55 |   | Write methods report | FF | C,DC, D | 88 |   | Write final report | GG | E,FE, F | 22 |

  • Schedule Network and Critical Path Determination (Example 4.21):

  

Full CPM Schedule Network with Multiple Critical Paths

  • Step-by-step Activity Times:

    • Activity A(21)A(21):

      • ES=0ES = 0, EF=0+21=21EF = 0 + 21 = 21

      • LF=21LF = 21, LS=21−21=0LS = 21 - 21 = 0

      • Slack=0−0=0\text{Slack} = 0 - 0 = 0

    • Activity B(5)B(5):

      • ES=21ES = 21, EF=21+5=26EF = 21 + 5 = 26

      • LF=26LF = 26, LS=26−5=21LS = 26 - 5 = 21

      • Slack=21−21=0\text{Slack} = 21 - 21 = 0

    • Activity C(7)C(7):

      • ES=21ES = 21, EF=21+7=28EF = 21 + 7 = 28

      • LF=28LF = 28, LS=28−7=21LS = 28 - 7 = 21

      • Slack=21−21=0\text{Slack} = 21 - 21 = 0

    • Activity D(2)D(2):

      • ES=26ES = 26, EF=26+2=28EF = 26 + 2 = 28

      • LF=28LF = 28, LS=28−2=26LS = 28 - 2 = 26

      • Slack=26−26=0\text{Slack} = 26 - 26 = 0

    • Activity E(5)E(5):

      • Predecessors are C(EF=28)C(EF=28) and D(EF=28)D(EF=28).

      • ES=max⁡(28,28)=28ES = \max(28, 28) = 28, EF=28+5=33EF = 28 + 5 = 33

      • Successor is G(LS=36)G(LS=36). Thus, LF=36LF = 36, LS=36−5=31LS = 36 - 5 = 31

      • Slack=31−28=3\text{Slack} = 31 - 28 = 3 weeks

    • Activity F(8)F(8):

      • Predecessors are C(EF=28)C(EF=28) and D(EF=28)D(EF=28).

      • ES=max⁡(28,28)=28ES = \max(28, 28) = 28, EF=28+8=36EF = 28 + 8 = 36

      • Successor is G(LS=36)G(LS=36). Thus, LF=36LF = 36, LS=36−8=28LS = 36 - 8 = 28

      • Slack=28−28=0\text{Slack} = 28 - 28 = 0

    • Activity G(2)G(2):

      • Predecessors are E(EF=33)E(EF=33) and F(EF=36)F(EF=36).

      • ES=max⁡(33,36)=36ES = \max(33, 36) = 36, EF=36+2=38EF = 36 + 2 = 38

      • LF=38LF = 38, LS=38−2=36LS = 38 - 2 = 36

      • Slack=36−36=0\text{Slack} = 36 - 36 = 0

  • Outcome:

    • The overall project duration is 3838 weeks.

    • The network possesses two concurrent critical paths:

      • Critical Path 1: A→C→F→GA \rightarrow C \rightarrow F \rightarrow G (21+7+8+2=3821 + 7 + 8 + 2 = 38 weeks)

      • Critical Path 2: A→B→D→F→GA \rightarrow B \rightarrow D \rightarrow F \rightarrow G (21+5+2+8+2=3821 + 5 + 2 + 8 + 2 = 38 weeks)

    • Non-critical paths through Activity EE contain 33 weeks of slack:

      • Path A→C→E→GA \rightarrow C \rightarrow E \rightarrow G (21+7+5+2=3521 + 7 + 5 + 2 = 35 weeks)

      • Path A→B→D→E→GA \rightarrow B \rightarrow D \rightarrow E \rightarrow G (21+5+2+5+2=3521 + 5 + 2 + 5 + 2 = 35 weeks)

CPM with Activity Time Estimates and PERT

  • Variability in Activity Durations:

    • Single deterministic time estimates can prove unreliable when activity execution is subject to technical uncertainty or environmental variance.

  • The Three-Time-Estimate Approach:

    • Evaluates three specific time estimates for each activity:

    1. Minimum time (Optimistic): The shortest time in which an activity can be completed assuming ideal conditions.

    2. Maximum time (Pessimistic): The longest completion time assuming unfavorable obstacles occur.

    3. Most likely time: The realistic modal estimate expected under normal working conditions.

  • Statistical Framework:

    • Weighting these estimates enables project managers to compute a probability distribution for the completion time of the entire project.

    • This probabilistic three-estimate model forms the core distinguishing characteristic of the Program Evaluation and Review Technique (PERT).

Time-Cost Models and Project Crashing

  • Principles of Time-Cost Trade-Offs:

    • A time-cost model extends the CPM framework to analyze the explicit economic trade-off between the duration of an activity and total project costs.

    • Considers direct activity expenditures (overtime, extra shifts, additional tools), indirect overhead costs (supervision, facilities, penalties), and completion deadlines.

    • The act of reducing the duration of project activities by committing additional resources is defined as crashing.

  • Five Steps of the Crashing Procedure:

    1. Prepare a CPM network diagram complete with normal and crash cost/time parameters.

    2. Determine the cost per unit of time to expedite each individual activity.

    3. Compute the initial critical path.

    4. Shorten activities on the critical path at the point where expediting costs are lowest.

    5. Plot direct, indirect, and total project cost curves to identify the optimal minimum-cost schedule.

  • Formula for Crash Cost per Unit Time:   Cost per unit time=CC−NCNT−CT\text{Cost per unit time} = \frac{CC - NC}{NT - CT}

    • Where:

    • CCCC = Crash cost (total cost to complete activity under maximum compression)

    • NCNC = Normal cost (baseline cost under standard duration)

    • NTNT = Normal time (baseline unexpedited duration)

    • CTCT = Crash time (minimum achievable duration with added resources)

    • (CC−NC)(CC - NC) represents total additional direct expense required to crash.

    • (NT−CT)(NT - CT) represents the maximum number of days/weeks the activity can be shortened.

  • Comprehensive Crashing Example (Example 4.4):

  

Project Crashing Activity Parameters, Cost Slopes, and Critical Path

  • Activity Baseline Data and Calculated Cost Slopes:

    • Activity AA: NT=2NT = 2, CT=1CT = 1, NC=$6NC = \$6, CC=$10CC = \$10

      • Additional cost: CC−NC=$10−$6=$4CC - NC = \$10 - \$6 = \$4

      • Available reduction: NT−CT=2−1=1NT - CT = 2 - 1 = 1 day

      • Crash cost slope: $10−$62−1=$4\frac{\$10 - \$6}{2 - 1} = \$4 per day

    • Activity BB: NT=5NT = 5, CT=2CT = 2, NC=$9NC = \$9, CC=$18CC = \$18

      • Additional cost: CC−NC=$18−$9=$9CC - NC = \$18 - \$9 = \$9

      • Available reduction: NT−CT=5−2=3NT - CT = 5 - 2 = 3 days

      • Crash cost slope: $18−$95−2=$3\frac{\$18 - \$9}{5 - 2} = \$3 per day

    • Activity CC: NT=4NT = 4, CT=3CT = 3, NC=$6NC = \$6, CC=$8CC = \$8

      • Additional cost: CC−NC=$8−$6=$2CC - NC = \$8 - \$6 = \$2

      • Available reduction: NT−CT=4−3=1NT - CT = 4 - 3 = 1 day

      • Crash cost slope: $8−$64−3=$2\frac{\$8 - \$6}{4 - 3} = \$2 per day

    • Activity DD: NT=3NT = 3, CT=1CT = 1, NC=$5NC = \$5, CC=$9CC = \$9

      • Additional cost: CC−NC=$9−$5=$4CC - NC = \$9 - \$5 = \$4

      • Available reduction: NT−CT=3−1=2NT - CT = 3 - 1 = 2 days

      • Crash cost slope: $9−$53−1=$2\frac{\$9 - \$5}{3 - 1} = \$2 per day

    • Step-by-Step Project Crashing Schedule Iterations:

  | Current Critical Path(s) | Remaining Days Activity May Be Shortened | Cost per Day to Expedite Each Activity | Least-Cost Activity to Expedite | Total Cost of All Activities in Network | Project Completion Time |   | :--- | :--- | :--- | :--- | :--- | :--- |   | ABD | Baseline normal conditions | — | — | $26\$26 | 1010 days |   | ABD | A–1, B–3, D–2 | A–$4\$4, B–$3\$3, D–$2\$2 | D | $28\$28 | 99 days |   | ABD | A–1, B–3, D–1 | A–$4\$4, B–$3\$3, D–$2\$2 | D | $30\$30 | 88 days |   | ABD | A–1, B–3 | A–$4\$4, B–$3\$3 | B | $33\$33 | 77 days |   | ABD, ACD | A–1, B–2, C–1 | A–$4\$4, B–$3\$3, C–$2\$2 | A* | $37\$37 | 66 days |   | ABD, ACD | B–2, C–1 | B–$3\$3, C–$2\$2 | B & C† | $42\$42 | 55 days |   | ABD, ACD | B–1 | B–$3\$3 | B‡ | $45\$45 | 55 days |

  • Detailed Analysis of Crashing Decisions:

    • Normal Schedule (1010 days): Baseline critical path is ABDABD (2+5+3=102 + 5 + 3 = 10 days). Total direct cost = $6+$9+$6+$5=$26\$6 + \$9 + \$6 + \$5 = \$26.

    • Iteration 1 (10→910 \rightarrow 9 days): On critical path ABDABD, candidate costs are A($4)A(\$4), B($3)B(\$3), and D($2)D(\$2). Shorten Activity DD by 11 day at $2\$2. Project time = 99 days, Total cost = $26+$2=$28\$26 + \$2 = \$28.

    • Iteration 2 (9→89 \rightarrow 8 days): Critical path remains ABDABD. Shorten Activity DD by its final available day at $2\$2. Project time = 88 days, Total cost = $28+$2=$30\$28 + \$2 = \$30. (Activity DD is now at its minimum limit and cannot be reduced further).

    • Iteration 3 (8→78 \rightarrow 7 days): Critical path remains ABDABD. Candidates are A($4)A(\$4) and B($3)B(\$3). Shorten Activity BB by 11 day at $3\$3. Project time = 77 days, Total cost = $30+$3=$33\$30 + \$3 = \$33. Both paths are now tied: ABD=2+4+1=7ABD = 2 + 4 + 1 = 7 days and ACD=2+4+1=7ACD = 2 + 4 + 1 = 7 days.

    • Iteration 4 (7→67 \rightarrow 6 days): Because both ABDABD and ACDACD are critical, any time reduction requires shortening both paths simultaneously:

      • Option 1: Shorten Activity AA (shared by both paths) at $4\$4 per day.

      • Option 2: Shorten Activity BB (on path ABDABD at $3\$3) AND Activity CC (on path ACDACD at $2\$2) for a combined cost of $3+$2=$5\$3 + \$2 = \$5 per day.

      • Decision (): Shorten shared Activity AA by 11 day at $4\$4. Project time = 66 days, Total cost = $33+$4=$37\$33 + \$4 = \$37. (Activity AA is now fully crashed*).

    • Iteration 5 (6→56 \rightarrow 5 days): Candidate on path ABDABD is B($3)B(\$3); candidate on path ACDACD is C($2)C(\$2). Shorten both (†): Activity BB by 11 day and Activity CC by 11 day. Combined expediting cost = $3+$2=$5\$3 + \$2 = \$5. Project time = 55 days, Total cost = $37+$5=$42\$37 + \$5 = \$42. (The project has reached its absolute minimum duration of 5 days, because path ACD cannot be reduced further).

    • Iteration 6 (Sub-optimal crash): Shortening Activity BB by an additional day costs $3\$3, pushing total cost to $45\$45, but project completion time remains stuck at 55 days because path ACDACD cannot compress further.

  • Software Resource: Excel spreadsheet templates for project crashing can be referenced at www.mhhe.com/jacobs14e.

Resource Management and Leveling

  • Resource Assignment:

    • Project scheduling involves not only allocating tasks across chronological time but also assigning required physical and human resources (personnel, specialty machinery, work suites) to each specific task.

  • Over-Allocation:

    • Occurs whenever the planned demand for a given resource exceeds the available physical supply during a specific time block.

    • Identified through project management tracking software.

  • Remediation Strategies:

    • Procuring additional resources (e.g., subcontracting, hiring, equipment leasing).

    • Rescheduling tasks within available constraints.

    • Taking advantage of non-critical task slack to postpone tasks until assigned resources become free, preventing project completion delay.

  • Automated Resource Leveling:

    • Advanced software tools resolve resource conflicts by applying algorithmic heuristics:

    • Delaying lower-priority tasks until higher-priority tasks release needed resources.

    • Relaxing deadline constraints (permitting the project completion date to extend past the original deadline when fixed resource capacities cannot be breached).

Project Control Charts and Tracking Reports

  • Function of Control Charts:

    • Visual management instruments that convey real-time performance against baseline expectations, highlighting variance across time, costs, and departmental workloads.

  • Gantt Charts:

  

Gantt Chart for Single Activities

  • Displays activity sequence, duration, and calendar execution in horizontal bar format against the timeline (weeks after start of project):

    • Contract negotiated: Weeks 00 to 11

    • Contract signed: Weeks 11 to 22

    • Long lead procurement: Weeks 22 to 77

    • Manufacturing schedules: Weeks 22 to 44

    • Bill of materials: Weeks 77 to 99

    • Short lead procurement: Weeks 99 to 1111

    • Material specifications: Weeks 1111 to 1414

    • Manufacturing plans: Weeks 1414 to 1717

    • Start-up: Weeks 1717 to 1919

    • Bar / Milestone Charts:

  

Bar and Milestone Chart

  • Integrates activity execution windows with distinct milestone check-points.

  • Example: Short lead procurement running across weeks 99 through 1111 features three sequential milestone gates:

    1. Milestone 1: Purchasing order release

    2. Milestone 2: Invoices received

    3. Milestone 3: Material received

    • Total Program Cost Breakdown (Cumulative S-Curve):

  

Total Program Cost Breakdown S-Curve

  • Depicts cumulative program dollar expenditures across time via an S-curve.

  • Segmented into stacked component cost layers:

    • Labor \ (bottom foundational layer)

    • Material \ (middle component layer)

    • Overhead \ (top operational layer)

    • The uppermost boundary tracks cumulative Total \.

    • Cost and Performance Tracking Schedule:

  

Cost and Performance Tracking Schedule

  • Upper Panel (Gantt Schedule Tracking): Evaluates completed versus projected tasks for ongoing projects (Project 1, Project 2, Project 3) evaluated against a vertical tracking date line.

  • Lower Panel (Cost Tracking Curve): Plots Projected Cost curve versus Actual Cost curve.

  • Periods where actual expenditures surpass projected baselines illustrate cost overruns.

    • Divisional Breakdown of Costs and Labor Hours:

  

Divisional Breakdown of Costs and Labor Hours

  • Provides direct comparative analysis of divisional resource expenditure versus cost generation:

    • Manufacturing: Consumes 50%50\% of total labor hours; accounts for 40%40\% of total cost.

    • Finance: Consumes 15%15\% of total labor hours; accounts for 10%10\% of total cost.

    • Engineering: Consumes 10%10\% of total labor hours; accounts for 15%15\% of total cost.

    • Overhead: Consumes 20%20\% of total labor hours; accounts for 25%25\% of total cost.

    • Personnel: Consumes 5%5\% of total labor hours; accounts for 10%10\% of total cost.

Project Management Information Systems (PMIS)

  • Professional Organization:

    • The Project Management Institute (PMI) serves as the primary international professional body, maintaining standards, certifications, and resources at www.pmi.org.

  • Leading Commercial Software Platforms:

    • Microsoft Project: The industry standard for managing small to midsized projects, widely adopted due to user accessibility and built-in interactive online tutorials.

    • Primavera Project Planner: The primary enterprise-grade choice for managing massive industrial projects, megaprojects, and multi-project programs; recognized as the initial major commercial vendor in this space and offering high analytical and leveling capabilities.

  • Key Capabilities of Modern PMIS Software:

    • Automated task scheduling, dependency tracking, and dynamic critical path recalculation.

    • Advanced cross-project resource management, including assigning, loading, and scheduling back equipment and labor across parallel tasks.

    • Algorithmic resource leveling to resolve capacity bottlenecks according to user-defined priority rules.