Genetic Algorithm for Scheduling of Steelmaking and Continuous Casting Processes Considering Earliness/Tardiness Penalty<sup>*</sup>

The production scheduling for steelmaking and continuous casting operations involves the allocation of each heat to specific equipment at various stages within the steelmaking process. Refinement and continuous casting are performed in accordance with the casting plans formulated by the planner and simultaneously determine the production sequence and start/finish time of heats on each equipment. The production scheduling for steel refining and continuous casting processes in this paper is modeled as a flexible job shop scheduling problem. Aiming at just-in-time production of orders, we formulate a mixed-integer programming model (MILP) and introduce a genetic algorithm to address the issue. The validity of the model and the efficiency of the algorithm are confirmed through real-world instances of production scheduling challenges.

Authors

Institutions

Publication Details

Published
2024-08-21
DOI
https://doi.org/10.1109/iai63275.2024.10730366
Primary Topic
Manufacturing Process and Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Genetic Algorithm for Scheduling of Steelmaking and Continuous Casting Processes Considering Earliness/Tardiness Penalty*

Shixin Liu, Sun Weiping
Manufacturing Process and Optimization
article

Genetic Algorithm for Scheduling of Steelmaking and Continuous Casting Processes Considering Earliness/Tardiness Penalty*

Shixin Liu, Sun Weiping
article en

Abstract

The production scheduling for steelmaking and continuous casting operations involves the allocation of each heat to specific equipment at various stages within the steelmaking process. Refinement and continuous casting are performed in accordance with the casting plans formulated by the planner and simultaneously determine the production sequence and start/finish time of heats on each equipment. The production scheduling for steel refining and continuous casting processes in this paper is modeled as a flexible job shop scheduling problem. Aiming at just-in-time production of orders, we formulate a mixed-integer programming model (MILP) and introduce a genetic algorithm to address the issue. The validity of the model and the efficiency of the algorithm are confirmed through real-world instances of production scheduling challenges.

Northeastern University (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 73%
Manufacturing Process and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.