Study guide

12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling

FE Industrial and Systems Study Guide Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview, CBT Strategy & Handbook Navigation

1.1 FE Industrial Exam Structure, CBT Logistics, and Pacing 1.2 Using the NCEES FE Reference Handbook and Approved Calculators

2 Chapter 2: Mathematics for Industrial Engineers

2.1 Analytic Geometry, Coordinate Systems, and Trigonometry 2.2 Calculus: Differential, Integral, and Series Approximations 2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors

3 Chapter 3: Engineering Sciences Core

3.1 Thermodynamics Fundamentals and Fluid Flow Principles 3.2 Statics, Dynamics, and Mechanics of Materials Core 3.3 Electrical Circuits, DC/AC Analysis, and Power in Industrial Systems

4 Chapter 4: Ethics and Professional Practice

4.1 NCEES Model Rules of Professional Conduct and Technical Society Ethics 4.2 Engineering Licensure, Public Welfare, and Professional Liability 4.3 Engineering Contracts, Intellectual Property, and Conflicts of Interest

5 Chapter 5: Engineering Economics

5.1 Time Value of Money, Discount Factors, and Equivalence 5.2 Evaluating Alternatives: Present Worth, Equivalent Annual Cost, and IRR 5.3 Incremental Rate of Return, Replacement Analysis, and Break-Even 5.4 Depreciation Methods, MACRS, Income Taxes, and Inflation

6 Chapter 6: Probability Foundations & Distributions

6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem 6.2 Discrete Probability Distributions 6.3 Continuous Probability Distributions

7 Chapter 7: Statistical Inference, Regression & Design of Experiments

7.1 Sampling Distributions, Central Limit Theorem, and Confidence Intervals 7.2 Hypothesis Testing: Means, Proportions, and Variances 7.3 Linear Regression, Correlation Analysis, and Design of Experiments (ANOVA)

8 Chapter 8: Data, Logic, Modeling & Linear Programming

8.1 Optimization Modeling: Decision Variables, Objectives, and Constraints 8.2 Linear Programming: Graphical Solutions and Simplex Fundamentals 8.3 Duality, Sensitivity Analysis, and Integer Linear Programming 8.4 Data, Logic Development, and Analytics

9 Chapter 9: Stochastic Models & Simulation

9.1 Queuing Theory: Little's Law, M/M/1, and Multi-Server Systems 9.2 Discrete-Time Markov Chains: Transition Matrices and Steady-State Probabilities 9.3 Discrete-Event Simulation Principles and Monte Carlo Modeling

10 Chapter 10: Engineering Management, Project Planning & Performance Measurement

10.1 Organizational Structure, Leadership, and Worker Motivation Theories 10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing 10.3 Earned Value Management (EVM), Decision Trees, and Risk Preference 10.4 Performance Measurement: Productivity, KPIs, Wage Systems, and the Balanced Scorecard

11 Chapter 11: Manufacturing & Production Systems

11.1 Manufacturing Processes, Material Processing, and Tolerancing 11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput 11.3 Sustainable Manufacturing, Waste Minimization, and Life-Cycle Assessment

12 Chapter 12: Production Planning, Inventory Control & Sequencing

12.1 Demand Forecasting Methods and Forecast Error Tracking 12.2 Aggregate Planning, Master Production Scheduling (MPS), and MRP 12.3 Deterministic Inventory Models: EOQ, EPQ, and Safety Stock 12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling

13 Chapter 13: Lean Systems & Theory of Constraints

13.1 Lean Foundations: Value Stream Mapping, Seven Wastes, and 5S 13.2 Pull Systems, Kanban, Just-In-Time (JIT), and SMED Setup Reduction 13.3 Theory of Constraints: Bottleneck Identification and Drum-Buffer-Rope

14 Chapter 14: Facilities Planning & Material Handling

14.1 Facility Location Analysis: Qualitative Factor Rating and Centroid Method 14.2 Facility Layout Design and Flow Analysis 14.3 Material Handling Equipment, Warehousing, and AS/RS

15 Chapter 15: Supply Chain Design & Logistics

15.1 Supply Chain Network Architecture and Transportation Modes 15.2 Distribution Strategies, Cross-Docking, and Vehicle Routing 15.3 The Bullwhip Effect, Risk Pooling, and Supply Chain Coordination

16 Chapter 16: Human Factors & Cognitive Ergonomics

16.1 Cognitive Engineering, Human-Machine Interface, Displays, and Controls 16.2 Anthropometric Principles, Percentile Design, and Biomechanical Posture 16.3 Environmental Ergonomics: Industrial Noise, Lighting, and Heat Stress

17 Chapter 17: Physical Ergonomics & Workplace Safety

17.1 Physical Ergonomics: The NIOSH Manual Lifting Equation 17.2 Cumulative Trauma Disorders and Postural Assessment 17.3 Workplace Safety: OSHA Standards, Hazard Analysis, and Control Hierarchy

18 Chapter 18: Work Design & Measurement

18.1 Methods Engineering, Process Charting, and Principles of Motion Economy 18.2 Direct Stopwatch Time Study: Observed Time, Performance Rating, and Allowances 18.3 Predetermined Time Systems, Work Sampling, and Learning Curves

19 Chapter 19: Quality Management, Six Sigma & Analytical Tools

19.1 Quality Philosophies, Total Quality Management, and Cost of Quality 19.2 Six Sigma DMAIC Methodology and Quality Function Deployment 19.3 The Seven Basic Quality Tools, Root Cause Analysis, and Taguchi Loss Function

20 Chapter 20: Statistical Process Control

20.1 Statistical Process Control Principles, Variation, and Run Rules 20.2 Variable Control Charts: X-bar & R, X-bar & S, and Individual-Moving Range 20.3 Attribute Control Charts: Defectives (p, np) and Defects (c, u)

21 Chapter 21: Process Capability & Acceptance Sampling

21.1 Process Capability Indices and Defect Levels 21.2 Acceptance Sampling Concepts and Operating Characteristic Curves 21.3 Sampling Risks, AQL, LTPD, and Standard Sampling Plans

22 Chapter 22: Systems Engineering & Life-Cycle Management

22.1 The Systems Engineering V-Model, Stakeholder Requirements, and Functional Architecture 22.2 Configuration Management, Interface Control, and Verification & Validation 22.3 Life-Cycle Costing, Maintainability, and System Availability

23 Chapter 23: Reliability Engineering & Risk Analysis

23.1 Reliability Mathematics, Hazard Rates, and the Bathtub Curve 23.2 System Reliability Configurations: Series, Parallel, and k-out-of-n Systems 23.3 Failure Modes and Effects Analysis and Fault Tree Analysis

12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling

Key Takeaways Explain This Topic AI

Sequencing performance is judged on flow time (completion minus release), lateness (completion minus due date, which may be negative), tardiness (lateness truncated at zero), makespan, and the number of tardy jobs.

On a single machine with all jobs available at time zero, Shortest Processing Time (SPT) provably minimizes mean flow time, mean lateness, mean waiting time, and average work-in-process.

Earliest Due Date (EDD) sequencing provably minimizes maximum lateness and maximum tardiness on a single machine, while Moore's algorithm minimizes the number of tardy jobs.

Critical Ratio, CR = (Due date - Today) / Remaining processing time, is a dynamic rule that re-ranks jobs every dispatch decision; CR < 1.0 means the job is already behind and CR > 1.0 means it has slack.

For a two-machine flow shop in which every job visits Machine 1 then Machine 2, Johnson's rule yields the makespan-minimizing sequence: repeatedly select the smallest remaining time, scheduling it earliest if it is on Machine 1 and latest if it is on Machine 2.

Last updated: September 2026

12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling

Aggregate planning sets the workforce, the master production schedule sets the end items, and MRP releases the orders. Sequencing answers the last and most immediate question on the shop floor: of the jobs now queued in front of this machine, which one runs next? The NCEES FE Industrial and Systems specification lists sequencing alongside inventory, aggregate planning, MRP, and the theory of constraints under Planning and Scheduling, and it is tested with short, fully computable single-machine and two-machine problems.

1. Scheduling Terminology and Performance Measures

Consider n n n jobs, all available at time zero, queued at a single work center. For job i i i let:

  • p i p_i p i ​ = processing time (including setup)
  • r i r_i r i ​ = release (ready) time; here r i = 0 r_i = 0 r i ​ = 0 for all jobs
  • d i d_i d i ​ = due date
  • C i C_i C i ​ = completion time under the chosen sequence

The standard measures follow directly:

Measure Definition Interpretation

Flow time F i F_i F i ​ F i = C i − r i F_i = C_i - r_i F i ​ = C i ​ − r i ​ (here = C i = C_i = C i ​ ) Total time the job spends in the shop; the job's manufacturing lead time

Waiting time W i W_i W i ​ W i = F i − p i W_i = F_i - p_i W i ​ = F i ​ − p i ​ Queue time, the non-value-added portion of flow time

Lateness L i L_i L i ​ L i = C i − d i L_i = C_i - d_i L i ​ = C i ​ − d i ​ Signed : negative means early, positive means late

Tardiness T i T_i T i ​ T i = max ⁡ ( 0 , L i ) T_i = \max(0, L_i) T i ​ = max ( 0 , L i ​ ) Never negative : earliness earns no credit

  • Makespan C max ⁡ C_{\max} C m a x ​ max ⁡ i C i \max_i C_i max i ​ C i ​ Time to finish the entire job set
  • Number tardy N T N_T N T ​ Count of jobs with T i > 0 T_i > 0 T i ​ > 0 How many customers are affected

Exam Watchout — Lateness versus Tardiness : Lateness can be negative; tardiness cannot. A job finishing 6 days early has lateness − 6 -6 − 6 and tardiness 0 0 0 . Averaging lateness across a job set therefore understates customer impact, which is why service targets are written on tardiness, not lateness.

Two Derived Quantities

On a single machine with no idle time, the makespan is fixed at ∑ p i \sum p_i ∑ p i ​ no matter what sequence is chosen. Two other quantities do change with sequence: F ˉ = 1 n ∑ i = 1 n F i Average number of jobs in the system = ∑ i = 1 n F i ∑ i = 1 n p i \bar{F} = \frac{1}{n}\sum_{i=1}^n F_i \qquad \text{Average number of jobs in the system} = \frac{\sum_{i=1}^n F_i}{\sum_{i=1}^n p_i} F ˉ = n 1 ​ i = 1 ∑ n ​ F i ​ Average number of jobs in the system = ∑ i = 1 n ​ p i ​ ∑ i = 1 n ​ F i ​ ​

The second expression is Little's Law applied to the shop: average WIP equals total flow time divided by the makespan. Minimizing mean flow time is therefore mathematically identical to minimizing average WIP.

A third identity is worth memorizing because it explains why one rule can win two objectives at once: L ˉ = F ˉ − d ˉ \bar{L} = \bar{F} - \bar{d} L ˉ = F ˉ − d ˉ

Because the mean due date d ˉ \bar{d} d ˉ is a property of the job set and not of the sequence, any sequence that minimizes mean flow time simultaneously minimizes mean lateness.

2. Priority (Dispatching) Rules

A dispatching rule is a formula the operator or MES applies to pick the next job from the queue. Rules are classed as static (priority fixed when the job arrives) or dynamic (priority recomputed at every dispatch decision).

Rule Priority Basis Type Primary Strength Primary Weakness

FCFS (First Come, First Served) Arrival order Static Perceived fairness; trivially simple; the default queue discipline Ignores both job length and due date; poor on every quantitative measure

SPT (Shortest Processing Time) Smallest p i p_i p i ​ first Static Minimizes mean flow time, mean lateness, mean waiting time, and average WIP Long jobs can starve indefinitely if new short jobs keep arriving

LPT (Longest Processing Time) Largest p i p_i p i ​ first Static Useful for loading parallel machines so the long jobs start first Worst mean flow time on a single machine

EDD (Earliest Due Date) Smallest d i d_i d i ​ first Static Minimizes maximum lateness and maximum tardiness Ignores processing time; can inflate mean flow time

CR (Critical Ratio) Smallest C R CR CR first Dynamic Balances remaining time against remaining work; responds to schedule slippage Must be recomputed at every dispatch

S/RO (Slack per Remaining Operation) Smallest slack per operation first Dynamic Accounts for how many operations remain downstream Requires full routing data

WSPT (Weighted SPT) Largest w i / p i w_i / p_i w i ​ / p i ​ first Static Minimizes weighted mean flow time when jobs carry unequal value Requires defensible weights

Random / SIRO Arbitrary Static Benchmark baseline only No operational merit

Critical Ratio and Slack C R = Due date − Today’s date Remaining processing time = Time remaining Work remaining CR = \frac{\text{Due date} - \text{Today's date}}{\text{Remaining processing time}} = \frac{\text{Time remaining}}{\text{Work remaining}} CR = Remaining processing time Due date − Today’s date ​ = Work remaining Time remaining ​

C R > 1.0 CR > 1.0 CR > 1.0 : The job has slack and is ahead of schedule.

C R = 1.0 CR = 1.0 CR = 1.0 : The job is exactly on schedule and must run without delay.

C R < 1.0 CR < 1.0 CR < 1.0 : The job is already behind; it will be late unless expedited. A negative C R CR CR means the due date has already passed.

The job with the smallest critical ratio is dispatched first. The related slack rules are: Slack = d i − t now − p remaining S / R O = Slack Number of remaining operations \text{Slack} = d_i - t_{\text{now}} - p_{\text{remaining}} \qquad S/RO = \frac{\text{Slack}}{\text{Number of remaining operations}} Slack = d i ​ − t now ​ − p remaining ​ S / RO = Number of remaining operations Slack ​

Optimality Results to Memorize

For n n n jobs on one machine , all available at time zero:

SPT minimizes mean flow time. Proof sketch: swapping any adjacent pair so the shorter job runs first reduces the sum of completion times, so no sequence with a longer job ahead of a shorter one can be optimal. Because L ˉ = F ˉ − d ˉ \bar{L} = \bar{F} - \bar{d} L ˉ = F ˉ − d ˉ and average WIP = ∑ F i / ∑ p i = \sum F_i / \sum p_i = ∑ F i ​ / ∑ p i ​ , SPT simultaneously minimizes mean lateness, mean waiting time, and average WIP.

EDD minimizes maximum lateness L max ⁡ L_{\max} L m a x ​ (and therefore maximum tardiness). This is Jackson's rule.

Moore's algorithm minimizes the number of tardy jobs N T N_T N T ​ : sequence by EDD; scan forward until the first job becomes tardy; from the sequence up to and including that job, remove the one with the largest processing time and set it aside to run last; repeat on the shortened list.

WSPT (largest w i / p i w_i/p_i w i ​ / p i ​ first) minimizes weighted mean flow time , the correct rule when jobs carry unequal holding cost or customer value.

Critical Limitation : These theorems hold for a single machine with all jobs available at time zero . Once jobs arrive dynamically, machines run in parallel, or routings differ, general job-shop scheduling becomes NP-hard and dispatching rules become heuristics evaluated by simulation, not proofs.

3. Flow Shop Scheduling and Johnson's Rule

In a flow shop , every job visits the same work centers in the same technological order. The classical two-machine case has an exact polynomial-time solution.

Johnson's Rule (Two Machines, n Jobs)

Given n n n jobs each requiring time a i a_i a i ​ on Machine 1 followed by b i b_i b i ​ on Machine 2, the sequence that minimizes makespan (equivalently, minimizes total idle time on Machine 2) is constructed as follows: Johnson's Rule Algorithm (2 machines, n jobs)

1. List every processing time a_i (Machine 1) and b_i (Machine 2).

2. Find the SMALLEST unassigned time in the whole list.

  • |
  • +-- If it is on MACHINE 1 -> place that job in the EARLIEST
  • | open position (front of sequence)
  • +-- If it is on MACHINE 2 -> place that job in the LATEST
  • open position (back of sequence)

3. Remove that job from further consideration.

4. Repeat until every position is filled.

(Break ties arbitrarily; alternate optimal sequences exist.)

The logic is intuitive: jobs with short Machine-1 times should go first so Machine 2 starts as early as possible, and jobs with short Machine-2 times should go last so Machine 2 is not left idle at the end waiting for a long finishing operation.

Johnson's rule extends exactly to three machines only when a special condition holds — either min ⁡ a i ≥ max ⁡ \min a_i \ge \max min a i ​ ≥ max of the middle-machine times, or min ⁡ c i ≥ max ⁡ \min c_i \ge \max min c i ​ ≥ max of the middle-machine times — in which case the middle machine is collapsed by forming a i ′ = a i + b i a_i' = a_i + b_i a i ′ ​ = a i ​ + b i ​ and b i ′ = b i + c i b_i' = b_i + c_i b i ′ ​ = b i ​ + c i ​ and applying the two-machine rule. Beyond that, flow shop scheduling is NP-hard.

Reading a Gantt Chart

A Gantt chart plots each machine on a horizontal time axis with a bar for every job. It is the standard way to expose two distinct losses:

Idle time : a machine has no job available (starvation, typically on Machine 2 at the start of the schedule).

Blocking : a machine has finished but cannot discharge because the downstream buffer is full.

Total idle time on Machine 2 equals the makespan minus the sum of the Machine 2 processing times; minimizing makespan in a two-machine flow shop is therefore precisely equivalent to minimizing Machine 2 idle time.

  • 4. Step-by-Step Worked Engineering Calculations
  • Worked Example 12.4.1: Single-Machine Sequencing under FCFS, SPT, and EDD

Problem : Five jobs wait at a CNC machining center at time zero. Processing times and due dates (in days from now) are:

  • Job Processing Time p i p_i p i ​ (days) Due Date d i d_i d i ​ (days)
  • A 6 9
  • B 2 25
  • C 8 15
  • D 3 12
  • E 9 28

Jobs arrived in the order A, B, C, D, E. For each of FCFS, SPT, and EDD, determine the sequence, mean flow time, mean tardiness, maximum lateness, number of tardy jobs, and average number of jobs in the system.

Solution :

Total processing time ∑ p i = 6 + 2 + 8 + 3 + 9 = 28 \sum p_i = 6 + 2 + 8 + 3 + 9 = 28 ∑ p i ​ = 6 + 2 + 8 + 3 + 9 = 28 days, so the makespan is 28 days under every sequence (single machine, no idle time).

Sequence 1 — FCFS (A, B, C, D, E)

  • Job p i p_i p i ​ Completion C i C_i C i ​ d i d_i d i ​ Lateness L i L_i L i ​ Tardiness T i T_i T i ​
  • A 6 6 9 − 3 -3 − 3 0
  • B 2 8 25 − 17 -17 − 17 0
  • C 8 16 15 + 1 +1 + 1 1
  • D 3 19 12 + 7 +7 + 7 7
  • E 9 28 28 0 0 0 0

Total 28 77 — − 12 -12 − 12 8 F ˉ = 77 5 = 15.4 days T ˉ = 8 5 = 1.6 days L max ⁡ = + 7 N T = 2 \bar{F} = \frac{77}{5} = 15.4\text{ days} \qquad \bar{T} = \frac{8}{5} = 1.6\text{ days} \qquad L_{\max} = +7 \qquad N_T = 2 F ˉ = 5 77 ​ = 15.4 days T ˉ = 5 8 ​ = 1.6 days L m a x ​ = + 7 N T ​ = 2 Average jobs in system = 77 28 = 2.75 \text{Average jobs in system} = \frac{77}{28} = 2.75 Average jobs in system = 28 77 ​ = 2.75

Sequence 2 — SPT (B, D, A, C, E), ordering by p i p_i p i ​ = 2, 3, 6, 8, 9

  • Job p i p_i p i ​ Completion C i C_i C i ​ d i d_i d i ​ Lateness L i L_i L i ​ Tardiness T i T_i T i ​
  • B 2 2 25 − 23 -23 − 23 0
  • D 3 5 12 − 7 -7 − 7 0
  • A 6 11 9 + 2 +2 + 2 2
  • C 8 19 15 + 4 +4 + 4 4
  • E 9 28 28 0 0 0 0

Total 28 65 — − 24 -24 − 24 6 F ˉ = 65 5 = 13.0 days T ˉ = 6 5 = 1.2 days L max ⁡ = + 4 N T = 2 \bar{F} = \frac{65}{5} = 13.0\text{ days} \qquad \bar{T} = \frac{6}{5} = 1.2\text{ days} \qquad L_{\max} = +4 \qquad N_T = 2 F ˉ = 5 65 ​ = 13.0 days T ˉ = 5 6 ​ = 1.2 days L m a x ​ = + 4 N T ​ = 2 Average jobs in system = 65 28 = 2.32 \text{Average jobs in system} = \frac{65}{28} = 2.32 Average jobs in system = 28 65 ​ = 2.32

Sequence 3 — EDD (A, D, C, B, E), ordering by d i d_i d i ​ = 9, 12, 15, 25, 28

  • Job p i p_i p i ​ Completion C i C_i C i ​ d i d_i d i ​ Lateness L i L_i L i ​ Tardiness T i T_i T i ​
  • A 6 6 9 − 3 -3 − 3 0
  • D 3 9 12 − 3 -3 − 3 0
  • C 8 17 15 + 2 +2 + 2 2
  • B 2 19 25 − 6 -6 − 6 0
  • E 9 28 28 0 0 0 0

Total 28 79 — − 10 -10 − 10 2 F ˉ = 79 5 = 15.8 days T ˉ = 2 5 = 0.4 days L max ⁡ = + 2 N T = 1 \bar{F} = \frac{79}{5} = 15.8\text{ days} \qquad \bar{T} = \frac{2}{5} = 0.4\text{ days} \qquad L_{\max} = +2 \qquad N_T = 1 F ˉ = 5 79 ​ = 15.8 days T ˉ = 5 2 ​ = 0.4 days L m a x ​ = + 2 N T ​ = 1 Average jobs in system = 79 28 = 2.82 \text{Average jobs in system} = \frac{79}{28} = 2.82 Average jobs in system = 28 79 ​ = 2.82

Comparison

  • Measure FCFS SPT EDD Winner
  • Mean flow time (days) 15.4 13.0 15.8 SPT
  • Mean lateness (days) − 2.4 -2.4 − 2.4 − 4.8 -4.8 − 4.8 − 2.0 -2.0 − 2.0 SPT
  • Average jobs in system 2.75 2.32 2.82 SPT
  • Maximum lateness (days) + 7 +7 + 7 + 4 +4 + 4 + 2 +2 + 2 EDD
  • Mean tardiness (days) 1.6 1.2 0.4 EDD
  • Number of jobs tardy 2 2 1 EDD
  • Makespan (days) 28 28 28 Tie

Engineering interpretation : SPT delivers the lowest mean flow time (13.0 versus 15.4 and 15.8 days) and therefore the lowest average WIP — 2.32 jobs on the floor instead of 2.75 or 2.82. EDD delivers the best customer-facing result: maximum lateness falls from 7 days to 2 days and only one job is tardy. The two rules optimize different objectives, and the choice is a business decision, not a mathematical one. Note also the identity check: mean due date = ( 9 + 25 + 15 + 12 + 28 ) / 5 = 17.8 = (9 + 25 + 15 + 12 + 28)/5 = 17.8 = ( 9 + 25 + 15 + 12 + 28 ) /5 = 17.8 days, and for SPT L ˉ = 13.0 − 17.8 = − 4.8 \bar{L} = 13.0 - 17.8 = -4.8 L ˉ = 13.0 − 17.8 = − 4.8 , exactly as L ˉ = F ˉ − d ˉ \bar{L} = \bar{F} - \bar{d} L ˉ = F ˉ − d ˉ predicts.

Worked Example 12.4.2: Johnson's Rule in a Two-Machine Flow Shop

Problem : Five jobs must each be milled on Machine 1 and then deburred on Machine 2, in that order. Processing times in hours:

  • Job Machine 1 ( a i a_i a i ​ ) Machine 2 ( b i b_i b i ​ )
  • J1 5 2
  • J2 1 6
  • J3 9 7
  • J4 3 8
  • J5 10 4

Apply Johnson's rule to find the makespan-minimizing sequence.

Compute the makespan and the idle time on each machine.

Compare against processing the jobs in numerical order (J1 through J5).

Solution :

Step 1: Apply Johnson's Rule Positions to fill: [ _ , _ , _ , _ , _ ] [\_\,, \_\,, \_\,, \_\,, \_\,] [ _ , _ , _ , _ , _ ] .

Smallest time in the whole table is 1 (J2 on Machine 1) → \to → Machine 1, so J2 takes the earliest open position: [ J 2 , _ , _ , _ , _ ] [J2, \_, \_, \_, \_] [ J 2 , _ , _ , _ , _ ] .

Next smallest among remaining jobs is 2 (J1 on Machine 2) → \to → Machine 2, so J1 takes the latest open position: [ J 2 , _ , _ , _ , J 1 ] [J2, \_, \_, \_, J1] [ J 2 , _ , _ , _ , J 1 ] .

Next is 3 (J4 on Machine 1) → \to → earliest open: [ J 2 , J 4 , _ , _ , J 1 ] [J2, J4, \_, \_, J1] [ J 2 , J 4 , _ , _ , J 1 ] .

Next is 4 (J5 on Machine 2) → \to → latest open: [ J 2 , J 4 , _ , J 5 , J 1 ] [J2, J4, \_, J5, J1] [ J 2 , J 4 , _ , J 5 , J 1 ] .

Only J3 remains: [ J 2 , J 4 , J 3 , J 5 , J 1 ] [J2, J4, J3, J5, J1] [ J 2 , J 4 , J 3 , J 5 , J 1 ] .

Optimal sequence: J2 → \to → J4 → \to → J3 → \to → J5 → \to → J1

Step 2: Build the Gantt schedule Machine 2 can start a job only when both (a) Machine 1 has released it and (b) Machine 2 is free.

  • Job M1 Start M1 Finish M2 Start = max(M1 finish, M2 free) M2 Finish
  • J2 0 1 max(1, 0) = 1 7
  • J4 1 4 max(4, 7) = 7 15
  • J3 4 13 max(13, 15) = 15 22
  • J5 13 23 max(23, 22) = 23 27
  • J1 23 28 max(28, 27) = 28 30 Makespan = 30 hours \text{Makespan} = 30\text{ hours} Makespan = 30 hours

Idle time :

Machine 1 total work = 5 + 1 + 9 + 3 + 10 = 28 = 5 + 1 + 9 + 3 + 10 = 28 = 5 + 1 + 9 + 3 + 10 = 28 hours, so Machine 1 idles 30 − 28 = 2 30 - 28 = 2 30 − 28 = 2 hours (all at the end, waiting for the schedule to close out).

Machine 2 total work = 2 + 6 + 7 + 8 + 4 = 27 = 2 + 6 + 7 + 8 + 4 = 27 = 2 + 6 + 7 + 8 + 4 = 27 hours, so Machine 2 idles 30 − 27 = 3 30 - 27 = 3 30 − 27 = 3 hours: 1 hour of initial starvation (0 to 1), 1 hour waiting for J5 (22 to 23), and 1 hour waiting for J1 (27 to 28).

Step 3: Compare against numerical order (J1, J2, J3, J4, J5)

  • Job M1 Start M1 Finish M2 Start M2 Finish
  • J1 0 5 5 7
  • J2 5 6 max(6, 7) = 7 13
  • J3 6 15 max(15, 13) = 15 22
  • J4 15 18 max(18, 22) = 22 30
  • J5 18 28 max(28, 30) = 30 34

Makespan = 34 = 34 = 34 hours, with Machine 2 idle for 34 − 27 = 7 34 - 27 = 7 34 − 27 = 7 hours.

Engineering conclusion : Johnson's rule reduces the makespan from 34 hours to 30 hours , an 11.8% reduction, and cuts Machine 2 idle time from 7 hours to 3 hours — with zero capital investment and no change to any processing time . The gain comes entirely from starting with the job that clears Machine 1 fastest (J2, 1 hour) and finishing with the job that occupies Machine 2 for the shortest time (J1, 2 hours), so the downstream machine is fed early and drained late.

5. NCEES Reference Handbook Tips and Realistic Exam Traps

Makespan Does Not Change on One Machine : With a single machine, no idle time, and all jobs available at time zero, every sequence finishes at ∑ p i \sum p_i ∑ p i ​ . If a question asks which rule minimizes makespan in that setting, the answer is that all rules tie. Makespan only becomes sequence-dependent with two or more machines.

Tardiness Is Truncated at Zero : When totaling tardiness, replace every negative lateness with 0 before summing. Averaging raw lateness values (including the negatives) understates customer impact and is the most common numerical error on these problems.

Match the Rule to the Objective : SPT for mean flow time, mean lateness, or average WIP; EDD for maximum lateness or maximum tardiness; Moore's algorithm for the number of tardy jobs; WSPT when jobs carry unequal weights. Selecting SPT for a maximum-lateness question is the standard distractor.

Critical Ratio Direction : The job with the smallest critical ratio has the highest priority. C R < 1.0 CR < 1.0 CR < 1.0 signals a job already behind schedule. Choosing the largest CR inverts the rule.

Johnson's Rule Placement Direction : A smallest time on Machine 1 goes to the front ; a smallest time on Machine 2 goes to the back . Reversing the two directions produces a valid-looking but non-optimal sequence, and it is the built-in distractor on nearly every Johnson's rule item.

Check Johnson's Applicability : Johnson's rule requires a true flow shop — every job passes through Machine 1 and then Machine 2 in the same order, with no passing and no missed operations. It does not apply to a job shop with mixed routings.