查看文章

This article studies a steelmaking-continuous casting (SCC) scheduling problem by considering ladle allocation. It takes technological rules in steel manufacturing and ladle-related constraints into account. A scheduling problem is formulated to determine allocation equipment for jobs, production sequence for jobs processed by the same equipment, and modification operations for empty ladles after their service for jobs. To ensure the fastest production and least energy consumption, we present a mixed integer mathematical programming model with the objectives to minimize the maximum completion time, idle time penalties, and energy consumption penalties related to waiting time. To solve it, we develop a two-stage approach based on a combination of scatter search (SS) and mixed integer programming (MIP). The first stage applies an SS algorithm to determine the assignment and sequence variables for …