.png){kind=icon}
Return
Scheduling in a continuous galvanizing line
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2007.09.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2007 Elsevier Ltd. All rights reserved.
Keywords:
Tabu Search
Single machine scheduling problem
Steel industry
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more