Postgraduate DiplomaData, AI, Simulation & Analytics Applications open

Diploma in MILP/CP Modeling and Heuristics for Production

Online postgraduate diploma of 800 hours in MILP/CP modelling and heuristics for production. 8 modules covering production scheduling problems, mixed-integer linear programming, formulation improvement, constraint programming, constructive heuristics, metaheuristics and shop-floor deployment in line with IEC 62264 and ISA-88, with an assigned technical tutor.

Duration6–8 months
ModeOnline
LanguageEnglish
Start datesSet by the faculty
AwardSEIUM Institute diploma
Virtual lab · try it before you enrol

Take the controls.

Run a real engineering trade-off from this field. Move the sliders, watch the model react in real time and beat the challenge.

SIM · LIVE ●
Learning outcomes

What you will be able to do

01

Formalise production planning and sequencing problems.

02

Model production problems with mixed-integer linear programming.

03

Improve formulations and apply decomposition techniques.

04

Solve scheduling problems with constraint programming.

05

Design effective constructive heuristics.

06

Apply metaheuristics to large-scale problems.

07

Integrate optimisation models into real-world planning.

Profile

Who it's for

  • Operations research engineers.
  • Advanced production planners who want to move beyond spreadsheets and rules of thumb.
  • Decision scientists.
  • APS (advanced planning and scheduling) system developers.
  • Industrial optimisation consultants.
  • Industrial organisation engineers.
  • Engineering or science graduates seeking to enter the chemical industry.
Standards & tools

What you'll work with

  • IEC 62264 (ISA-95: enterprise-control integration)
  • ISA-88 (Batch control)
  • MPS format (Mathematical Programming System)
  • MiniZinc 2.x (Constraint modelling language)
  • ISO 22400-2 (KPIs for manufacturing operations management)
  • Gurobi
  • Google OR-Tools CP-SAT
  • IBM ILOG CPLEX and CP Optimizer
  • Pyomo
  • HiGHS
Syllabus

8 modules

  1. 1.1Planning, scheduling and sequencing
  2. 1.2Classification of shop problems: flow shop and job shop
  3. 1.3Graham notation for scheduling
  4. 1.4Objective functions: makespan, tardiness and costs
  5. 1.5Computational complexity and NP-hardness
  6. 1.6Common plant constraints
  7. 1.7Horizon, granularity and rescheduling
  8. 1.8Required data and its quality
  9. 1.9Choosing between exact and approximate methods
  10. 1.10Workshop: formalising a sequencing problem
  1. 2.1Variables, constraints and objective
  2. 2.2Formulations with binary variables
  3. 2.3Big-M constraints and their risks
  4. 2.4Discrete-time and continuous-time formulations
  5. 2.5Lot sizing: CLSP
  6. 2.6Branch and bound
  7. 2.7Cutting planes and relaxations
  8. 2.8Reading the gap and the solver log
  9. 2.9Modelling with Pyomo and PuLP
  10. 2.10Practical exercise: lot-sizing model with Pyomo
  1. 3.1Strong and weak formulations
  2. 3.2Symmetry breaking
  3. 3.3Valid inequalities and cuts
  4. 3.4Benders decomposition
  5. 3.5Column generation
  6. 3.6Lagrangian relaxation of coupling constraints
  7. 3.7Solver parameters and tuning
  8. 3.8Warm starts
  9. 3.9Comparison of commercial and open-source solvers
  10. 3.10Lab: tuning a MILP with Gurobi
  1. 4.1Finite-domain variables and propagation
  2. 4.2Global constraints: alldifferent and cumulative
  3. 4.3Interval variables
  4. 4.4No-overlap constraints
  5. 4.5Sequence-dependent setup times
  6. 4.6Search strategies
  7. 4.7OR-Tools CP-SAT
  8. 4.8IBM CP Optimizer
  9. 4.9CP versus MILP in scheduling
  10. 4.10Practical exercise: job shop with CP-SAT
  1. 5.1Dispatching rules: SPT, EDD and ATC
  2. 5.2Johnson's algorithm
  3. 5.3NEH heuristic for flow shop
  4. 5.4Greedy heuristics with priorities
  5. 5.5Insertion heuristics
  6. 5.6Shifting bottleneck heuristics
  7. 5.7Quality assessment against bounds
  8. 5.8Speed versus quality
  9. 5.9Integration with business rules
  10. 5.10Lab: comparison of dispatching rules
  1. 6.1Local search and neighbourhoods
  2. 6.2Simulated annealing and cooling schedules
  3. 6.3Tabu search and memory structures
  4. 6.4Genetic algorithms with permutation encoding
  5. 6.5Iterated local search
  6. 6.6Large Neighbourhood Search
  7. 6.7Matheuristics: MILP inside the heuristic
  8. 6.8Parameter tuning with irace
  9. 6.9Taillard benchmarks
  10. 6.10Practical exercise: tabu search for flow shop
  1. 7.1Integration with ERP and MES
  2. 7.2Calendars, shifts and maintenance
  3. 7.3Rescheduling in response to events
  4. 7.4Plan stability
  5. 7.5User interface for planners
  6. 7.6Explaining the model's decisions
  7. 7.7Validation with expert planners
  8. 7.8Measuring the benefit
  9. 7.9Industrial scheduling cases
  10. 7.10Case study: scheduler for a packaging line
  1. 8.1Description of the production system
  2. 8.2Problem formulation
  3. 8.3MILP model of production
  4. 8.4CP model of production
  5. 8.5Heuristic or metaheuristic
  6. 8.6Experimental comparison of the methods
  7. 8.7Integration proposal
  8. 8.8Conclusions and future work
  9. 8.9Report and presentation
  10. 8.10Final project: final review with the tutor
Methodology, software & labs

How you'll learn

100% online training on the SEIUM campus, with downloadable material, recorded classes and an assigned technical tutor. There are no fixed timetables: you progress at your own pace within each intake, so the programme is compatible with work.

Each module combines theory, guided reading of the original standard and applied exercises. The working software is Gurobi, Google OR-Tools CP-SAT, IBM ILOG CPLEX and CP Optimizer, Pyomo and HiGHS, in free, academic or evaluation versions. Practical work is based on real procedures for experimental comparison of MILP, CP and heuristics, solver parameter tuning on real instances and validation of production schedules with planners. Assessment is continuous by module plus the final project.

Standards covered: IEC 62264, ISA-88, MPS format, MiniZinc 2.x, ISO 22400-2.

Assigned technical tutor:every module ends with a deliverable that your tutor marks individually.
Standards-based learning:guided reading of IEC 62264, ISA-88 and the MPS format applied to real cases, not as a theoretical annex.
Industry software:Gurobi, Google OR-Tools CP-SAT, IBM ILOG CPLEX and CP Optimizer, Pyomo and HiGHS, in free, academic or evaluation versions.
Final project:an optimisation solution for a real production system, comparing MILP, CP and heuristic approaches with an integration proposal, reviewed by your tutor.
Flexible format:100% online, no fixed timetables, compatible with full-time work.
Capstone project

Build it end to end

Your final project follows the real engineering workflow, step by step, reviewed by your tutor.

System and formulation
Describe the production system and formalise the scheduling problem and its objectives.
MILP model
Build and tune a mixed-integer model of production with Pyomo and Gurobi.
CP model
Model the same problem with interval variables and solve it with CP-SAT.
Heuristic and comparison
Develop a heuristic or metaheuristic and compare all methods experimentally.
Final project
Present the integration proposal with conclusions and future work, reviewed by your tutor.
Career opportunities

Where this takes you

Operations research engineerAdvanced production plannerDecision scientistAPS system developerIndustrial optimisation consultantIndustrial organisation engineer
Admissions & scholarships

Requirements

  • Prior technical training or professional experience in the sector. No university degree is required.
  • Internet connection and a computer capable of running the programme software.
  • English sufficient to read technical standards.

Ready to start?

Send your application today. Our admissions team replies within 72 hours with your study plan and funding options.

FAQ

Frequently asked questions

The programme totals 800 hours over 6–8 months. You set your own pace within each intake, and your tutor helps you plan the workload around your job.

You work with Gurobi, Google OR-Tools CP-SAT, IBM ILOG CPLEX and CP Optimizer, Pyomo and HiGHS, using free, academic or evaluation versions. Your tutor indicates the free alternative wherever one exists.

A SEIUM Institute diploma, awarded on passing the continuous assessment and the final project. It is SEIUM's own qualification, not an official state degree; its recognition depends on the programme completed and the regulations of each country.

Yes. Modules passed are recognised in a higher programme in the same area (postgraduate diploma or master's). Ask about the recognition policy when you enrol.

Prior technical training or professional experience in the sector (no university degree required), a computer able to run the programme software and English sufficient to read technical standards.

Start dates are set by SEIUM's faculty for each intake. Our admissions team will confirm the next available date when you apply.

Diploma in MILP/CP Modeling and Heuristics for ProductionEnrol
Scroll to Top
SEIUM – Institute of Advanced Engineering
Privacy Overview

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.