A lot grouping algorithm for a continuous slab caster in an integrated steel mill

This paper discusses a lot grouping problem for a continuous slab easter in an integrated steel mill. Molten steel called 'charge' is transported to t he continuous easter to be cast as the elongated rectangular solid steel pi eces called 'slabs' of various sizes and metallurgical compositions. In ord er to enhance the productivity of the continuous easter, it is preferable t o group as many charges as possible to form the cast. However, at the same time, lot grouping must be performed in compliance with several operational constraints as well as technological limitations of the continuous easter. The problem is formulated as an integer programming model, and it is shown that the problem is NP-complete. Hence, an efficient heuristic algorithm i s developed to solve the problem by employing the column generation approac h combined with a simple round-off scheme. In order to evaluate the perform ance of the proposed heuristic, the computation experiment is performed.