The steelmaking continuous casting scheduling problem concerns the construction of production schedules for steelmaking from the basic oxygen furnace to the continuous casters. Start and completion times are determined to complete the operations associated with different steel charges. The real-life problem under study comprises different complicating dual-resource transportation and blocking constraints and embeds routing and sequencing flexibility to process charges of different steel grades. In this paper, we present a mixed-integer linear problem and propose a two-stage local search heuristic adjusting the charge sequence and machine assignments to minimise makespan and waiting times of charges. The algorithm makes use of a novel charge-sequence initialisation method and local search operator to find promising neighbouring schedules. Computational experimentation is performed on real-life instances to validate heuristic design choices and benchmark the proposed method to alternative methodologies. Results demonstrate that the proposed heuristic provides better initial solutions and a faster convergence to high-quality solutions in short run times.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.