Skip to main content

Manufacturing Operations

APICS hierarchy · five levels · fifteen models

Manufacturing operations research asks how a plant, production network, or industrial enterprise can turn raw materials into finished goods with the lowest cost, shortest lead time, and highest quality — across horizons that stretch from an hourly shop-floor dispatch to a decade-long capacity investment. This section presents fifteen canonical OR problems, each as a live interactive solver grounded in a real manufacturing decision, organised along the APICS planning hierarchy — Sales & Operations Planning through Shop Floor Control — grounded in Hax & Meal (1975), Orlicky (1975), Pinedo (2022), and Hopp & Spearman (2011).

Why manufacturing OR matters

Scale of the problem · three anchor statistics

~16%
of global GDP comes from manufacturing value added — the single largest productive sector, where every percent of scheduling or lot-sizing gain is billions of dollars.
World Bank, Manufacturing value added (% of GDP) · data.worldbank.org
~70%
of global merchandise trade is manufactured goods — scheduling and production-distribution decisions ripple across every supply chain on earth.
WTO, World Trade Statistical Review · wto.org
~450 M
jobs worldwide are in manufacturing — capacity and workforce decisions directly shape livelihoods in both industrialised and emerging economies.
ILOSTAT, Employment in manufacturing · ilostat.ilo.org

Decision framework

Four lenses on the same fifteen applications

The APICS planning hierarchy stacks manufacturing decisions across five levels, from the yearly Sales & Operations Planning (S&OP) at the top to the hourly Shop Floor Control (SFC) at the bottom. Each level feeds constraints downward and demand forecasts upward. The framework is rooted in the strategic–tactical–operational hierarchy of Anthony (1965), formalised by Hax & Meal (1975), and codified industrially by APICS / ASCM. Click any level to jump to its applications.

The same applications regrouped by OR problem family — the framing used in the scheduling, lot-sizing, and assembly-line-balancing literatures. Anchored in Pinedo (2022) for scheduling, Karimi et al. (2003) for lot sizing, and Scholl (1999) for assembly line balancing.

The same applications regrouped by production-system archetype. Different plants invoke different subsets of this catalog depending on whether they run continuous processes, batches, mass discrete assembly, job-shop custom work, or project-based one-offs. The project column cross-links to construction, which owns resource-constrained project scheduling.

Smart manufacturing (a.k.a. Industry 4.0) wraps classical OR problems in new data, sensing, and control infrastructure — digital twins, real-time telemetry, IoT-driven dispatch, ML-learned dispatch rules, and predictive maintenance. The applications below are those in our catalog that directly plug into smart-manufacturing stacks or whose variants are at the research frontier. See Lu (2017) and Zhong et al. (2017) for surveys.

Digital Twins & Real-Time Scheduling
Cyber-physical mirrors of the shop floor drive rescheduling at machine tick frequency.
Predictive Maintenance
Sensor telemetry + failure models replace fixed maintenance windows with condition-based scheduling.
Mass Customisation & FMS
Flexible machines, mixed-model lines, and short lots — the OR foundation for Industry 4.0 personalisation.
Data-Driven Production Planning
ERP / MES / MRP integrated with ML forecasts, stochastic demand, and closed-loop feedback.

All fifteen applications

Click any card to open its interactive solver

CFLP · MIP S&OP
Plant Location & Capacity Design
Select plant sites and capacity levels to serve a demand network, minimising fixed opening cost plus shipping cost under capacity limits.
MIP · Lot Sizing MPS
Master Production Schedule
Decide how many of each finished product to build in each weekly bucket over the MPS horizon, respecting capacity, safety-stock, and changeover windows.
HMMS · LP/QP MPS New
Aggregate Production Planning
Trade off production, inventory, workforce size, hiring, firing, and overtime across aggregate periods to meet a smoothed demand forecast at minimum cost (Holt, Modigliani, Muth, Simon 1960).
Wagner-Whitin · CLSP MRP
Lot Sizing
Decide period production quantities trading off setup cost and holding cost against time-varying demand — Wagner-Whitin DP for the uncapacitated case, CLSP MIP for the capacitated.
BOM Explosion · Procedure MRP New
Material Requirements Planning
Explode the Bill of Materials, offset by lead time, and solve lot sizing within MRP to generate planned orders at every BOM level (Orlicky 1975).
SALBP · NP-Hard CRP
Assembly Line Balancing
Partition assembly tasks into stations respecting precedence and cycle time — the simple assembly line balancing problem (SALBP-1), solved by Kilbridge-Wester and COMSOAL (Salveson 1955; Scholl 1999).
Parallel Machine CRP
Manufacturing Balancing
Assign jobs to parallel identical machines to minimise makespan — LPT (4/3 approximation), MULTIFIT, list scheduling.
Pm || Cmax
Flexible Job Shop CRP
Flexible Manufacturing
Route each operation across eligible machines and sequence them on those machines — the flexible job-shop problem, solved by hierarchical heuristics and GA (Pezzella 2008).
FJm || Cmax
Job Shop · NP-Hard SFC
Job Shop Scheduling
Schedule jobs with distinct routings across dedicated machines on the disjunctive graph — dispatching rules, shifting bottleneck (Adams-Balas-Zawack), tabu search (Nowicki-Smutnicki).
Jm || Cmax
Flow Shop · PFSP SFC New
Permutation Flow Shop
Sequence jobs through m machines in the same order to minimise makespan — Johnson's two-machine rule, NEH, CDS, iterated greedy (Ruiz & Stuetzle 2007).
Fm | prmu | Cmax
No-Wait Flow Shop SFC
Steel Production Line
Sequence steel heats through EAF → LF → Continuous Caster with no-wait inter-stage constraints — reduces to asymmetric TSP on the delay matrix (Tang et al. 2001).
Fm | prmu, no-wait | Cmax
SDST Flow Shop SFC
Print Shop Scheduling
Sequence print jobs with sequence-dependent setup times (colour changeovers) on a flow-shop line — NEH-SDST, GRASP-SDST, IG-SDST.
Fm | prmu, Ssd | Cmax
Single Machine SFC New
Single-Machine Scheduling
Sequence jobs on one machine under multiple objectives — SPT for ΣCj, WSPT (Smith 1956) for ΣwjCj, EDD (Jackson 1955) for Lmax, Moore (1968) for ΣUj, DP / B&B / ATC for tardiness.
1 | β | γ
Column Generation SFC
Cutting Stock
Cut fabric, metal, or paper rolls to satisfy width demands with minimum material waste — Gilmore-Gomory column generation (1961, 1963), FFD fast upper bound.
Scheduling · Reliability SFC
Preventive Maintenance
Schedule preventive-maintenance windows across machines to minimise breakdown risk and productivity loss, subject to technician availability (Dekker 1996).

Current research frontiers

Where manufacturing OR is actively evolving

Deep reinforcement learning for real-time dispatching

Neural-network dispatching rules trained on simulation environments, deployed on cyber-physical shop floors. Early results on the classical Taillard flow-shop and Lawrence job-shop benchmarks are competitive with tabu search at decision times two orders of magnitude lower.

Distributionally robust production planning

Wasserstein and moment-based ambiguity sets around demand, yield, and lead-time distributions — robust CLSP, robust MPS, and data-driven APP models that hedge the tail without over-insuring (Esfahani & Kuhn 2018; Delage & Ye 2010).

Closed-loop & remanufacturing scheduling

Joint production-remanufacturing-disassembly scheduling with return-flow uncertainty, for circular manufacturing and reverse supply chains (Guide, Jayaraman & Srivastava 1999; Souza 2013). Cross-link to logistics for multi-echelon inventory in closed loops.

Additive manufacturing production planning

3D-printing scheduling, part-nesting in build volumes, and distributed-manufacturing routing — a new packing-scheduling hybrid that does not fit classical flow-shop or job-shop templates.

Integrated production-distribution models

Cross-functional MIPs that simultaneously optimise MPS, vehicle routing, and multi-echelon inventory — reducing the two-step bias of plan-then-route approaches (Fahimnia et al. 2013). See logistics for the routing side.

Factory physics at scale

Queueing-network models of entire plants — Jackson networks, mean-value analysis, Hopp & Spearman's VUT equation — re-emerging as the analytical backbone behind digital-twin variability quantification.

Key references

Anchor textbooks & foundational papers · DOIs where available

Anthony, R. N. (1965).
Planning and Control Systems: A Framework for Analysis.
Harvard Business School, Division of Research. Introduced the strategic–tactical–operational control hierarchy underlying the APICS pyramid.
Hax, A. C., & Meal, H. C. (1975).
“Hierarchical integration of production planning and scheduling.”
In M. A. Geisler (Ed.), Studies in Management Sciences, Vol. 1: Logistics, pp. 53–69. North-Holland / American Elsevier. dspace.mit.edu/handle/1721.1/1868
Orlicky, J. (1975).
Material Requirements Planning: The New Way of Life in Production and Inventory Management.
McGraw-Hill. ISBN 0-07-047708-6. The foundational MRP text — defined BOM explosion and lead-time offsetting as practised industrially ever since.
Pinedo, M. L. (2022).
Scheduling: Theory, Algorithms, and Systems (6th ed.).
Pinedo, M. L. (2009).
Planning and Scheduling in Manufacturing and Services (2nd ed.).
Hopp, W. J., & Spearman, M. L. (2011).
Factory Physics (3rd ed.).
Waveland Press. ISBN 978-1-57766-739-1. Queueing-network and variability lens on manufacturing — Little's Law, VUT equation, station interactions.
Scholl, A. (1999).
Balancing and Sequencing of Assembly Lines (2nd ed.).
Physica-Verlag (Contributions to Management Science). link.springer.com/book/9783790811803
Karimi, B., Fatemi Ghomi, S. M. T., & Wilson, J. M. (2003).
“The capacitated lot sizing problem: a review of models and algorithms.”
Omega, 31(5), 365–378. doi:10.1016/S0305-0483(03)00059-8
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979).
“Optimization and approximation in deterministic sequencing and scheduling: a survey.”
Annals of Discrete Mathematics, 5, 287–326. doi:10.1016/S0167-5060(08)70356-X — canonical three-field notation.
APICS / ASCM.
APICS Dictionary (14th ed.) and APICS Operations Management Body of Knowledge Framework (3rd ed.).
Industry codification of the S&OP → MPS → MRP → CRP → SFC hierarchy. apics.org/industry-content

Need to optimise manufacturing
operations for your plant or network?

Get in Touch
Data and numerical examples are illustrative. Pages on this site are educational tools, not production software.