Production planning optimization for precision micro‑tooling
I designed a robust optimization algorithm that groups production orders into batches to reduce stockout risk and production costs. It handles the most urgent orders first, uses as few batches as possible and builds them so as to minimize the setup cost of the worst possible schedule. I formalized the business rules with the planning team, then integrated the tool into the company's systems with its IT team. Planning time dropped from 4 hours to 30 minutes. Published in Discrete Applied Mathematics.
Recognized by the GSEM as one of the best publications of the year
Technical details
Modeled as a graph coloring variant. Tabu search and constructive heuristics, validated against CPLEX on instances generated from the company's real data.
An interactive demo covers the classical batching and scheduling problem, of which DIXI's is a robust variant. The problem is solved live by a solver I wrote in C++.
Try the demo
LinkedIn