Two Hybrid Metaheuristic Algorithms for Hot Rolling Scheduling

Abstract

This paper presents a model for the hot rolling scheduling problem (HRSP), which is derived from the actual steel production. The model is characterized by some new features, such as the rolling length of the consecutive slabs with the same width, temperature jump between adjacent slabs. The warm up part is a minor part of a turn and is usually ignored, but it affects directly the product quality. Therefore, besides the slab sequence in the staple material section, we also consider the slab sequence in the warm up material section. These features make the solution methodology more difficult. Therefore, two hybrid strategies are proposed to determine good approximate solutions for this complicated problem. The first one (CT_ACO) is a hybrid strategy based on the solution construction mechanism of ant colony optimization (ACO) with cyclic transfers (CT). The second one (CT_SS) is to hybridize scatter search (SS) and CT neighborhood search. Moreover, we design a decision support system in which two algorithms have been embedded for the HRSP. The most popular feature of the system is the architecture of component management, which allows us to modify easily some components according to the practice situation. The computational experiments show that CT_ACO is superior to general ACO, and CT_SS is also better than SS in terms of solution quality. The CT_ACO method and CT_SS have more potential for improvement to solve the HRSP compared with the current scheduling method, and the CT_ACO generates slightly better quality solutions than CT_SS algorithm.KEY WORDS: cyclic transfer; ant colony optimization; a hybrid search algorithm; scatter search; hot rolling scheduling; the decision support system. 529

An Improved NSGA-II for Energy-oriented Hot Rolling Production Scheduling Problems

“…Constraint (4) means that each slab can only be assigned to a certain hot rolling unit. Constraint (5) indicates that each rolling unit starts and ends from virtual slab 0. Constraint (6) represents the capacity constraints of a single rolling unit.…”

“…The objective functions of Zhao et al [4] included minimizing the penalty cost and maximizing the average rolling length per unit. Tang et al [5] also used a weighted sum to solve the multi-objective problem, including minimizing the total jump cost between adjacent slabs, the roll replacement cost, the penalty cost of unselected slabs, and the use of penalty costs paid for preheating material slabs.…”

Improving the Flexibility of Production Scheduling in Flat Steel Production Through Standard and AI-Based Approaches: Challenges and Perspectives

“…The former problem is solved through a discrete differential evolution approach, while the latter one is faced through a hybrid heuristic approach. A scheduling approach for continuous galvanizing lines based on TS is presented in [24], while [22] presents two hybrid strategies based on heuristic and metaheuristic facing the HSM scheduling. All these approaches concern deterministic scheduling and thus they neglect practical problems ranging from unexpected machine faults and breakdowns, job cancellations, lack of quality for a coil along the process, date and priority changings among other common events.…”

A review and classification of computer-based manufacturing scheduling tools

“…are late to ease the development of new algorithms (E) can be found inLamatsch et al (1988);Tang et al (2009);Zhang et al (2010). Finally, allowing the expert to enter new constraints obtained from his/her experience or from his/her knowledge on the field is implemented in…”