An Iterated Greedy Matheuristic for Scheduling in Steelmaking-Continuous Casting Process - Artificial Intelligence for Sustainable and Resilient Production Systems PART IV, IFIP WG 5.7 International Conference, APMS 2021 Access content directly
Conference Papers Year : 2021

An Iterated Greedy Matheuristic for Scheduling in Steelmaking-Continuous Casting Process

Abstract

The steelmaking-continuous casting (SCC) is a bottleneck process in the steel production. Due to elevated product variety and environmental restrictions on the steelmaking industry, efficient operation of the SCC has become more crucial. This paper considers an SCC scheduling problem to minimize the weighted sum of total waiting time, total earliness, and total tardiness while satisfying the maximum waiting time and the continuous casting constraints. We propose a generic mixed integer linear programming (MILP) model that can express various SCC scheduling requirements. Using the MILP model, we develop an iterated greedy matheuristic inspired by the iterated greedy method. An initial SCC schedule is constructed by solving small MILP models one after another. Then, it is improved by solving a series of small MILP models representing the destruction and construction of the prior schedule. Through a numerical experiment, we show that the proposed algorithm can obtain efficient solutions in a short time and outperforms an NSGA-II algorithm for most test cases of practical size.
Fichier principal
Vignette du fichier
509923_1_En_7_Chapter.pdf (490.64 Ko) Télécharger le fichier

Dates and versions

hal-04030365 , version 1 (15-03-2023)

Licence

Attribution

Identifiers

Cite

Juntaek Hong, Kwansoo Lee, Kangbok Lee, Kyungduk Moon. An Iterated Greedy Matheuristic for Scheduling in Steelmaking-Continuous Casting Process. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2021, Nantes, France. pp.62-72, ⟨10.1007/978-3-030-85874-2_7⟩. ⟨hal-04030365⟩
11 View
36 Download

Altmetric

Share

Gmail Facebook X LinkedIn More