<?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-5936</journal-id>
<journal-title><![CDATA[Ingeniería Industrial]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. Ind.]]></abbrev-journal-title>
<issn>1815-5936</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería Industrial, Instituto Superior Politécnico José Antonio Echeverría, Cujae.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1815-59362019000300260</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Algoritmo para la programación integrada producción - mantenimiento preventivo en máquinas paralelas idénticas]]></article-title>
<article-title xml:lang="en"><![CDATA[Algorithm for integrated programming of production and preventive maintenance on identical parallel machines]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Díaz-Cazañas]]></surname>
<given-names><![CDATA[Ronald]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[De La Paz-Martínez]]></surname>
<given-names><![CDATA[Estrella M.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Delgado-Sobrino]]></surname>
<given-names><![CDATA[Daynier R.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Central &#8220;Marta Abreu&#8221; de Las Villas  ]]></institution>
<addr-line><![CDATA[Santa Clara ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Slovak University of Technology Faculty of Materials Science and Technology in Trnava ]]></institution>
<addr-line><![CDATA[Trnava Bratislava]]></addr-line>
<country>Slovak Republic</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<volume>40</volume>
<numero>3</numero>
<fpage>260</fpage>
<lpage>271</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S1815-59362019000300260&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S1815-59362019000300260&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S1815-59362019000300260&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Se muestra un algoritmo para la programación integrada de producción y mantenimiento preventivo en una configuración productiva de máquinas paralelas idénticas, teniendo como objetivo minimizar el tiempo total de fabricación. El algoritmo fue estructurado en dos fases. En la primera se obtiene una solución inicial, resultado del diseño de una heurística constructiva inspirada en la regla de despacho Largest Processing Time, con algunas modificaciones para considerar la naturaleza estocástica del problema y la posibilidad de que varios trabajos puedan tener fechas de lanzamiento diferentes. En la fase dos se intenta mejorar la solución inicial utilizando un método de recocido simulado. Como forma de evaluar su factibilidad el algoritmo fue aplicado en una empresa productora de artículos plásticos, demostrándose mediante los resultados obtenidos sus potencialidades como mecanismo de mejoramiento de las capacidades de operaciones.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT The present paper introduces an algorithm for the integrated programming of production and preventive maintenance in a productive configuration of identical parallel machines, aiming to minimize the total manufacturing time. The algorithm has been structured in two phases; in the first one, an initial solution is obtained, resulting from the application of a designed and proposed constructive heuristic that is inspired by the Largest Processing Time dispatch rule, with some modifications allowing it to consider the stochastic nature of the problem and the possibility that several jobs may have different release dates; in phase 2, an attempt is made to improve the initial solution using a simulated annealing method. As a way of evaluating its feasibility the algorithm was implemented in a company producing products derived from plastic, demonstrating through the results obtained its potential as a mechanism to improve operational capabilities.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[producción]]></kwd>
<kwd lng="es"><![CDATA[mantenimiento]]></kwd>
<kwd lng="es"><![CDATA[programación integrada]]></kwd>
<kwd lng="es"><![CDATA[heurística]]></kwd>
<kwd lng="es"><![CDATA[recocido simulado]]></kwd>
<kwd lng="en"><![CDATA[production]]></kwd>
<kwd lng="en"><![CDATA[maintenance]]></kwd>
<kwd lng="en"><![CDATA[integrated programming]]></kwd>
<kwd lng="en"><![CDATA[heuristic]]></kwd>
<kwd lng="en"><![CDATA[simulated annealing]]></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[Zahedi]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Salim]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Integrating Preventive Maintenance Scheduling as Probability Machine Failure and Batch Production Scheduling]]></article-title>
<source><![CDATA[Computer, Mathematics and Engineering Applications]]></source>
<year>2017</year>
<volume>7</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>105-12</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jing]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Hua]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<source><![CDATA[Multi-objective Integrated Optimization Problem of Preventive Maintenance Planning and Flexible Job-Shop Scheduling]]></source>
<year>2017</year>
<conf-name><![CDATA[ 23rdInternational Conference on Industrial Engineering and Engineering Management]]></conf-name>
<conf-loc>Sl </conf-loc>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boudjelida]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the robustness of joint production and maintenance scheduling in presence of uncertainties]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2017</year>
<numero>1</numero>
<issue>1</issue>
<page-range>1-16</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[Chansombat]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Pongcharoen]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Hicks]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A mixed-integer linear programming model for integrated production and preventive maintenance scheduling in the capital goods industry]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2018</year>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</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>2012</year>
<edition>4. ed</edition>
<publisher-loc><![CDATA[New York, Estados Unidos ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coffman]]></surname>
<given-names><![CDATA[EG]]></given-names>
</name>
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[MR]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[DS]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An application of Bin-Packing to multiprocessor scheduling]]></article-title>
<source><![CDATA[SIAM J COMPUT]]></source>
<year>1978</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-17</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[Anily]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Bramel]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Simchi-Levi]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Worst-case analysis of heuristics for the Bin Packing Problem with general cost structures]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1992</year>
<volume>42</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>287-98</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[Johnson]]></surname>
<given-names><![CDATA[DS]]></given-names>
</name>
<name>
<surname><![CDATA[Demers]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Ullman]]></surname>
<given-names><![CDATA[JD]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Worst-case performance bounds for simple one-dimensional packing algorithms]]></article-title>
<source><![CDATA[SIAM J Comput]]></source>
<year>1974</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>299-325</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baker]]></surname>
<given-names><![CDATA[KR]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Sequencing and Scheduling]]></source>
<year>1974</year>
<publisher-loc><![CDATA[New York, Estados Unidos ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley and Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carlier]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling jobs with release dates and tails on identical machines to minimize the makepan]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1987</year>
<volume>29</volume>
<page-range>298-306</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[Gharbi]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Haouari]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Minimizing makespan on parallel machines subject to reléase dates and delivery times]]></article-title>
<source><![CDATA[Journal of scheduling]]></source>
<year>2002</year>
<numero>5</numero>
<issue>5</issue>
<page-range>329-55</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[CY]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Parallel machines scheduling with non-simultaneous machine available time]]></article-title>
<source><![CDATA[Discrete Appl Math]]></source>
<year>1991</year>
<numero>30</numero>
<issue>30</issue>
<page-range>53-61</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Machine scheduling with an availability constraint]]></article-title>
<source><![CDATA[Journal of Global Optimization]]></source>
<year>1996</year>
<numero>9</numero>
<issue>9</issue>
<page-range>395-416</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A note on &#8220;parallel machine scheduling with non-simultaneous machine available time&#8221;]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2000</year>
<numero>100</numero>
<issue>100</issue>
<page-range>133-5</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2008</year>
<numero>35</numero>
<issue>35</issue>
<page-range>1344-134 9</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi machine scheduling with deteriorating jobs and scheduled maintenance]]></article-title>
<source><![CDATA[Applied Mathematical Modelling]]></source>
<year>2008</year>
<numero>32</numero>
<issue>32</issue>
<page-range>362-73</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mirabedini S]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Iranmanesh]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A scheduling model for serial jobs on parallel machines with different preventive maintenance]]></article-title>
<source><![CDATA[Int J Adv Manuf Technol]]></source>
<year>2014</year>
<numero>70</numero>
<issue>70</issue>
<page-range>1579-89</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[Wang]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning]]></article-title>
<source><![CDATA[Journal of Manufacturing Systems]]></source>
<year>2015</year>
<numero>37</numero>
<issue>37</issue>
<page-range>182-92</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Da]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Feng]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Integrated preventive maintenance and production scheduling optimization on uniform parallel machines with deterioration effect]]></source>
<year>2016</year>
<conf-name><![CDATA[ 2016 Estados Unidos. IEEM]]></conf-name>
<conf-loc> </conf-loc>
<page-range>951-5</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora Gutiérrez]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Mantenimiento Industrial Efectivo]]></source>
<year>2012</year>
<edition>2 ed</edition>
<publisher-loc><![CDATA[Medellín, Colombia ]]></publisher-loc>
<publisher-name><![CDATA[AMG]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cassady]]></surname>
<given-names><![CDATA[CR]]></given-names>
</name>
<name>
<surname><![CDATA[Kutanoglu]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Minimizing job tardiness using integrated preventive maintenance planning and production scheduling]]></article-title>
<source><![CDATA[IIE Transactions]]></source>
<year>2003</year>
<numero>35</numero>
<issue>35</issue>
<page-range>503-13</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[W]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Xi]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Single-machine-based production scheduling model integrated preventive maintenance planning]]></article-title>
<source><![CDATA[Int J Adv Manuf Technol]]></source>
<year>2010</year>
<numero>50</numero>
<issue>50</issue>
<page-range>365-75</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
