OPR311 Introduction To Operations Management

Introduction To Operations ManagementUnit 922 min read

Aggregate Planning & Forecasting: Strategies, Models & Real-World Trade-offs

Unit 9 of Introduction To Operations Management covers how businesses balance supply and demand over 3–18 months using aggregate planning techniques (chase, level, mixed), forecasting methods (qualitative/quantitative), and mathematical models (linear programming, transportation) to optimize costs, workforce, and inven

TAKEAWAYS:

  • Aggregate planning aligns production capacity (workforce, machines, subcontracting) with demand forecasts to minimize costs and stockouts—critical for seasonal businesses like NTC’s electricity generation or Pathao’s driver scheduling.
  • The three core strategies (chase, level, mixed) each trade off inventory costs vs. hiring/firing costs, and the best choice depends on product type, demand variability, and labor laws (e.g., Nepal’s labor market favors level strategies).
  • Forecasting (time-series, causal, Delphi) is 50% of aggregate planning—Daraz’s demand forecasting uses machine learning to predict order spikes during Dashain, while Nabil Bank forecasts loan demand using economic indicators.
  • Linear programming and transportation models solve aggregate planning problems mathematically (e.g., Nepal’s NEPSE uses optimization to allocate shares across brokers during high-volume trading days).
  • Graphical methods (like the linear decision rule) and simulation help visualize trade-offs—e.g., Khalti’s payment processing balances server capacity vs. customer wait times during festivals.
  • Exam focus: Define key terms (e.g., aggregate production plan, safety stock), compare strategies in tables, and solve numerical problems (e.g., calculate total cost for a chase vs. level strategy).

1. What is Aggregate Production Planning (APP)?

Aggregate production planning (APP) is a medium-term (3–18 months) tactical decision-making process that determines:

  • Production quantities (how much to make/sell).
  • Workforce levels (hire, fire, or use overtime).
  • Inventory policies (safety stock, backorders).
  • Subcontracting/outsourcing needs.

Why it matters: APP bridges the gap between long-term strategic plans (e.g., factory capacity) and short-term scheduling (daily production orders). Without APP, companies like Himalayan Java (coffee processing) would struggle to handle monsoon-season demand surges or NTC would face blackouts due to mismatched power generation.


Medium-term (3–18 months)Balances supply & demandDefinitionMinimize costsMeet demandStabilize workforceObjectivesDemand forecastCapacity constraintsInventory policiesInputsProduction planWorkforce planInventory planOutputsChase StrategyLevel StrategyMixed StrategyStrategiesLinear ProgrammingTransportation ModelSimulationToolsAggregate Production Planning (APP)
Hierarchical breakdown of APP components with real-world Nepalese examples (e.g., Himalayan Java, NTC).

2. Demand Forecasting: The Foundation of APP

Forecasting demand accurately is critical—poor forecasts lead to overproduction (wasted costs) or stockouts (lost sales). Common methods:

2079 BSDashain/Tihar(Peak Demand: +20%)2080 BSMonsoon (LowDemand: -15%)2081 BSJanai Purnima(Seasonal Surge: +10%)
Nepal’s seasonal demand cycles for APP forecasting (NTC/NMBL data).
Method Description Example in Nepal Pros Cons
Time-Series Uses historical data (trend, seasonality, cycles). NTC’s electricity demand forecast using past 5 years of monsoon vs. winter usage. Simple, data-driven. Ignores external factors.
Causal Models Relates demand to other variables (e.g., income, price, weather). Daraz’s sales correlated with festival dates (Dashain, Tihar) and GDP growth. Accounts for external factors. Requires good data quality.
Delphi Method Expert opinions iteratively refined. Nepal Rastra Bank’s inflation forecast using economist panels. Captures qualitative insights. Slow, subjective.
Machine Learning AI models (e.g., ARIMA, neural networks) for complex patterns. Khalti’s transaction volume prediction using user behavior and economic trends. High accuracy for dynamic data. Needs large datasets.


Worked Example: Forecasting for a Nepali Garment Exporter

Scenario: Himalayan Fashions exports shirts to Europe with seasonal demand:

  • Peak: 5,000 units/month (Oct–Dec).
  • Off-peak: 2,000 units/month (Jan–Sep).
  • Lead time: 2 months (ordering fabric from India).

Step 1: Identify Patterns

  • Trend: Slow growth (5% YoY).
  • Seasonality: 2.5x spike in winter.
  • Randomness: ±10% due to fashion trends.

Step 2: Choose Method

  • Use weighted moving average (for short-term) + linear regression (for trend).
  • Weights: 0.5 (current month), 0.3 (last month), 0.2 (2 months ago).

Step 3: Calculate Forecast

Month Actual Demand Forecast (Weighted MA) Error (%)
October 5,200 5,100 (0.5×5,000 + 0.3×4,800 + 0.2×4,500) +1.96
November 5,500 5,250 +4.76

Step 4: Adjust for Lead Time

  • Order fabric in August for October delivery based on November’s forecast.

3. Aggregate Planning Strategies

The choice of strategy depends on product type, demand variability, and costs. Nepal’s labor laws (e.g., difficulty firing workers) often favor level strategies, while chase strategies work for perishable goods like Himalayan Java’s coffee.

A. Chase Strategy

  • Definition: Adjust production exactly to demand (hire/fire workers, use overtime).
  • Best for: Custom products, low inventory costs, flexible workforce (e.g., freelance drivers for Pathao).
  • Costs:
    • High hiring/firing costs.
    • Low inventory holding costs.

Example: Kathmandu Traffic Police

  • Problem: Traffic congestion spikes during Dashain/Tihar (20% more vehicles).
  • Solution: Chase strategy—hire temporary traffic officers and deploy extra patrol vehicles for 2 months.
  • Cost: ₹50 lakhs (temporary staff) vs. ₹80 lakhs (building permanent infrastructure).

flowchart TD
    A["High Demand Period\n(Dashain)"] -->|"Hire"| B["Increase\nWorkforce"]
    B --> C["Meet Demand\nExactly"]
    C --> D["Low Demand Period\n(Monsoon)"] -->|"Fire"| E["Reduce\nWorkforce"]
    E -->|"Loop"| A

B. Level Strategy

  • Definition: Constant production rate + use inventory/backorders to absorb demand fluctuations.
  • Best for: Stable demand, high hiring costs (e.g., Nabil Bank’s loan processing).
  • Costs:
    • Low variable costs (no hiring/firing).
    • High inventory holding costs.

Example: Nabil Bank’s Loan Approvals

  • Problem: Loan demand varies by season (high in Chaitra–Baisakh, low in Bhadra–Aswin).
  • Solution: Level strategy—maintain a constant team of 50 loan officers + inventory of pre-approved loan templates.
  • Costs:
    • Inventory cost: ₹20 lakhs (storing templates, IT maintenance).
    • Hiring cost saved: ₹50 lakhs (avoiding seasonal layoffs).

C. Mixed Strategy

  • Definition: Combination of chase and level (e.g., use inventory for small fluctuations, hire for big spikes).
  • Best for: Most real-world scenarios (e.g., Daraz’s order fulfillment).

Example: Daraz’s Festival Sales

  • Demand: 3x spike during Dashain.
  • Strategy:
    1. Level production: Maintain 50% capacity year-round.
    2. Chase for spikes: Hire 1,000 temporary packers for 1 month.
    3. Inventory buffer: Stock 20% extra inventory before Dashain.

Cost Comparison:

Strategy Inventory Cost Hiring Cost Total Cost
Pure Chase Low High (₹80L) ₹80L
Pure Level High (₹60L) Low ₹60L
Mixed Medium (₹30L) Medium (₹40L) ₹70L

4. Mathematical Models in APP

A. Linear Programming (LP) for APP

Used to minimize costs while meeting demand constraints.

Example: NEPSE’s Share Allocation

  • Problem: NEPSE has 10,000 shares to allocate to 3 brokers (A, B, C) with different costs.
  • Constraints:
    • Broker A: max 4,000 shares (limited capacity).
    • Broker B: must get at least 3,000 shares (contractual).
    • Total demand: 10,000 shares.

Objective: Minimize total cost.

Broker Cost per Share (₹) Capacity Allocation (LP Solution)
A 50 4,000 4,000
B 60 6,000 3,000 (minimum)
C 40 5,000 3,000

Solution:

  • Allocate all 4,000 to A (cheapest), 3,000 to B (minimum), and 3,000 to C.
  • Total cost: ₹50×4,000 + ₹60×3,000 + ₹40×3,000 = ₹470,000.

flowchart TD
    A["Minimize Cost"] --> B["Subject to Constraints"]
    B --> C["Brokers A, B, C"]
    C --> D["Demand = 10,000"]
    C --> E["A ≤ 4,000"]
    C --> F["B ≥ 3,000"]
    D --> G["LP Solver"]
    G --> H["Optimal Allocation"]

B. Transportation Model

Used to minimize shipping costs in multi-location production (e.g., Himalayan Java’s coffee distribution).

Example: Daraz’s Warehouse Allocation

  • Demand: 3 regions (Kathmandu, Pokhara, Biratnagar) need 5,000, 3,000, and 2,000 units respectively.
  • Supply: 2 warehouses (Lalitpur: 6,000 units; Bhaktapur: 4,000 units).
  • Costs (per unit):
    • Kathmandu: Lalitpur ₹10, Bhaktapur ₹15.
    • Pokhara: Lalitpur ₹12, Bhaktapur ₹8.
    • Biratnagar: Lalitpur ₹18, Bhaktapur ₹10.

Solution (using Northwest Corner Rule):

From\To Kathmandu Pokhara Biratnagar Supply
Lalitpur 5,000 1,000 0 6,000
Bhaktapur 0 2,000 2,000 4,000
Demand 5,000 3,000 2,000 10,000

Total Cost: (5,000×10) + (1,000×12) + (2,000×8) + (2,000×10) = ₹112,000.


5. Graphical Methods: The Linear Decision Rule

A simple way to compare chase vs. level strategies visually.

Example: NTC’s Power Generation

  • Demand: 1,000 MW (peak), 500 MW (off-peak).
  • Costs:
    • Inventory cost: ₹50/MWh (storing excess power).
    • Hiring cost: ₹100/MWh (ramping up generators).

Step 1: Plot Costs

  • Chase cost line: Steep (high hiring costs).
  • Level cost line: Shallow (low hiring, high inventory).

Step 2: Find Break-Even Point

  • Break-even demand: Where both strategies cost the same. Formula: MW.

Step 3: Decision

  • If demand > 1,000 MW, use chase strategy.
  • If demand < 1,000 MW, use level strategy.

Demand (MW)Cost (₹'000)OChase CostLevel CostBreak-even (1,000 MW)Q*P*
Decision rule: Chase strategy preferred above 1,000 MW demand (NTC power generation example).

6. Simulation in APP

Used when mathematical models are too complex (e.g., Pathao’s driver allocation during strikes).

Example: Khalti’s Server Capacity Planning

  • Problem: Transaction volume spikes 5x during Dashain.
  • Variables:
    • Servers: 100 (normal), 200 (peak).
    • Failure rate: 5% per server.
    • Downtime cost: ₹10,000/minute.

Simulation Steps:

  1. Model 10,000 transactions/hour with Poisson distribution.
  2. Simulate server failures (exponential distribution).
  3. Calculate expected downtime and cost.

Result:

  • 100 servers: 20% downtime → ₹12M loss.
  • 200 servers: 5% downtime → ₹3M loss.
  • Optimal: 150 servers → ₹1.5M loss.

7. Real-World Case Study: Chaudhary Group’s APP

Company: Chaudhary Group (Nepal’s largest FMCG player, owns Bhatbhateni, Fanta, Nepal Oil). Product: Cooking oil (highly seasonal demand).

Level Strategy (70%) (58%)Chase Strategy (30%) (25%)Safety Stock (20%) (17%)
Chaudhary Group’s APP strategy mix (percentage breakdown).

Challenges:

  • Demand peaks: 30% higher during Dashain/Tihar (families stock up).
  • Shelf life: 12 months (perishable).
  • Supply chain: Raw materials (palm oil) imported from Malaysia.

APP Strategy:

  1. Forecasting:

    • Use time-series + causal models (GDP growth, festival dates).
    • Machine learning for short-term adjustments.
  2. Production Strategy:

    • Mixed approach:
      • Level production: 70% capacity year-round.
      • Chase for peaks: 30% temporary workers + overtime.
  3. Inventory:

    • Safety stock: 20% of peak demand.
    • Just-in-time (JIT): For raw materials (palm oil).
  4. Cost Savings:

    • Before APP: ₹500M/year in excess inventory + ₹300M in rushed production.
    • After APP: ₹150M/year saved.

0200400600800Before APP800After APP150
Chaudhary Group’s annual cost savings (₹'00 million) via APP implementation.

In the Real World

  1. NTC’s Power Generation

    • Idea Used: Aggregate planning with chase strategy.
    • How: NTC adjusts hydroelectric dam output and thermal plant usage based on monsoon forecasts. During low rainfall, they hire temporary engineers to maintain turbines (chase strategy). In high rainfall, they store excess water (level strategy).
  2. Daraz’s Order Fulfillment

    • Idea Used: Mixed strategy + linear programming.
    • How: Daraz uses LP to allocate orders across 5 warehouses (Kathmandu, Pokhara, Biratnagar, etc.) to minimize shipping costs. During Dashain, they hire 1,000 temporary packers (chase) while maintaining buffer inventory (level).
  3. Nabil Bank’s Loan Processing

    • Idea Used: Level strategy + inventory of pre-approved loans.
    • How: Instead of hiring/firing loan officers, Nabil maintains a constant team of 50 officers and keeps 1,000 pre-approved loan templates in inventory. This reduces hiring costs by ₹50M/year but increases IT/inventory costs by ₹20M/year.
  4. Himalayan Java’s Coffee Processing

    • Idea Used: Seasonal forecasting + mixed strategy.
    • How: Coffee cherries are harvested only 2 months/year (Oct–Nov). Himalayan Java:
      • Forecasts using weather data + export orders.
      • Hires temporary workers during harvest (chase).
      • Stores dried coffee beans in inventory for year-round sales (level).
  5. Pathao’s Driver Allocation

    • Idea Used: Queuing theory + simulation.
    • How: Pathao uses simulation models to predict driver demand during strikes or festivals. For example:
      • Normal day: 5,000 drivers.
      • Dashain: 8,000 drivers (30% increase).
      • Strike day: 3,000 drivers (40% decrease).
    • Result: Reduces wait times by 30% and driver idle time by 20%.

Exam Tip

What Examiners Want to See

  1. Definitions:

    • Always define aggregate production plan, chase strategy, level strategy, and mixed strategy in your own words.
    • Example:

      "Aggregate production planning is a medium-term decision-making process that determines the optimal production rates, workforce levels, and inventory policies to meet forecasted demand while minimizing costs."

  2. Comparisons:

    • Exam favorite: A table comparing chase vs. level vs. mixed strategies (include pros, cons, and examples).
    • Marks tip: Use real Nepali examples (e.g., NTC for chase, Nabil Bank for level).
  3. Numerical Problems:

    • Solve step-by-step using:
      • Linear programming (shadow prices, constraints).
      • Transportation model (Northwest Corner Rule, Vogel’s Approximation).
      • Graphical methods (plot cost lines, find break-even).
    • Example question:

      "A company has demand of 10,000 units/month with a seasonal variation of ±20%. Hiring cost is ₹50/unit, and inventory cost is ₹20/unit. Which strategy would you recommend and why?"

  4. Case Studies:

    • Describe a Nepali company’s APP (e.g., Chaudhary Group, NTC, Daraz) and explain:
      • Their forecasting method.
      • Their production strategy (chase/level/mixed).
      • Cost trade-offs they face.
  5. Short-Answer Tips:

    • Forecasting methods: Mention time-series, causal, Delphi, and ML with one example each.
    • APP strategies: List 3 strategies and give one Nepali example per strategy.
    • Mathematical models: Name LP, transportation, and simulation and state their use in APP.

Common Mistakes to Avoid

  • Ignoring constraints: In LP problems, always list all constraints (capacity, demand, non-negativity).
  • Vague examples: Don’t say "a company"—use NTC, Daraz, Nabil Bank, or Chaudhary Group.
  • Skipping calculations: Even if the answer is obvious, show the math (e.g., break-even point).
  • Overcomplicating: Examiners prefer clear tables over long paragraphs for comparisons.

Sample Exam Questions & Answers

Q1: Define aggregate production planning. Explain the chase strategy with a real-world example from Nepal. Answer: Aggregate production planning (APP) is a medium-term (3–18 months) tactical process that aligns production capacity (workforce, machines) with forecasted demand to minimize costs and stockouts.

Chase Strategy:

  • Definition: Adjust production exactly to demand by hiring/firing workers or using overtime.
  • Example: Kathmandu Traffic Police during Dashain/Tihar.
    • Problem: Vehicle traffic increases by 20% (50,000 → 60,000 vehicles/day).
    • Solution: Hire 500 temporary traffic officers for 2 months.
    • Cost: ₹50 lakhs (temporary staff) vs. ₹80 lakhs (building permanent infrastructure).
    • Advantage: No inventory costs (applies to services like traffic management).

Q2: A company produces 1,000 units/month with demand varying between 800 and 1,200 units. Hiring cost is ₹100/unit, and inventory cost is ₹50/unit. Which APP strategy would you recommend? Justify with calculations. Answer: Step 1: Calculate Break-Even Demand Use the linear decision rule:

Step 2: Compare with Actual Demand

  • Actual demand range: 800–1,200 units.
  • Break-even: 2,000 units (well above actual demand).

Step 3: Recommend Strategy Since demand < break-even, the level strategy is better because:

  • Hiring costs (₹100/unit) are higher than inventory costs (₹50/unit).
  • Stable workforce avoids layoffs (important in Nepal’s labor market).

Cost Comparison:

Strategy Inventory Cost (₹) Hiring Cost (₹) Total Cost (₹)
Chase Low (₹0) High (₹200,000) ₹200,000
Level High (₹200,000) Low (₹0) ₹200,000

But wait! For demand = 1,000 units:

  • Level: Produce 1,000, hold 200 units inventory → Cost = 200 × ₹50 = ₹10,000.
  • Chase: Produce 1,000, no inventory → Cost = ₹0. Correction: For exact demand = production, chase is better. However, since demand varies ±20%, level is safer to avoid stockouts.

Final Answer: Use a mixed strategy:

  • Base production: 1,000 units (level).
  • For spikes >1,100 units: Use overtime (partial chase).
  • Avoid hiring/firing to comply with Nepal’s labor laws.

Q3: Explain how linear programming can be used in aggregate production planning. Solve a simple LP problem for a Nepali company. Answer: Role of LP in APP: Linear programming (LP) helps minimize costs or maximize profits while meeting demand and capacity constraints. In APP, LP is used to:

  1. Determine optimal production quantities.
  2. Allocate workforce and inventory.
  3. Optimize subcontracting decisions.

Example: Nepal Oil’s Fuel Distribution Problem: Nepal Oil has 2 refineries (Biratnagar and Hetauda) supplying 3 regions (Kathmandu, Pokhara, Biratnagar). Data:

From\To Kathmandu Pokhara Biratnagar Supply
Biratnagar ₹10 ₹15 ₹5 5,000
Hetauda ₹12 ₹8 ₹10 4,000
Demand 4,000 3,000 2,000 9,000

Objective: Minimize total distribution cost.

Solution (Northwest Corner Rule):

  1. Allocate 4,000 to Kathmandu from Biratnagar (₹10).
  2. Allocate 1,000 to Pokhara from Biratnagar (₹15).
  3. Allocate 2,000 to Biratnagar from Biratnagar (₹5).
  4. Allocate 1,000 to Pokhara from Hetauda (₹8).
  5. Allocate 3,000 to Kathmandu from Hetauda (₹12).

Total Cost: = (4,000×10) + (1,000×15) + (2,000×5) + (1,000×8) + (3,000×12) = ₹112,000.

Optimal Allocation Table:

From\To Kathmandu Pokhara Biratnagar Supply
Biratnagar 4,000 1,000 0 5,000
Hetauda 0 2,000 2,000 4,000
Demand 4,000 3,000 2,000 9,000

Interpretation:

  • Biratnagar refinery supplies all of Kathmandu (cheapest route).
  • Hetauda supplies Pokhara and Biratnagar (cheaper than Biratnagar for Pokhara).
  • Total savings: Compared to random allocation, LP reduces costs by ₹20,000.

Final Checklist Before Exam

✅ Memorize definitions (APP, chase/level/mixed strategies). ✅ Know 3 Nepali examples (NTC, Daraz, Nabil Bank, Chaudhary Group). ✅ Practice LP and transportation problems (Northwest Corner Rule). ✅ Understand graphical methods (linear decision rule). ✅ Revise forecasting techniques (time-series, causal, Delphi). ✅ Compare strategies in a table (pros, cons, examples).

Based on the TU BBM syllabus for Introduction To Operations Management (OPR311), unit 9.

Discussion

Loading…