Study guide

6.3 Material Requirements Planning (MRP), Bill of Materials & Capacity Planning

PE Industrial and Systems Exam

Track your progress as you read

Finished sections get a check mark.

1 Exam Overview, Strategy & Systems Foundations

1.1 PE Industrial Exam Format, Official Specification & Reference Handbook Strategy 1.2 System Analysis Tools, Process Definition, Requirements Engineering & QFD 1.3 Performance Measures: Output, Productivity, OEE, Cost & Environmental Sustainability 1.4 Process Types (Discrete, Continuous, Manufacturing, Service) & Value Analysis/Engineering

2 Optimization, Queueing, Simulation, Networks & Markov Chains

2.1 Linear Programming Formulation, Graphical Solutions & Sensitivity Analysis 2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications 2.3 Discrete-Event Simulation, Random Variates & Model Validation 2.4 Graph Theory & Network Models: Shortest Path, Minimal Spanning Tree & Maximum Flow 2.5 Markov Chains: Transition Matrices, Steady-State Probabilities & Absorbing States 2.6 Decision Trees, Expected Value & Bottleneck Analysis (Theory of Constraints)

3 Project Management & Planning

3.1 Project Scheduling with CPM and PERT: Critical Path, Float, Probability & Crashing 3.2 Project Planning & Control: Scope and WBS, Gantt Charts, Critical Chain (CCPM), Risk & Earned Value

4 Facility Layout, Space, Capacity & Material Handling

4.1 Systematic Layout Planning (SLP) & Activity Relationship (REL) Analysis 4.2 Workstation Design, Aisle Sizing & Space Requirements Planning 4.3 Capacity Analysis: Machine Requirements, Scrap Allowances & Personnel Requirements 4.4 Material Handling Equipment Selection, Unit Loads & Handling Principles

5 Site Location, Warehousing & Facility Economics

5.1 Facility Location Models: Center of Gravity & Minisum / Minimax Distance 5.2 Warehousing Systems, Storage Assignment & Order Picking Operations 5.3 Facility Life-Cycle Economics, Replacement Analysis & Rearrangement Costs

6 Demand Forecasting, Production Planning, MRP & JIT

6.1 Demand Forecasting Methods: Moving Averages, Exponential Smoothing & Error Metrics 6.2 Aggregate Planning Strategies & Master Production Scheduling (MPS) 6.3 Material Requirements Planning (MRP), Bill of Materials & Capacity Planning 6.4 Just-in-Time & Lean Production Planning: Pull Systems, Kanban Sizing, Heijunka & SMED

7 Inventory Systems, Scheduling, Logistics & Transportation Modes

7.1 Deterministic Inventory Control: Classical EOQ, EPQ & Quantity Discounts 7.2 Stochastic Inventory Management: Safety Stock, Continuous / Periodic Review & Newsvendor 7.3 Production Sequencing, Dispatching Rules & Johnson's Algorithm 7.4 Supply Chain Logistics, Transportation Simplex & Distribution Network Design 7.5 Transportation Modes, Freight Economics & the Transshipment Model

8 Engineering Economics, Break-Even Analysis & Costing Systems

8.1 Equivalence, Cash Flow Analysis & Discounted Cash Flow Metrics (PW, FW, EAC) 8.2 Rate of Return Analysis (IRR, Incremental IRR) & Benefit-Cost (B/C) Ratios 8.3 Asset Depreciation (MACRS, Straight-Line), Tax Effects & Replacement Decisions 8.4 Break-Even Analysis, Technical Capability Assessment & Costing Systems (Traditional, ABC & Standard Costs)

9 Methods Engineering, Work Measurement, Learning Curves, Line Balancing & Process Planning

9.1 Methods Analysis, Process Charting & Motion Study (Therbligs, 5S) 9.2 Worker–Machine (Man–Machine) Charts, Multiple Activity Analysis & Synchronous Servicing 9.3 Time Study Fundamentals, Performance Rating & Allowance Factors 9.4 Predetermined Motion Time Systems (PMTS, MTM, MOST) & Work Sampling 9.5 Learning Curves: Unit and Cumulative-Average Models, Learning Rates & Applications 9.6 Assembly Line Balancing, Precedence Constraints & Efficiency Heuristics 9.7 Manufacturing & Service Process Planning: Operation Selection, Sequencing, Route Sheets, Fixturing & Mistake Proofing

10 Ergonomics, Human Capacity, Occupational Safety & DART Rates

10.1 Anthropometry, Percentile Design, Workstation Ergonomics & Link Analysis 10.2 Industrial Biomechanics, the NIOSH Lifting Equation & Lifting Aids 10.3 Limits of Human Capacity & Risk-Factor Tools: Work Physiology, Strength, Range of Motion, Vision, RULA & Slip Resistance 10.4 Environmental Ergonomics (Noise, Heat, Illumination), Human-Machine Systems & OSHA Safety 10.5 Safety Codes, Standards & Voluntary Guidelines (OSHA, ANSI, NIOSH, MIL-STD) and DART Rate Calculations

11 Statistical Process Control & Process Capability

11.1 Statistical Process Control for Variables (X-bar/R and X-bar/s Charts) 11.2 Statistical Process Control for Attributes (p, np, c, and u Charts) 11.3 Process Capability Indices (Cp, Cpk, Cpm, Pp, Ppk) & Sigma Levels

12 Design of Experiments, Acceptance Sampling & Quality Systems

12.1 Design of Experiments: 2^k Factorials, ANOVA & Taguchi Robust Design 12.2 Acceptance Sampling: OC Curves, AQL, LTPD, AOQL, Z1.4/MIL-STD-105E & Dodge-Romig 12.3 Quality Systems (Deming, TQM, ISO 9000, Benchmarking), Root Cause Analysis & DMAIC

13 Reliability Engineering & Maintenance Systems

13.1 Reliability Modeling, Failure Rates (lambda) & Life Distributions (Exponential, Weibull) 13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy 13.3 Equipment Maintenance Engineering, Availability (A), MTBF/MTTR & RCM

6.3 Material Requirements Planning (MRP), Bill of Materials & Capacity Planning

Key Takeaways Explain This Topic AI

Material Requirements Planning (MRP) deterministically explodes independent-demand MPS end-items into time-phased dependent-demand requirements for subassemblies, components, and raw materials.

The Low-Level Coding (LLC) algorithm assigns each part number the lowest numerical level at which it appears across all product trees ( L L C = max ⁡ ( depth ) LLC = \max(\text{depth}) LL C = max ( depth ) ), guaranteeing that a part's gross requirements are completely aggregated before explosion.

The core MRP computational record calculates Gross Requirements ( G R GR GR ), Scheduled Receipts ( S R SR SR ), Projected Available Balance ( P A B PAB P A B ), Net Requirements ( N R NR NR ), Planned Order Receipts ( P O R c PORc POR c ), and Planned Order Releases ( P O R e l PORel POR e l ), offset by procurement/manufacturing lead times.

Lot sizing balances order setup expenses against inventory holding costs: Lot-for-Lot (L4L) minimizes carrying costs for volatile/expensive items; EOQ imposes static batches; POQ aligns orders with economic cycles; and Part Period Balancing (PPB) equates cumulative carrying cost to setup cost.

Capacity Requirements Planning (CRP) validates the feasibility of MRP planned releases at individual work centers by converting planned order releases into machine and labor hours, generating load profiles to detect and resolve work center overloads.

Last updated: October 2026

Material Requirements Planning (MRP), Bill of Materials & Capacity Planning

Core Principle: Material Requirements Planning (MRP) transforms independent MPS demand into time-phased dependent requirements across multi-echelon Bills of Materials. By coupling inventory status records with lead-time offsetting and work center capacity profiles, MRP ensures components arrive precisely when required while minimizing work-in-process (WIP).

In manufacturing systems, inventory items fall into two distinct demand regimes: independent demand and dependent demand . Independent demand (finished goods, spare parts) is influenced by external market forces and must be forecasted stochastically. Dependent demand (components, subassemblies, raw materials) is derived mathematically from the production schedule of parent assemblies. Applying statistical reorder points to dependent components creates artificial bullwhip amplifications; instead, dependent items must be managed via deterministic, time-phased Material Requirements Planning (MRP) .

  • 1. Core Inputs to the MRP Engine
  • The MRP processing algorithm integrates three fundamental data streams: Core MRP Inputs & Outputs Architecture
  • [Master Production Schedule (MPS)] [Bill of Materials (BOM)] [Inventory Status Records]
  • (What end-items to make & when) (Product structure tree) (On-hand, on-order, lead time)
  • │ │ │
  • └─────────────────────────┬─────────┴──────────────────────────────┘
  • ▼
  • [MRP Computational Engine]
  • │
  • ┌──────────────────────────────────┴──────────────────────────────────┐
  • ▼ ▼
  • [Primary MRP Outputs] [Secondary Exception Outputs]
  • Planned Order Releases (Shop & POs) - Expedite / De-expedite notices
  • Time-phased Planned Order Receipts - Cancel order notices
  • Rescheduling action advisories - Capacity overload warnings

Master Production Schedule (MPS): Defines the quantities and required completion dates for all independent-demand finished items.

Bill of Materials (BOM): An engineering database defining the exact hierarchy, parent-child relationships, and unit quantities required to fabricate one parent unit.

Inventory Status Records: Contains item-specific operational parameters:

On-Hand Inventory: Physical usable stock physically present in the warehouse.

Scheduled Receipts ( S R SR SR ): Open purchase orders or factory work orders previously committed and due to arrive at the start of a specific time bucket.

Safety Stock ( S S SS SS ): Buffer inventory reserved to absorb scrap, yield losses, or lead-time variance.

Lead Time ( L L L ): Total elapsed time from order release to physical receipt into inventory (supplier lead time or manufacturing cycle time).

Lot-Sizing Rule: Pre-assigned heuristic governing order batch quantities.

2. Bill of Materials (BOM) & Low-Level Coding (LLC)

A Bill of Materials (BOM) represents product structure hierarchically. A single-level BOM displays only immediate children, whereas an indented multi-level BOM exposes the full explosion path from finished unit to raw materials. Product Structure Tree with Low-Level Coding

  • Level 0: [Final Product A]
  • / \
  • Level 1: [Sub B] (qty: 2) [Sub C] (qty: 1)
  • / \ \
  • Level 2: [Comp D] (3) [Comp E] (1) [Comp D] (2)

Low-Level Code (LLC) Assignment:

  • Product A: LLC = 0 (Appears only at Level 0)
  • Subassembly B: LLC = 1
  • Subassembly C: LLC = 1
  • Component E: LLC = 2
  • Component D: LLC = 2 (Appears at Level 2 under both B and C; LLC = max depth = 2)
  • The Low-Level Coding (LLC) Algorithm

When a common component appears at multiple levels in different subassemblies (or across multiple products), exploding requirements naively causes fragmentation: orders would be generated at Level 1, and then additional requirements discovered at Level 2 would require duplicate setups and split batches.

To ensure computational efficiency and prevent fragmented lot sizing, MRP systems execute the Low-Level Coding (LLC) algorithm during BOM maintenance:

LLC ( Item i ) = max ⁡ p ∈ Paths ( Depth of Item i in Path p ) \text{LLC}(\text{Item } i) = \max_{p \in \text{Paths}} \left( \text{Depth of Item } i \text{ in Path } p \right) LLC ( Item i ) = max p ∈ Paths ​ ( Depth of Item i in Path p )

Operational Rule: An end-item is coded as Level 0. Any component used as an immediate child of a Level 0 item is Level 1, unless it also appears deeper in another branch. The item's LLC is assigned the maximum depth level at which it appears anywhere in the company's product structures.

Explosion Integrity: The MRP processing engine explodes requirements strictly level by level ( L L C = 0 , 1 , 2 , … LLC = 0, 1, 2, \dots LL C = 0 , 1 , 2 , … ). No component's net requirements or planned orders are calculated until all parent assemblies possessing a lower LLC number have been fully exploded and their planned order releases aggregated. This ensures all gross requirements for a shared part are consolidated into single time buckets.

3. The Mathematical Mechanics of MRP Explosion

For each inventory item, the MRP matrix processes a time-phased grid across planning buckets t = 1 , 2 , … , T t = 1, 2, \dots, T t = 1 , 2 , … , T . The row definitions and computational sequence are: MRP Time-Phased Matrix Structure

  • Row Parameter Mathematical Relationship
  • ─────────────────────────────────────────────────────────────────────────────
  • Gross Requirements (GR_t) Parent PORel × Usage Qty + Independent Demand
  • Scheduled Receipts (SR_t) Open orders confirmed arriving in period t
  • Projected Available (PAB_t) PAB_{t-1} + SR_t + PORc_t - GR_t
  • Net Requirements (NR_t) max(0, GR_t + SS - (PAB_{t-1} + SR_t))
  • Planned Order Receipts (PORc_t) Lot-sized batch to satisfy NR_t (PORc_t ≥ NR_t)
  • Planned Order Releases (PORel) PORel_{t-L} = PORc_t (Offset by Lead Time L)
  • Step-by-Step Computational Formulations

Gross Requirements ( G R t GR_t G R t ​ ): Total anticipated demand for the component in period t t t :

G R t = ∑ p ∈ Parents ( P O R e l p , t × U p ) + D independent , t GR_t = \sum_{p \in \text{Parents}} \left( PORel_{p, t} \times U_{p} \right) + D_{\text{independent}, t} G R t ​ = ∑ p ∈ Parents ​ ( POR e l p , t ​ × U p ​ ) + D independent , t ​

Where P O R e l p , t PORel_{p, t} POR e l p , t ​ is the Planned Order Release of parent p p p in period t t t , and U p U_p U p ​ is the usage multiplier (units of child required per unit of parent).

Preliminary Available Balance ( P A B t 0 PAB_t^0 P A B t 0 ​ ): Stock available before receiving any new planned order:

P A B t 0 = P A B t − 1 + S R t − G R t PAB_t^0 = PAB_{t-1} + SR_t - GR_t P A B t 0 ​ = P A B t − 1 ​ + S R t ​ − G R t ​

Net Requirements ( N R t NR_t N R t ​ ): Deficit below required safety stock ( S S SS SS ):

N R t = { G R t + S S − ( P A B t − 1 + S R t ) , if P A B t − 1 + S R t < G R t + S S 0 , otherwise NR_t = \begin{cases} GR_t + SS - (PAB_{t-1} + SR_t), & \text{if } PAB_{t-1} + SR_t < GR_t + SS \\ 0, & \text{otherwise} \end{cases} N R t ​ = { G R t ​ + SS − ( P A B t − 1 ​ + S R t ​ ) , 0 , ​ if P A B t − 1 ​ + S R t ​ < G R t ​ + SS otherwise ​

Planned Order Receipts ( P O R c t PORc_t POR c t ​ ): If N R t > 0 NR_t > 0 N R t ​ > 0 , an order receipt is scheduled in period t t t . The quantity is determined by the active lot-sizing rule ( P O R c t ≥ N R t PORc_t \ge NR_t POR c t ​ ≥ N R t ​ ). If N R t = 0 NR_t = 0 N R t ​ = 0 , P O R c t = 0 PORc_t = 0 POR c t ​ = 0 .

Updated Projected Available Balance ( P A B t PAB_t P A B t ​ ):

P A B t = P A B t − 1 + S R t + P O R c t − G R t PAB_t = PAB_{t-1} + SR_t + PORc_t - GR_t P A B t ​ = P A B t − 1 ​ + S R t ​ + POR c t ​ − G R t ​

Planned Order Releases ( P O R e l t − L PORel_{t-L} POR e l t − L ​ ): To ensure the order arrives at period t t t , it must be released L L L periods earlier (lead-time offsetting):

  • P O R e l t − L = P O R c t PORel_{t-L} = PORc_t POR e l t − L ​ = POR c t ​
  • 4. Lot-Sizing Techniques in MRP

Lot-sizing rules dictate how net requirements are grouped into replenishment batches. Choosing an inappropriate lot-sizing rule can either inflate inventory holding costs or create excessive setup overhead.

Lot-Sizing Method Mechanics Advantages Disadvantages Optimal Application

Lot-for-Lot (L4L) Set P O R c t = N R t PORc_t = NR_t POR c t ​ = N R t ​ in each period. Zero ending inventory beyond safety stock. Minimizes inventory holding cost; eliminates cycle stock. Incurs setup/ordering cost for every non-zero period. High holding costs, expensive custom components, JIT / Lean systems.

Economic Order Quantity (EOQ) Fixed lot size Q ∗ = 2 D S / H Q^* = \sqrt{2DS/H} Q ∗ = 2 D S / H ​ based on annualized average demand. Exploits economies of scale; simple to administer. Causes "lumpiness"; carries excessive inventory when requirements are sporadic. High setup costs, stable continuous demand profiles.

Periodic Order Quantity (POQ) Economic order interval P = ⌈ E O Q / D ˉ ⌉ P = \lceil EOQ / \bar{D} \rceil P = ⌈ EOQ / D ˉ ⌉ . Orders sum of next P P P periods' net requirements. Adapts to lumpy demand; eliminates holding inventory across zero-demand periods. Requires dynamic recalculation if demand fluctuates sharply. Lumpy, intermittent dependent demand with moderate setup costs.

Part Period Balancing (PPB) Groups sequential periods until cumulative holding cost most closely matches setup cost S S S . Dynamically balances setup and holding costs without rigid time buckets. Computationally intensive; forward-looking horizon effects. High-value components with dynamic, seasonal, or irregular demand.

Part Period Balancing (PPB) Mathematics

PPB evaluates carrying cost in units of Part-Periods (one unit of inventory held for one period). The Economic Part Period ( E P P EPP EPP ) is the ratio of setup cost S S S to inventory carrying cost per unit per period h h h :

E P P = S h EPP = \frac{S}{h} EPP = h S ​

The algorithm accumulates net requirements for future periods k = t + 1 , t + 2 , … k = t+1, t+2, \dots k = t + 1 , t + 2 , … and computes cumulative part-periods:

Cumulative Part-Periods = ∑ j = t t + m ( N R j × ( j − t ) ) \text{Cumulative Part-Periods} = \sum_{j=t}^{t+m} \left( NR_j \times (j - t) \right) Cumulative Part-Periods = ∑ j = t t + m ​ ( N R j ​ × ( j − t ) )

The batch is closed at the period m m m where cumulative part-periods are closest to E P P EPP EPP .

5. Comprehensive Worked Numerical MRP Example

An industrial instrumentation firm manufactures an automated fluid monitor (Item A). Each unit of A requires 2 units of Subassembly B . The operational parameters are:

Finished Item A: Lot-for-Lot (L4L), Lead Time L A = 1 L_A = 1 L A ​ = 1 week, Safety Stock S S A = 0 SS_A = 0 S S A ​ = 0 , Initial On-Hand I 0 , A = 10 I_{0, A} = 10 I 0 , A ​ = 10 .

Subassembly B: Fixed Order Quantity F O Q = 100 FOQ = 100 FOQ = 100 units, Lead Time L B = 2 L_B = 2 L B ​ = 2 weeks, Safety Stock S S B = 20 SS_B = 20 S S B ​ = 20 , Initial On-Hand I 0 , B = 45 I_{0, B} = 45 I 0 , B ​ = 45 , Scheduled Receipt S R B = 100 SR_B = 100 S R B ​ = 100 in Week 1.

The Master Production Schedule requires completing 50 units of Item A in Week 3 and 80 units of Item A in Week 5 .

MRP Explosion for Finished Item A (Parent)

  • Week ( t t t ) 1 2 3 4 5 6
  • Gross Requirements ( G R GR GR ) 0 0 50 0 80 0
  • Scheduled Receipts ( S R SR SR ) 0 0 0 0 0 0
  • Projected Available Balance ( P A B PAB P A B ) [Initial = 10] 10 10 0 0 0 0
  • Net Requirements ( N R NR NR ) 0 0 40 0 80 0
  • Planned Order Receipts ( P O R c PORc POR c ) [L4L] 0 0 40 0 80 0
  • Planned Order Releases ( P O R e l PORel POR e l ) [ L A = 1 L_A = 1 L A ​ = 1 ] 0 40 0 80 0 0

Item A Calculations:

In Week 3: P A B 2 = 10 PAB_2 = 10 P A B 2 ​ = 10 . Deficit is 50 − 10 = 40 50 - 10 = 40 50 − 10 = 40 . N R 3 = 40 ⟹ P O R c 3 = 40 NR_3 = 40 \implies PORc_3 = 40 N R 3 ​ = 40 ⟹ POR c 3 ​ = 40 . P A B 3 = 10 + 40 − 50 = 0 PAB_3 = 10 + 40 - 50 = 0 P A B 3 ​ = 10 + 40 − 50 = 0 . Offset by L A = 1 L_A = 1 L A ​ = 1 week ⟹ P O R e l 2 = 40 \implies PORel_2 = 40 ⟹ POR e l 2 ​ = 40 .

In Week 5: P A B 4 = 0 PAB_4 = 0 P A B 4 ​ = 0 . N R 5 = 80 ⟹ P O R c 5 = 80 NR_5 = 80 \implies PORc_5 = 80 N R 5 ​ = 80 ⟹ POR c 5 ​ = 80 . Offset by L A = 1 L_A = 1 L A ​ = 1 week ⟹ P O R e l 4 = 80 \implies PORel_4 = 80 ⟹ POR e l 4 ​ = 80 .

MRP Explosion for Subassembly B (Child, Usage = 2)

Gross requirements for B are driven by Item A's planned releases: G R B , t = P O R e l A , t × 2 GR_{B, t} = PORel_{A, t} \times 2 G R B , t ​ = POR e l A , t ​ × 2 :

Week 2: 40 × 2 = 80 40 \times 2 = 80 40 × 2 = 80 units.

Week 4: 80 × 2 = 160 80 \times 2 = 160 80 × 2 = 160 units.

  • Week ( t t t ) 1 2 3 4 5 6
  • Gross Requirements ( G R GR GR ) 0 80 0 160 0 0
  • Scheduled Receipts ( S R SR SR ) 100 0 0 0 0 0

Projected Available Balance ( P A B PAB P A B ) [Initial = 45, S S = 20 SS = 20 SS = 20 ] 145 65 65 105 105 105

  • Net Requirements ( N R NR NR ) 0 0 0 115 0 0
  • Planned Order Receipts ( P O R c PORc POR c ) [FOQ = 100] 0 0 0 200 0 0
  • Planned Order Releases ( P O R e l PORel POR e l ) [ L B = 2 L_B = 2 L B ​ = 2 ] 0 200 0 0 0 0

Subassembly B Step-by-Step Calculations:

Week 1: P A B 1 = I 0 , B + S R 1 − G R 1 = 45 + 100 − 0 = 145 PAB_1 = I_{0, B} + SR_1 - GR_1 = 45 + 100 - 0 = 145 P A B 1 ​ = I 0 , B ​ + S R 1 ​ − G R 1 ​ = 45 + 100 − 0 = 145 .

Week 2: G R 2 = 80 GR_2 = 80 G R 2 ​ = 80 . Available before order is 145 − 80 = 65 145 - 80 = 65 145 − 80 = 65 . Since 65 > S S 65 > SS 65 > SS ( 20 20 20 ), N R 2 = 0 NR_2 = 0 N R 2 ​ = 0 . Updated P A B 2 = 65 PAB_2 = 65 P A B 2 ​ = 65 .

Week 3: G R 3 = 0 ⟹ P A B 3 = 65 GR_3 = 0 \implies PAB_3 = 65 G R 3 ​ = 0 ⟹ P A B 3 ​ = 65 .

Week 4: G R 4 = 160 GR_4 = 160 G R 4 ​ = 160 . Required stock is G R 4 + S S = 160 + 20 = 180 GR_4 + SS = 160 + 20 = 180 G R 4 ​ + SS = 160 + 20 = 180 . Prior balance is P A B 3 = 65 PAB_3 = 65 P A B 3 ​ = 65 . The net requirement is N R 4 = 180 − 65 = 115 NR_4 = 180 - 65 = 115 N R 4 ​ = 180 − 65 = 115 units.

Because lot size is F O Q = 100 FOQ = 100 FOQ = 100 , the system must order multiples of 100. Sizing for 115 requires ⌈ 115 / 100 ⌉ × 100 = 200 \lceil 115 / 100 \rceil \times 100 = 200 ⌈ 115/100 ⌉ × 100 = 200 units. Thus, P O R c 4 = 200 PORc_4 = 200 POR c 4 ​ = 200 .

Updated balance: P A B 4 = 65 + 200 − 160 = 105 PAB_4 = 65 + 200 - 160 = 105 P A B 4 ​ = 65 + 200 − 160 = 105 (note: if safety stock is held separately, P A B PAB P A B is 105 total, or 85 above S S SS SS ).

Offset by lead time L B = 2 L_B = 2 L B ​ = 2 weeks: order must be released in Week 4 − 2 = 2 4 - 2 = 2 4 − 2 = 2 . Therefore, P O R e l 2 = 200 PORel_2 = 200 POR e l 2 ​ = 200 units .

6. Capacity Requirements Planning (CRP) & Closed-Loop MRP

MRP generates planned orders assuming infinite capacity —it assumes machines and labor are always available when needed. In reality, work centers face rigid throughput limits. Capacity Requirements Planning (CRP) acts as the critical reality check, converting planned order releases into machine and labor hours at specific work centers. MRP to CRP Translation & Load Leveling

  • [Planned Order Releases (PORel)] × [Standard Routing Sheet (Setup & Run)]
  • │
  • ▼
  • [Work Center Capacity Load Profile]
  • Hours ^
  • | Overload Spikes (Must resolve via OT/rerouting)
  • | [===]
  • | ┌────┴───┴────┐
  • | │ │
  • Cap +-------------+-------------+-------------+------------- Rated Max Capacity
  • | [===] │ │ [===] │
  • | │ │ │ │ │ │ │ [===]
  • | │ │ │ │ │ │ │ │ │
  • +----+---+----+-------------+----+---+----+----+---+----> Time (Weeks)
  • Week 1 Week 2 Week 3 Week 4
  • CRP Load Calculation

For a specific work center w w w in time bucket t t t , the required workload in standard hours is:

Load w , t = ∑ j ∈ J w , t ( S j , w + P O R e l j , t × U j , w ) \text{Load}_{w, t} = \sum_{j \in J_{w, t}} \left( S_{j, w} + PORel_{j, t} \times U_{j, w} \right) Load w , t ​ = ∑ j ∈ J w , t ​ ​ ( S j , w ​ + POR e l j , t ​ × U j , w ​ )

Where:

J w , t J_{w, t} J w , t ​ is the set of all lots scheduled to be processed at work center w w w during period t t t .

S j , w S_{j, w} S j , w ​ is the setup time in standard hours for lot j j j .

P O R e l j , t PORel_{j, t} POR e l j , t ​ is the planned lot size.

U j , w U_{j, w} U j , w ​ is the run time per unit in standard hours.

Rated Work Center Capacity

Theoretical nominal hours must be discounted by machine availability and worker productivity:

Rated Capacity = N × H shift × S × D × Utilization × Efficiency \text{Rated Capacity} = N \times H_{\text{shift}} \times S \times D \times \text{Utilization} \times \text{Efficiency} Rated Capacity = N × H shift ​ × S × D × Utilization × Efficiency

Where:

N N N : Number of machines or operators.

H shift H_{\text{shift}} H shift ​ : Working hours per shift.

S S S : Number of shifts per day.

D D D : Operating days per period.

Utilization \text{Utilization} Utilization : Actual Operating Hours Scheduled Clock Hours ≤ 1.0 \frac{\text{Actual Operating Hours}}{\text{Scheduled Clock Hours}} \le 1.0 Scheduled Clock Hours Actual Operating Hours ​ ≤ 1.0 .

Efficiency \text{Efficiency} Efficiency : Standard Hours Produced Actual Operating Hours \frac{\text{Standard Hours Produced}}{\text{Actual Operating Hours}} Actual Operating Hours Standard Hours Produced ​ .

Resolving Load Discrepancies

When CRP detects an overload condition ( Load w , t > Rated Capacity \text{Load}_{w, t} > \text{Rated Capacity} Load w , t ​ > Rated Capacity ), closed-loop MRP requires intervention:

Short-Term Adjustments: Authorize overtime shifts, re-route operations to alternate work centers, split large production batches, or hire temporary contract labor.

Schedule Adjustments: Pull forward planned releases into earlier periods with surplus capacity (load leveling).

MPS Revision: If capacity cannot be expanded, the Master Production Schedule must be revised downward in the slushy or liquid zones.