Title of article
An efficientoptimalsolutiontothecoilsequencingproblemin electro-galvanizingline
Author/Authors
Lixin Tang، نويسنده , , YangYang ، نويسنده , , JiyinLiu ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
17
From page
1780
To page
1796
Abstract
This paperstudiesacoilsequencingproblemthatarisesfromelectro-galvanizinglineinsteelindustry.
The problemistofindaprocessingsequenceofsteelcoilssuchthattheswitchingcostsbetween
consecutivecoilsareminimizedwhilesatisfyingtechnicalrestrictions.Theproblemcanbedecomposed
into severalindependentsub-problems,eachcorrespondingtoaturnwhichisasequenceof
continuouslyprocessedcoilswiththesamepost-processingrequirement.Thecoilsineachturncanbe
further dividedintoseveralfamilieseachconsistingofthecoilswiththesamewidth.Basedonanalysis
of theproblemproperties,atwo-phasepolynomialalgorithmisdevelopedtoobtainanoptimalturn.
The sequenceofcoilsinafamilywithgivenboundarycoils(firstandlastcoils)isdeterminedinthefirst
phase usingapolynomialdynamicprogrammingalgorithm.Inthesecondphase,theoptimalturnis
formedbyanotherpolynomialdynamicprogrammingalgorithmwhichtakestheboundarycoilsfor
each familyasstatevariables.Theefficiencyoftheproposedalgorithmisdemonstratedthrough
computationalexperiments.
Keywords
Steel production , Modelling , Dynamic programming , Electro-galvanizing line , Sequencing
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927784
Link To Document