Scheduling in a continuous galvanizing line

Authors:
Vicente Valls Verdejo;M. Angeles Pérez Alarcó;M. Pilar Lino Sorlí
Affiliations:
Department of Statistics and Operations Research, Universitat de València, c/ Dr. Moliner 50, 46100 Burjassot, Valencia, Spain;Department of Mathematics for Economics and Business, Universitat de València, Av. de los Naranjos s/n, 46022 Valencia, Spain;Department of Mathematics for Economics and Business, Universitat de València, Av. de los Naranjos s/n, 46022 Valencia, Spain
Venue:
Computers and Operations Research
Year:
2009

Citing 9
Cited 2

Optimal inter-process steel production scheduling

Computers and Operations Research
Discrete event sequencing as a Traveling Salesman Problem

Computers in Industry
Primary production scheduling at steelmaking industries

IBM Journal of Research and Development
Evaluation of ordering strategies for constraint satisfaction reactive scheduling

Decision Support Systems
Modeling rolling batch planning as vehicle routing problem with time windows

Computers and Operations Research
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Scheduling Algorithms

Scheduling Algorithms
Finishing line scheduling in the steel industry

IBM Journal of Research and Development
A multi-population parallel genetic algorithm for highly constrained continuous galvanizing line scheduling

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics

An efficient optimal solution to the coil sequencing problem in electro-galvanizing line

Computers and Operations Research
Development of hybrid evolutionary algorithms for production scheduling of hot strip mill

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we address a sequencing problem in a Continuous Galvanizing Line of a Spanish Steel Company. Production scheduling in this context is an extremely complex task which needs to take into account many constraints. We present a conceptually simple model and a Tabu Search (TS) algorithm that efficiently solves it. The TS moves are defined in order to repair non-satisfied constraints, leading to smaller and more efficient neighbourhoods. The TS co-ordinates several intensification and diversification procedures guided by an evaluation function based on a shifting penalty strategy. This function reinforces the anticycling mechanism and makes the algorithm avoid already visited solutions. Our approach has been tested on some real instances from the galvanizing line. Computational results show that the TS improves, in all instances, the company solutions.