A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production

Abstract

• We study a new hot rolling scheduling problem from compact strip production process. • We model the problem as a combination of a sheet strip assignment sub-problem and a sheet strip sequencing sub-problem. • We present a two-stage solution approach consisting of a sheet strip assignment heuristic and a sheet strip sequencing heuristic. • The effectiveness of the two-stage heuristic is demonstrated by extensive experiments on both synthetic and real-world instances. This paper addresses a new hot rolling scheduling problem from the compact strip production process, which is the mainstream production technology that is used worldwide for sheet strips. The problem is modeled as a combination of two coupled sub-problems. One sub-problem is a sheet strip assignment problem that assigns sheet strips to rolling turns with the constraints of safe values of different gauge levels, and the other is a sheet strip sequencing problem that decides the rolling sequence for all of the sheet strips in a rolling turn to form a particular parabolic shape in thickness. To solve this hot rolling scheduling problem, we present a novel approach that consists of a sheet strip assignment heuristic and a sheet strip sequencing heuristic. The sheet strip assignment heuristic minimizes the number of virtual sheet strips by generating rolling turns according to the ordered sheet strips with maximum gauge level and their safe values. The sheet strip sequencing heuristic minimizes the average change of the thickness of adjacent sheet strips by arranging a certain number of duplicate sheet strips to the increasing stage of a rolling turn. Extensive experiments based on both synthetic and real-world instances from a compact strip production process show the effectiveness of the proposed two-stage heuristic in solving the hot rolling scheduling problem.