Metaheuristic

Engineering

Tardiness

Microeconomics

Scheduling (production processes)

Operating system

Economics

Production line

Computer science

Mathematical optimization

Integer programming

Pareto principle

Mechanical engineering

Mathematics

Automotive engineering

Operations management

Minification

Geometry

Variable neighborhood search

Schedule

Total cost

Line (geometry)

Job shop scheduling

Computers & Industrial Engineering

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 Multi-objective 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.

Multi-objective matheuristic for minimization of total tardiness and energy costs in a steel industry heat treatment line