<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1815-5944</journal-id>
<journal-title><![CDATA[Ingeniería Mecánica]]></journal-title>
<abbrev-journal-title><![CDATA[Ingeniería Mecánica]]></abbrev-journal-title>
<issn>1815-5944</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería Mecánica. Instituto Superior Politécnico "José Antonio Echeverría"]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1815-59442021000200037</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Generación de opciones de juegos de cilindros en talleres de laminación de perfiles]]></article-title>
<article-title xml:lang="en"><![CDATA[Options generation of rolling devices complexes in lamination workshops]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Arzola-Ruiz]]></surname>
<given-names><![CDATA[José]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[García-Marrero]]></surname>
<given-names><![CDATA[Luis Enrique]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echeverría Centro de Estudios de Matemática para las Ciencias Técnicas, CEMAT ]]></institution>
<addr-line><![CDATA[La Habana ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Holguín Oscar Lucero Moya Centro de Estudios CAD/CAM ]]></institution>
<addr-line><![CDATA[Holguín ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2021</year>
</pub-date>
<volume>24</volume>
<numero>2</numero>
<fpage>37</fpage>
<lpage>47</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S1815-59442021000200037&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S1815-59442021000200037&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S1815-59442021000200037&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen A partir del análisis sistémico de la función de planeación de la producción en fábricas siderúrgicas, se formuló el modelo matemático conceptual de la tarea de secuenciación de producción de los talleres de laminación de perfiles ligeros, en la industria siderúrgica. La muy conocida tarea del agente viajero el modelo obtenido constituye un caso particular de la tarea formulada. Se elaboró esquema de descomposición basado en el método Aproximante-Combinatorio en sub-modelos de generación de opciones de selección de juegos de cilindros de laminación para su utilización en la construcción de gráficos de intercambio de cilindros, asociados a la secuenciación de perfiles, y en la construcción misma de estos gráficos. Se solucionó la primera parte del esquema de descomposición mediante el método de Selección de Propuestas. Se describen brevemente los métodos utilizados y se brindan resultados de la solución experimental de la tarea enfrentada.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract Starting from the systemic analysis of the production planning function in steel factories, the conceptual mathematical model is formulated of the scheduling of lamination workshops in the Steel making industry. From the obtained model, the known Travelling Salesman Problem constitute a particular case. Based on the Approximation-Combinatorial method, this model breaks down into sub-models of selection of rolling device complexes for being used during the lamination and the sequencing of complexes interchange in the production process and the order of sequencing of these complexes. The first part of the decomposed problem has been solved using the Selection of Proposals method. Both used methods are being shortly described and experimental results obtained are exposed.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[toma de decisiones]]></kwd>
<kwd lng="es"><![CDATA[sistemas de ingeniería]]></kwd>
<kwd lng="es"><![CDATA[descomposición de tareas de optimización]]></kwd>
<kwd lng="es"><![CDATA[planeación de la producción]]></kwd>
<kwd lng="en"><![CDATA[decisions making]]></kwd>
<kwd lng="en"><![CDATA[engineering systems]]></kwd>
<kwd lng="en"><![CDATA[decomposition of optimization tasks]]></kwd>
<kwd lng="en"><![CDATA[planning of the steel making production]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Behnamian]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[FatemiGhomi SMT. A survey of multifactory scheduling]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2016</year>
<volume>27</volume>
<page-range>231-49</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2.</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pinedo]]></surname>
<given-names><![CDATA[ML.]]></given-names>
</name>
</person-group>
<source><![CDATA[Scheduling: Theory, Algorithms, and Systems]]></source>
<year>2016</year>
<edition>Fifth</edition>
<publisher-loc><![CDATA[New Jersey ]]></publisher-loc>
<publisher-name><![CDATA[Prentice-Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[QK]]></given-names>
</name>
<name>
<surname><![CDATA[Tasgetiren]]></surname>
<given-names><![CDATA[MF.]]></given-names>
</name>
<name>
<surname><![CDATA[Liang]]></surname>
<given-names><![CDATA[YC.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem]]></article-title>
<source><![CDATA[Comp. Oper. Res]]></source>
<year>2016</year>
<volume>35</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>2807-39</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[JQ]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[QK]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems]]></article-title>
<source><![CDATA[Eng. Appl. Artif. Intel]]></source>
<year>2015</year>
<volume>37</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>279-92</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Vázquez Rodríguez]]></surname>
<given-names><![CDATA[JA.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The hybrid flow shop scheduling problem]]></article-title>
<source><![CDATA[Eur. J. Oper. Res]]></source>
<year>2010</year>
<volume>205</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-18</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[JQ]]></given-names>
</name>
<name>
<surname><![CDATA[Sang]]></surname>
<given-names><![CDATA[YY]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[CG]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions]]></article-title>
<source><![CDATA[J. Clean. Prod]]></source>
<year>2018</year>
<volume>181</volume>
<page-range>584-98</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pezzella]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Morganti]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Ciaschetti]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for the flexible job-shop scheduling problem]]></article-title>
<source><![CDATA[Comp. Oper. Res]]></source>
<year>2018</year>
<volume>35</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>3202-12</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[JQ]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[QK]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems]]></article-title>
<source><![CDATA[Int. J. Prod. Res]]></source>
<year>2012</year>
<volume>50</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1063-78</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[JQ.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal chiller loading by improved invasive weed optimization algorithm for reducing energy consumption]]></article-title>
<source><![CDATA[Energy and Buildings]]></source>
<year>2018</year>
<volume>161</volume>
<page-range>80-8</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duan]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving chiller loading optimization problems using an improvedteaching-learning-based optimization algorithm]]></article-title>
<source><![CDATA[Optimal Control Applications &amp; Methods]]></source>
<year>2018</year>
<volume>39</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>65-77</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[JQ]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[JD]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[QK]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid artificial bee colony for optimizing a reverse logistics network system]]></article-title>
<source><![CDATA[Soft. Comput]]></source>
<year>2017</year>
<volume>21</volume>
<numero>20</numero>
<issue>20</issue>
<page-range>6001-18</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12.</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[JJ]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop]]></source>
<year>2018</year>
<publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13.</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arzola Ruiz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sistemas de Ingeniería]]></source>
<year>2012</year>
<publisher-loc><![CDATA[La Habana, Cuba ]]></publisher-loc>
<publisher-name><![CDATA[Editorial Félix Varela]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14.</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arzola Ruiz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Selección de Propuestas]]></source>
<year>1990</year>
<publisher-loc><![CDATA[La Habana, Cuba ]]></publisher-loc>
<publisher-name><![CDATA[Ed. Científico-Técnica]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kosiba]]></surname>
<given-names><![CDATA[ED]]></given-names>
</name>
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[JR]]></given-names>
</name>
<name>
<surname><![CDATA[Cobbs]]></surname>
<given-names><![CDATA[AE]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Discrete event sequencing as a traveling salesman problem]]></article-title>
<source><![CDATA[Computers in Industry]]></source>
<year>1992</year>
<volume>19</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>317-27</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16.</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xue]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<source><![CDATA[Optirnum hot rolling plan with modified discrete particle swarm optimization]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Symposium on Intelligent Control]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B17">
<label>17.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Rong]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A MTSP model for hot rolling scheduling in baosteel complex]]></article-title>
<source><![CDATA[IFAC Proceedings]]></source>
<year>1999</year>
<volume>32</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>7056-61</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18.</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Rong]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multiple traveling salesman problem model for hot rolling scheduling in shanghai baoshan iron &amp; steel complex]]></article-title>
<source><![CDATA[European Journal of Operational Re­search]]></source>
<year>2000</year>
<volume>124</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>267-82</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
