12 research outputs found
A scheduling system for the steelmaking-continuous casting process. A case study from the steel-making industry
A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
The Charge Batching Planning Problem in Steelmaking Process Using Lagrangian Relaxation Algorithm
Scheduling a real-world hybrid flow shop with variable processing times using Lagrangian relaxation
A Hybrid Fuzzy PSO Algorithm for Solving Steelmaking-Continuous Casting Scheduling Problem
Production Scheduling of a Large-Scale Steelmaking Continuous Casting Process via Unit-Specific Event-Based Continuous-Time Models: Short-Term and Medium-Term Scheduling
The scheduling of steelmaking continuous-casting (SCC) processes is of major importance in iron and steel operations, since it is often a bottleneck in iron and steel production. Optimal scheduling of SCC processes can increase profit, minimize production cost, reduce material and energy consumption, and improve customer satisfaction. Scheduling of SCC processes is challenging, because of its combinatorial nature, complex practical constraints, and strict requirements on material continuity and flow time, as well as the technological requirements to ensure practical feasibility of the resulting scheduling. In this paper, we first develop a novel unit-specific event-based continuous-time mixed-integer linear optimization (MILP) model for this problem and incorporate several realistic operational features. Then, we extend the rolling horizon approach proposed by Lin et al. [Lin et al. Ind. Eng. Chem. Res. 2002, 41, 3884-3906] and Janak et al. [Janak et al. Ind. Eng. Chem. Res. 2006, 45, 8234-8252] to solve this large-scale and complex optimization problem. Four large-scale industrial problems are used to illustrate the efficiency and effectiveness of the proposed formulation and rolling horizon approach. The computational results show that the extended rolling horizon approach successfully solves the large-scale case studies and results in the same or better integer solution than that obtained from directly solving the entire scheduling model