Study guide
15.4 Project Management: CPM, PERT, Network Analysis & Crashing
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.4 Project Management: CPM, PERT, Network Analysis & Crashing
Key Takeaways Explain This Topic AI
CPM is an activity-oriented deterministic model with single time estimates, whereas PERT is an event-oriented probabilistic model using Beta-distributed durations
Expected PERT activity duration is t_e = (t_o + 4*t_m + t_p)/6 and variance is sigma^2 = ((t_p - t_o)/6)^2; variances along the critical path are additive
Total Float is TF = LF_j - ES_i - t_ij, Free Float is FF = ES_j - ES_i - t_ij, and Independent Float is IF = max(0, ES_j - LF_i - t_ij), maintaining TF >= FF >= IF
The project completion probability is evaluated via Z = (T_s - T_e) / sigma_proj using standard normal distribution z-tables
Crashing prioritizes critical activities with the lowest cost slope S = (CC - NC) / (NT - CT) until crashing cost matches marginal overhead savings
Last updated: August 2026
Project Management: CPM, PERT, Network Analysis & Crashing
Infrastructure expansion projects in Coal India Limited—such as commissioning a 10 Mtpa coal washery, erecting a cross-country overland belt conveyor, or sinking a new vertical mine shaft—involve thousands of interdependent activities, stringent safety deadlines, and substantial capital outlays. Network analysis techniques (CPM and PERT) provide the rigorous mathematical backbone for project scheduling, risk assessment, and time-cost trade-off optimization.
- 1. Network Construction Rules & Representation
- Network Notations
Activity-on-Arrow (AOA): Arrows represent activities consuming time and resources; nodes (circles) represent instantaneous events (milestones).
Activity-on-Node (AON / Precedence Diagramming): Nodes represent activities; arrows represent precedence relationships. Eliminates the need for dummy activities. AOA Model: [Event 1] ---- Activity A (t) ----> [Event 2]
- AON Model: +---------------+ +---------------+
- | Activity A | -------> | Activity B |
- +---------------+ +---------------+
- Network Construction Rules
Each activity is uniquely identified by its tail (start) event i i i and head (end) event j j j ( i < j i < j i < j ).
No two activities can share both identical starting and identical ending events.
Dummy Activities ( − − − → -\!-\!-\to − − − → ): Fictitious activities with zero duration and zero resource consumption used to:
Maintain unique numerical identity between parallel activities.
Establish correct logical precedence without introducing unintended false dependencies.
Common Network Errors:
Looping / Cycling: Circular dependency path ( A → B → C → A A \to B \to C \to A A → B → C → A ), preventing project completion.
Dangling: An intermediate event having incoming arrows but no outgoing arrows (disconnect from the final project milestone).
Fulkerson's Rule for Node Numbering:
The initial project event has no incoming arrows; label it node 1 1 1 .
Delete all outgoing arrows from node 1 1 1 . Identify new nodes with no remaining incoming arrows and number them 2 , 3 , … 2, 3, \dots 2 , 3 , … consecutively.
Repeat until the final event is reached. For every activity ( i , j ) (i, j) ( i , j ) , i < j i < j i < j .
2. Critical Path Method (CPM - Deterministic)
CPM assumes deterministic (single, well-known) activity durations derived from standard work study data. FORWARD PASS (Earliest Times)
- ES_j = max { EF_i } = max { ES_i + t_ij }
- |
- v
- BACKWARD PASS (Latest Times)
- LF_i = min { LS_j } = min { LF_j - t_ij }
- Forward Pass Computations (Earliest Times)
Earliest Start Time ( E S i ES_i E S i ): Earliest time an activity can begin: E S 1 = 0 , E S j = max i { E S i + t i j } = max i { E F i j } ES_1 = 0, \quad ES_j = \max_{i} \{ ES_i + t_{ij} \} = \max_i \{ EF_{ij} \} E S 1 = 0 , E S j = i max { E S i + t ij } = i max { E F ij }
Earliest Finish Time ( E F i j EF_{ij} E F ij ): E F i j = E S i + t i j EF_{ij} = ES_i + t_{ij} E F ij = E S i + t ij
Backward Pass Computations (Latest Times)
Latest Finish Time ( L F j LF_j L F j ): Latest time an activity can finish without delaying overall project completion: L F terminal = E S terminal = T E , L F i = min j { L F j − t i j } = min j { L S i j } LF_{\text{terminal}} = ES_{\text{terminal}} = T_E, \quad LF_i = \min_j \{ LF_j - t_{ij} \} = \min_j \{ LS_{ij} \} L F terminal = E S terminal = T E , L F i = j min { L F j − t ij } = j min { L S ij }
Latest Start Time ( L S i j LS_{ij} L S ij ): L S i j = L F j − t i j LS_{ij} = LF_j - t_{ij} L S ij = L F j − t ij
- Detailed Float Formulations
- Float (or slack) represents schedule flexibility. ES_i EF_ij LF_j
- |===============================|------------------------|
- |<------ Duration t_ij -------->|<---- TOTAL FLOAT ----->|
- |===============================|------------|-----------|
- |<-- FREE -->|<- HEAD ->|
- | FLOAT | SLACK |
Total Float ( T F i j TF_{ij} T F ij ): Maximum time by which an activity can be delayed without delaying the overall project completion time: T F i j = L F j − E F i j = L S i j − E S i = L F j − E S i − t i j \mathbf{TF_{ij} = LF_j - EF_{ij} = LS_{ij} - ES_i = LF_j - ES_i - t_{ij}} T F ij = L F j − E F ij = L S ij − E S i = L F j − E S i − t ij
Free Float ( F F i j FF_{ij} F F ij ): Maximum time by which an activity can be delayed without delaying the earliest start of any immediately succeeding activity: F F i j = E S j − E F i j = E S j − E S i − t i j = T F i j − S j \mathbf{FF_{ij} = ES_j - EF_{ij} = ES_j - ES_i - t_{ij} = TF_{ij} - S_j} F F ij = E S j − E F ij = E S j − E S i − t ij = T F ij − S j (where S j = L F j − E S j S_j = LF_j - ES_j S j = L F j − E S j is the head event slack) .
Independent Float ( I F i j IF_{ij} I F ij ): Time by which an activity can be delayed if preceding activities finish at their latest times and succeeding activities start at their earliest times. It affects no other activity in the network: I F i j = max ( 0 , E S j − L F i − t i j ) = max ( 0 , F F i j − S i ) \mathbf{IF_{ij} = \max(0, \; ES_j - LF_i - t_{ij}) = \max(0, \; FF_{ij} - S_i)} I F ij = max ( 0 , E S j − L F i − t ij ) = max ( 0 , F F ij − S i ) (where S i = L F i − E S i S_i = LF_i - ES_i S i = L F i − E S i is the tail event slack) .
Interfering Float ( I T F i j ITF_{ij} I T F ij ): The portion of total float that consumes head event slack: I T F i j = T F i j − F F i j = S j ITF_{ij} = TF_{ij} - FF_{ij} = S_j I T F ij = T F ij − F F ij = S j
Fundamental Float Hierarchy: T F i j ≥ F F i j ≥ I F i j ≥ 0 \mathbf{TF_{ij} \ge FF_{ij} \ge IF_{ij} \ge 0} T F ij ≥ F F ij ≥ I F ij ≥ 0
Critical Path Identification: The critical path is the continuous chain of activities connecting the start event to the end event where Total Float is minimum (zero) ( T F = 0 , F F = 0 , I F = 0 TF = 0, FF = 0, IF = 0 TF = 0 , FF = 0 , I F = 0 ). It is the longest duration path through the network.
3. Program Evaluation and Review Technique (PERT - Probabilistic)
PERT is designed for R&D and non-repetitive projects where activity durations are uncertain. It models activity duration t t t as a Beta distribution defined by three time estimates. Probability ^
- Density | Most Likely (tm)
- | /\
- | / \
- | Optimistic / \ Pessimistic
- | (to) / \ (tp)
- | | / \ |
- 0 +-------+----+----------+-----+-----> Time (t)
- |<- te ->|
- Three Time Estimates
Optimistic Time ( t o t_o t o ): Minimum possible duration if everything proceeds exceptionally well (probability < 1 % < 1\% < 1% of occurring faster).
Most Likely Time ( t m t_m t m ): Modal duration under normal working conditions.
Pessimistic Time ( t p t_p t p ): Maximum duration if adverse conditions and bottlenecks occur (probability < 1 % < 1\% < 1% of exceeding).
Statistical Parameters of PERT
Expected Activity Duration ( t e t_e t e ): Weighted mean of the Beta distribution: t e = t o + 4 t m + t p 6 \mathbf{t_e = \frac{t_o + 4 t_m + t_p}{6}} t e = 6 t o + 4 t m + t p
Activity Variance ( σ 2 \sigma^2 σ 2 ) and Standard Deviation ( σ \sigma σ ): σ 2 = ( t p − t o 6 ) 2 , σ = t p − t o 6 \mathbf{\sigma^2 = \left(\frac{t_p - t_o}{6}\right)^2, \quad \sigma = \frac{t_p - t_o}{6}} σ 2 = ( 6 t p − t o ) 2 , σ = 6 t p − t o
Project Duration Statistics & Central Limit Theorem
By the Central Limit Theorem , the sum of independent random activity durations along the critical path converges to a Normal Distribution N ( T e , σ proj 2 ) \mathcal{N}(T_e, \sigma_{\text{proj}}^2) N ( T e , σ proj 2 ) :
Expected Project Completion Time ( T e T_e T e ): T e = ∑ k ∈ Critical Path t e , k T_e = \sum_{k \in \text{Critical Path}} t_{e, k} T e = k ∈ Critical Path ∑ t e , k
Project Variance ( σ proj 2 \sigma_{\text{proj}}^2 σ proj 2 ): σ proj 2 = ∑ k ∈ Critical Path σ k 2 \sigma_{\text{proj}}^2 = \sum_{k \in \text{Critical Path}} \sigma_k^2 σ proj 2 = k ∈ Critical Path ∑ σ k 2
Project Standard Deviation ( σ proj \sigma_{\text{proj}} σ proj ): σ proj = ∑ k ∈ Critical Path σ k 2 \sigma_{\text{proj}} = \sqrt{\sum_{k \in \text{Critical Path}} \sigma_k^2} σ proj = k ∈ Critical Path ∑ σ k 2 (Crucial Rule: Variances add along the critical path; standard deviations do NOT add algebraically).
Probability of Meeting a Target Schedule Date ( T s T_s T s )
The standard normal deviate Z Z Z is computed as: Z = T s − T e σ proj \mathbf{Z = \frac{T_s - T_e}{\sigma_{\text{proj}}}} Z = σ proj T s − T e STANDARD NORMAL DISTRIBUTION (Z-VALUES)
- ------------------------------------------------------------------------
- Z = -2.0 --> P = 2.28% | Z = +0.0 --> P = 50.00%
- Z = -1.0 --> P = 15.87% | Z = +1.0 --> P = 84.13%
- Z = -0.5 --> P = 30.85% | Z = +1.28 --> P = 90.00%
- Z = +0.67 --> P = 75.00% | Z = +2.0 --> P = 97.72%
- 4. Project Crashing and Time-Cost Optimization
Project crashing compresses total project duration by allocating additional direct resources (overtime, extra shifts, special equipment) to critical activities. Cost ^
- | Crash Point (CT, CC)
- CC | *
- | \ Cost Slope = (CC - NC) / (NT - CT)
- | \
- NC |---------\---------* Normal Point (NT, NC)
- | \ |
- | \ |
- 0 +------------+------+------------------> Time
- CT NT
- Key Parameters
Normal Time ( N T NT NT ) & Normal Cost ( N C NC NC ): Standard baseline duration and direct cost.
Crash Time ( C T CT CT ) & Crash Cost ( C C CC CC ): Minimum achievable duration and resulting inflated direct cost.
Cost Slope ( S S S ): Marginal direct cost per unit time saved: S = Crash Cost − Normal Cost Normal Time − Crash Time = Δ C Δ t \mathbf{S = \frac{\text{Crash Cost} - \text{Normal Cost}}{\text{Normal Time} - \text{Crash Time}} = \frac{\Delta C}{\Delta t}} S = Normal Time − Crash Time Crash Cost − Normal Cost = Δt ΔC
Total Project Cost Components
Direct Costs: Increase monotonically as duration is shortened.
Indirect (Overhead) Costs: Decrease linearly with shortened duration ( C ind = daily overhead × T C_{\text{ind}} = \text{daily overhead} \times T C ind = daily overhead × T ).
Optimal Project Duration: Occurs at the minimum point of the Total Cost Curve ( T C = Direct + Indirect TC = \text{Direct} + \text{Indirect} TC = Direct + Indirect ), where marginal crashing cost slope equals the daily indirect cost rate. Cost ^
- | \ / Total Cost Curve
- | \ /
- | Direct \ Opt. / Indirect Cost
- | Cost \ * / (Overhead)
- | \/ / /
- |___________/\_/_____/_____________
- 0 | --> Duration
- Optimal Time
- Systematic Project Crashing Algorithm
Calculate the critical path, initial project duration T E T_E T E , and baseline total cost (Sum of all Normal Direct Costs + Indirect Costs for T E T_E T E ).
Calculate the Cost Slope S S S for every network activity.
Identify the active critical path(s) .
Among critical activities that have remaining crash capability ( N T > C T NT > CT NT > CT ), select the activity with the lowest Cost Slope ( S S S ) .
If parallel critical paths exist, crash activities simultaneously on all parallel paths such that ∑ S \sum S ∑ S is minimized, or crash a single common critical activity.
Crash the selected activity by the maximum permissible amount until:
The activity reaches its crash limit ( C T CT CT ), or
A new parallel path becomes critical.
Recalculate critical paths and total costs. Repeat steps 4–6 until no further crashing is possible or the cost slope exceeds the daily indirect cost rate.