Abstract
The steelmaking and continuous casting (SCC) process is one of the vital processes in iron and steel plants since it determines chemical compositions of slabs and is often a bottleneck for iron and steel manufacturing. In this paper, we first develop a discrete-time mixed-integer linear programming (MILP) formulation for a new SCC scheduling problem where different processing routes are used to produce diversified and personalized slab products. To solve the proposed MILP formulation efficiently, we then propose a novel efficient solution algorithm using Augmented Lagrange multiplier method (e-ALM) through relaxation of the coupling constraints and incorporation of penalty components. A heuristic-based list scheduling approach as well as adjacent pairwise swap operations is used to construct a high-quality feasible schedule. A fine-adjusting strategy based on the subgradient direction is proposed to update Lagrangian multipliers dynamically to speed up the convergence. It is shown that the proposed e-ALM is able to generate optimal or near-optimal solutions with 5% optimality for 150 industrial-scale instances and outperform the commercial solver GAMS/CPLEX and the existing Lagrangian relaxation algorithms with better feasible solutions and smaller duality gap within the specified computational time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.