Multi-Objective Matheuristic For Minimization Of Total Tardiness And Energy Costs In A Steel Industry Heat Treatment Line

This research focuses on solving a scheduling problem in a heat treatment line of a multinational steel company. A bi-objective model is proposed to minimize the line total energy costs and total tardiness. The solution is carried out through a matheuristic technique that combines metaheuristics and mathematical programming. A Mixed Integer Linear Programming (MILP) model is designed to generate initial solutions to a Multiobjective Variable Neighborhood Search (MOVNS) algorithm. One benefit of this approach is the ability to handle large-scale problems, common in real production scheduling cases, with reasonable computational time and alternative quality planning. The suggested matheuristic is proven to be statistically superior to an only metaheuristic approach, taking as performance metric the final approximated Pareto solutions' hypervolume. Tests performed with data from the industry showed improvements in the scheduling of the heat treatment line with reductions of energy costs and tardiness up to 13% and 90%, respectively. The methodology can also be extended to other similar scheduling processes.