Discrete event sequencing as a Traveling Salesman Problem
Computers in Industry
Primary production scheduling at steelmaking industries
IBM Journal of Research and Development
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Modeling rolling batch planning as vehicle routing problem with time windows
Computers and Operations Research
Artificial Intelligence
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
Optimization with extremal dynamics
Complexity - Complex Adaptive systems: Part I
A flexible decision support system for steel hot rolling mill scheduling
Computers and Industrial Engineering - Special issue: Selected papers from the 25th international conference on computers & industrial engineering in New Orleans, Louisiana
Machine scheduling with earliness, tardiness and non-execution penalties
Computers and Operations Research
Finishing line scheduling in the steel industry
IBM Journal of Research and Development
Scheduling in a continuous galvanizing line
Computers and Operations Research
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
Hi-index | 0.01 |
A hot strip mill (HSM) produces hot rolled products from steel slabs, and is one of the most important production lines in a steel plant. The aim of HSM scheduling is to construct a rolling sequence that optimizes a set of given criteria under constraints. Due to the complexity in modeling the production process and optimizing the rolling sequence, the HSM scheduling is a challenging task for hot rolling production schedulers. This paper first introduces the HSM production process and requirements, and then reviews previous research on the modeling and optimization of the HSM scheduling problem. According to the practical requirements of hot rolling production, a mathematical model is formulated to describe two important scheduling sub-tasks: (1) selecting a subset of manufacturing orders and (2) generating an optimal rolling sequence from the selected manufacturing orders. Further, hybrid evolutionary algorithms with integration of genetic algorithm (GA) and extremal optimization (EO) are proposed to solve the HSM scheduling problem. Computational results on industrial data show that the proposed HSM scheduling solution can be applied in practice to provide satisfactory performance.