Study guide
15.9 Material Requirements Planning, Scheduling & Sequencing
Coal India Management Trainee CIL MT
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: CIL MT Exam Overview & Coal Sector Landscape
1.1 CIL MT Exam Pattern, Marking Scheme & Strategy 1.2 Coal India Limited: Corporate Structure, Maharatna Status & Subsidiaries 1.3 Indian Coal Mining Sector, Energy Mix & Environmental Regulations
2 Chapter 2: Paper-I General Awareness, Polity & Current Affairs
2.1 Indian Constitution, Governance & Statutory Bodies 2.2 Indian Economy, Union Budget & Economic Planning 2.3 Indian Geography, Mineral Belts & Environmental Ecology 2.4 Modern Indian History, Freedom Struggle & Cultural Heritage 2.5 General Science: Physics, Chemistry & Biology Fundamentals 2.6 Inventions, Discoveries & Scientific-Technological Development 2.7 Uses of Internet, Computer Awareness & Digital Governance 2.8 National & International Organisations 2.9 Awards, Honours & Sports 2.10 Books & Authors, Important Monuments & Places of India 2.11 Ports, Power Plants & Infrastructure of India 2.12 Climate Change, SDGs, National Parks & Wildlife Sanctuaries 2.13 Flagship Government Programmes & Current Affairs Method 2.14 World Physical, Social & Economic Geography
3 Chapter 3: Paper-I Reasoning & Logical Ability
3.1 Series Completion, Coding-Decoding & Semantic Analogies 3.2 Syllogisms, Logical Deduction & Venn Diagrams 3.3 Seating Arrangements, Linear/Circular Alignments & Puzzles 3.4 Direction Sense, Blood Relations & Order/Ranking 3.5 Alphabetical & Alphanumeric Series 3.6 Statement & Conclusions, Statement & Arguments 3.7 Clocks & Calendars 3.8 Cubes, Dice & Figure Counting 3.9 Mirror Images, Water Images, Embedded Figures & Non-Verbal Series 3.10 Decision Making & Data Analysis in Reasoning
4 Chapter 4: Paper-I Numerical Ability & Quantitative Aptitude
4.1 Arithmetic Foundations: Percentages, Profit & Loss, Ratio & Proportion 4.2 Averages, Simple/Compound Interest, Alligations & Mixtures 4.3 Time & Work, Pipes & Cisterns, Time, Speed & Distance 4.4 Algebra, Mensuration, Geometry & Data Interpretation (DI) 4.5 Number System, LCM, HCF & Decimal Fractions 4.6 Surds, Indices & Simplification 4.7 Problems on Ages 4.8 Boats & Streams and Problems on Trains 4.9 Permutations & Combinations 4.10 Probability for Quantitative Aptitude
5 Chapter 5: Paper-I General English & Verbal Ability
5.1 English Grammar, Error Spotting & Sentence Correction 5.2 Vocabulary Building: Synonyms, Antonyms, Idioms & Phrases 5.3 Reading Comprehension, Cloze Tests & Para Jumbles 5.4 Fill in the Blanks, Cloze Passages & Sentence Completion 5.5 Jumbled Sentences & Sentence Improvement
6 Chapter 6: Paper-II Engineering Mathematics
6.1 Matrix Algebra, Rank & Systems of Linear Equations 6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem 6.3 Limits, Continuity, Differentiability & Mean Value Theorems 6.4 Maxima-Minima, Indeterminate Forms & Taylor Series 6.5 Definite, Improper, Double & Triple Integrals 6.6 Partial Derivatives, Total Derivative & Multivariable Optimisation 6.7 First-Order Differential Equations: Linear & Non-Linear 6.8 Higher-Order Linear Differential Equations & Engineering Applications 6.9 Laplace Transforms & Transfer-Function Methods 6.10 Probability, Conditional Probability & Bayes' Theorem 6.11 Random Variables, Distributions & Descriptive Statistics 6.12 Numerical Methods: Root Finding, Integration & ODE Solvers
7 Chapter 7: Paper-II Engineering Mechanics & Statics-Dynamics
7.1 Force Systems, Coplanar Equilibrium & Lami's Theorem 7.2 Plane Trusses, Friction Mechanics & Screws/Wedges 7.3 Centroids, Center of Gravity & Moment of Inertia 7.4 Kinematics, Kinetics of Particles & Rigid Body Dynamics 7.5 Virtual Work & Lagrange's Equation 7.6 Rolling Friction, Belt-Pulley Drives, Brakes, Clutches & Vehicle Dynamics
8 Chapter 8: Paper-II Mechanics of Materials & Structural Integrity
8.1 Simple Stresses, Strains, Elastic Moduli & Thermal Stresses 8.2 Principal Stresses, Strain Energy & Mohr's Circle 8.3 Shear Force & Bending Moment Diagrams, Beam Bending & Shear Stresses 8.4 Torsion of Circular Shafts, Springs & Column Buckling 8.5 Thin Cylinders, Spheres & Thick-Walled Pressure Vessels 8.6 Deflection of Beams: Double Integration, Macaulay & Moment-Area 8.7 Shear Centre & Unsymmetrical Bending 8.8 Strain Gauges, Rosettes & Experimental Stress Analysis 8.9 Mechanical Testing: Universal Testing Machine, Hardness & Impact
9 Chapter 9: Paper-II Theory of Machines & Mechanical Vibrations
9.1 Simple Mechanisms, Kinematic Inversions & Velocity/Acceleration Diagrams 9.2 Cams & Followers, Toothed Gearing & Epicyclic Gear Trains 9.3 Flywheels, Centrifugal/Inertia Governors & Rotor Balancing 9.4 Free, Damped & Forced Single-Degree-of-Freedom Vibrations 9.5 Gyroscopic Couple & Gyroscopic Effects
10 Chapter 10: Paper-II Machine Design & Failure Theories
10.1 Static Failure Theories & Variable/Fatigue Loading 10.2 Design of Threaded Fasteners, Welded & Riveted Joints 10.3 Design of Shafts, Keys, Couplings & Rolling/Sliding Bearings 10.4 Design of Spur, Helical, Bevel & Worm Gears 10.5 Design of Helical, Leaf & Torsion Springs 10.6 Design of Brakes & Clutches: Energy, Lining Pressure & Heat
11 Chapter 11: Paper-II Fluid Mechanics & Hydraulic Machinery
11.1 Fluid Properties, Hydrostatic Forces & Buoyancy 11.2 Fluid Kinematics, Continuity & Bernoulli's Equation 11.3 Viscous Flow in Pipes, Boundary Layer & Minor Losses 11.4 Hydraulic Turbines, Centrifugal & Reciprocating Pumps 11.5 Dimensional Analysis, Similitude & Model Testing 11.6 Control-Volume Analysis: Continuity, Momentum & Energy
12 Chapter 12: Paper-II Thermodynamics, Thermal Cycles & Turbomachinery
12.1 Fundamental Concepts, First & Second Laws of Thermodynamics 12.2 Entropy, Availability, Exergy & Properties of Pure Substances 12.3 Air-Standard Gas Power Cycles: Otto, Diesel, Dual & Brayton 12.4 Vapour Power Cycles: Ideal, Reheat & Regenerative Rankine Cycles 12.5 Thermodynamic Relations: Maxwell, Clausius-Clapeyron & Joule-Thomson 12.6 Behaviour of Ideal & Real Gases and Equations of State 12.7 Air & Gas Compressors: Reciprocating, Rotary & Multi-Stage 12.8 Steam & Gas Turbines: Impulse, Reaction & Velocity Diagrams
13 Chapter 13: Paper-II Heat Transfer, Refrigeration & Air Conditioning
13.1 Steady & Unsteady Conduction, Extended Surfaces (Fins) 13.2 Forced/Natural Convection, Radiation & Heat Exchanger LMTD/NTU 13.3 Vapour Compression & Vapour Absorption Refrigeration Systems 13.4 Psychrometric Properties, Processes & Air Conditioning Systems 13.5 Gas Refrigeration, Heat Pump Cycles & Cryogenics
14 Chapter 14: Paper-II Materials Science, Metallurgy & Manufacturing Technology
14.1 Crystal Structures, Phase Diagrams & Iron-Iron Carbide Equilibrium 14.2 Heat Treatment Processes & Engineering Alloy Steels 14.3 Casting Processes, Metal Forming & Welding Metallurgy 14.4 Metal Cutting Mechanics, Tool Life & Machine Tools 14.5 Plastic Deformation, Yield Criteria & Load Estimation in Bulk Forming 14.6 Sheet Metal Forming: Shearing, Bending & Deep Drawing 14.7 Powder Metallurgy 14.8 Brazing, Soldering & Adhesive Bonding 14.9 Non-Traditional Machining: EDM, ECM, USM, AJM, LBM & EBM 14.10 Abrasive Machining, Grinding & Superfinishing 14.11 Principles of Work Holding, Jigs & Fixtures 14.12 Economics of Machining & Tool Life Optimisation
15 Chapter 15: Paper-II Metrology, Quality Control & Industrial Engineering / OR
15.1 Limits, Fits, Tolerances, Gauges & Surface Metrology 15.2 Production Planning, Forecasting & Inventory Control Models 15.3 Operations Research: Linear Programming & Transportation/Assignment 15.4 Project Management: CPM, PERT, Network Analysis & Crashing 15.5 Comparators & Interferometry 15.6 Coordinate Measuring Machines & Machine Tool Alignment Testing 15.7 Computer Integrated Manufacturing: CAD/CAM & Integration Tools 15.8 NC/CNC Machines & CNC Part Programming 15.9 Material Requirements Planning, Scheduling & Sequencing 15.10 Queuing Theory & Simple Queuing Models 15.11 Network Flow Models: Shortest Route, Maximal Flow & Spanning Tree
15.9 Material Requirements Planning, Scheduling & Sequencing
Key Takeaways Explain This Topic AI
Scheduling and materials requirement planning are both named in the Production Planning and Control bullet of the CIL Mechanical Paper-II syllabus.
MRP explodes the master production schedule through the bill of materials and offsets each requirement by its lead time to determine when orders must be released.
MRP applies to dependent demand items whose requirements are calculated, whereas reorder-point inventory systems apply to independent demand items whose requirements are forecast.
Johnson's rule sequences n jobs through two machines to minimise the total elapsed time by scheduling the shortest processing time first if it is on machine one and last if it is on machine two.
Last updated: August 2026
Dependent Versus Independent Demand
The single idea that justifies MRP is the distinction between two kinds of demand.
- Demand type Character Correct approach
- Independent Demand for a finished product, driven by the market Forecast it; use reorder point and EOQ methods
- Dependent Demand for a component, driven entirely by the demand for its parent Calculate it; use MRP
If a shovel bucket needs six teeth, then the demand for teeth is not a matter for forecasting. It is arithmetic: six times the number of buckets. Applying reorder-point logic to dependent items produces the classic symptom of holding stock of every component while still being short of the one required.
Inputs to MRP
- Input Content
- Master Production Schedule (MPS) What end items are to be made, in what quantity, in which period
- Bill of Materials (BOM) The product structure: which components go into which assemblies, and how many
- Inventory Records On-hand quantity, quantities already on order, lead times, lot sizing rules, safety stock
The bill of materials is structured in levels , with the finished product at level 0, its major assemblies at level 1, their components at level 2, and so on. Where an item appears at more than one level, low-level coding assigns it the lowest level at which it occurs, so that all its requirements are accumulated before it is planned.
The MRP Logic
For each item, working down level by level:
Gross requirements — the total quantity needed in each period, taken from the parent's planned order releases.
Scheduled receipts — quantities already ordered and due to arrive.
Projected on hand — the balance carried forward.
Net requirements = Gross requirements minus scheduled receipts minus projected on hand available.
Planned order receipts — when the net requirement must arrive, adjusted for lot sizing.
Planned order releases — the receipt date offset backwards by the lead time .
The planned order releases at one level become the gross requirements at the next level down. This cascade is called the BOM explosion , and the backwards shift is lead time offsetting .
Worked example
A hydraulic cylinder assembly is required in quantity 100 in week 8. Each assembly uses 2 seal kits. Seal kits have a lead time of 3 weeks, 40 are in stock, and none are on order.
- Item Value
- Gross requirement for seal kits, week 8 100 × 2 = 200 100\times2 = 200 100 × 2 = 200
- Less on hand 40
- Net requirement 160
- Planned order receipt 160 in week 8
- Planned order release 160 in week 5 (8 minus 3 weeks lead time)
If the assembly's own lead time is 2 weeks, the seal kits are actually needed for assembly start in week 6, and the calculation would offset from there instead — a distinction that matters in practice and is a common source of error.
Lot Sizing Rules
- Rule Method
- Lot for lot Order exactly the net requirement each period; minimum inventory, maximum number of setups
- Fixed order quantity / EOQ A standard quantity each time
- Period order quantity Cover a fixed number of periods
- Least unit cost / part period balancing Heuristics balancing setup against holding cost
- MRP Outputs and Extensions
Outputs include planned order releases, rescheduling notices for existing orders, cancellation notices, and exception reports where a requirement cannot be met.
- System Scope
- MRP Material planning only
- Closed-loop MRP Adds capacity requirements planning and feedback from the shop floor
- MRP II Manufacturing Resource Planning; adds finance, marketing and engineering to a single plan
- ERP Enterprise Resource Planning; extends across the whole enterprise
- Limitations
MRP assumes fixed lead times independent of load, and infinite capacity unless capacity planning is added. Both assumptions fail in a congested shop, where lead time actually grows with queue length. It also depends critically on data accuracy : an inventory record error or an out-of-date bill of materials propagates through every dependent item. The commonly quoted requirement is inventory accuracy above 95% and bill of materials accuracy above 98% before MRP is worth implementing at all.
Scheduling and Sequencing
Scheduling assigns start and finish times to operations. Sequencing decides the order in which jobs waiting at a machine are processed. The two are related but distinct.
Key measures
- Measure Definition
- Flow time Time a job spends in the system: completion time minus arrival time
- Makespan Total elapsed time to complete all jobs
- Lateness Completion time minus due date; may be negative
- Tardiness Lateness if positive, otherwise zero
- Utilisation Productive time as a fraction of available time
- Priority Sequencing Rules
Rule Basis Minimises
SPT Shortest Processing Time Shortest job first Average flow time and average number of jobs in system; provably optimal for a single machine
- EDD Earliest Due Date Nearest due date first Maximum lateness
- FCFS First Come First Served Arrival order Nothing in particular; but is perceived as fair
- LPT Longest Processing Time Longest job first Useful for balancing parallel machines
CR Critical Ratio (Due date minus now) divided by remaining processing time Responsive to due dates; ratio below 1 means the job is behind
Slack per operation Slack divided by remaining operations Balances urgency across routings
Two results are worth memorising because they are provable and frequently examined:
SPT minimises mean flow time on a single machine. Its weakness is that long jobs may be indefinitely postponed.
EDD minimises maximum lateness on a single machine.
Note that SPT does not minimise the number of tardy jobs — that requires Moore's algorithm — and EDD does not minimise average lateness.
Johnson's Rule: Two Machines, n Jobs
For n n n jobs that must pass through two machines in the same order , Johnson's rule finds the sequence that minimises makespan .
Procedure
List the processing times of every job on both machines.
Find the smallest processing time in the whole table.
If it lies on Machine 1 , schedule that job as early as possible (leftmost free position). If it lies on Machine 2 , schedule it as late as possible (rightmost free position).
Delete that job and repeat until every position is filled.
Break ties arbitrarily; the makespan is unaffected.
Worked example
Five jobs must be turned then milled:
- Job Turning (M1) Milling (M2)
- A 5 2
- B 1 6
- C 9 7
- D 3 8
- E 10 4
Smallest overall is 1 (job B on M1) so B goes first . Next smallest is 2 (job A on M2) so A goes last . Next is 3 (job D on M1) so D goes second . Next is 4 (job E on M2) so E goes second-last . C takes the remaining middle slot. Optimal sequence: B → D → C → E → A \text{Optimal sequence: } B \to D \to C \to E \to A Optimal sequence: B → D → C → E → A
Computing the makespan:
- Job M1 in M1 out M2 in M2 out
- B 0 1 1 7
- D 1 4 7 15
- C 4 13 15 22
- E 13 23 23 27
- A 23 28 28 30
The makespan is 30 , and machine 2 idle time totals 1 unit at the start plus 1 unit between C and E.
Extension to Three Machines
Johnson's rule extends to three machines only if at least one of the following holds: min ( M 1 ) ≥ max ( M 2 ) or min ( M 3 ) ≥ max ( M 2 ) \min(M_1) \geq \max(M_2) \quad\text{or}\quad \min(M_3) \geq \max(M_2) min ( M 1 ) ≥ max ( M 2 ) or min ( M 3 ) ≥ max ( M 2 )
That is, the middle machine must be dominated. When the condition holds, form two pseudo-machines: G = M 1 + M 2 , H = M 2 + M 3 G = M_1 + M_2, \qquad H = M_2 + M_3 G = M 1 + M 2 , H = M 2 + M 3
and apply the two-machine rule to G G G and H H H . If the condition fails, no simple optimal rule exists and heuristics or enumeration must be used.
Gantt Charts and Loading
The Gantt chart remains the standard visual scheduling tool, plotting machines or jobs against time as horizontal bars. A load chart shows the workload assigned to each machine against its available capacity, immediately revealing bottlenecks.
Finite loading respects capacity limits and schedules accordingly; infinite loading assigns work regardless of capacity and leaves overloads visible for the planner to resolve. Standard MRP uses infinite loading, which is precisely why capacity requirements planning has to be bolted on to make closed-loop MRP work.
Application to a coal workshop
In a subsidiary's central repair workshop, the mix is characteristically high variety and low volume , with urgent breakdown work interrupting planned overhauls. In that setting, pure SPT would starve the large overhauls indefinitely, while pure FCFS would delay urgent breakdowns. Practice generally uses a critical ratio or slack-based rule, which keeps due dates in view while remaining responsive, with genuine breakdown work given a separate expedite priority.