<?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>2007-7467</journal-id>
<journal-title><![CDATA[RIDE. Revista Iberoamericana para la Investigación y el Desarrollo Educativo]]></journal-title>
<abbrev-journal-title><![CDATA[RIDE. Rev. Iberoam. Investig. Desarro. Educ]]></abbrev-journal-title>
<issn>2007-7467</issn>
<publisher>
<publisher-name><![CDATA[Centro de Estudios e Investigaciones para el Desarrollo Docente A.C.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2007-74672023000200119</article-id>
<article-id pub-id-type="doi">10.23913/ride.v14i27.1577</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Aplicación de algoritmos genéticos con reglas de decisión en el balanceo de líneas en forma de U estocástico]]></article-title>
<article-title xml:lang="en"><![CDATA[Application of genetic algorithms with decision rules in stochastic u-shaped line balancing]]></article-title>
<article-title xml:lang="pt"><![CDATA[Aplicação de algoritmos genéticos com regras de decisão no balanceamento estocástico de linhas em U]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Fermán Alvarez]]></surname>
<given-names><![CDATA[Demetrio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez Contreras]]></surname>
<given-names><![CDATA[Ulises]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Parada González]]></surname>
<given-names><![CDATA[Mirella]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Woocay Prieto]]></surname>
<given-names><![CDATA[Arturo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Valles Chávez]]></surname>
<given-names><![CDATA[Adán]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Tecnológico Nacional de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Tecnológico Nacional de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<aff id="Af3">
<institution><![CDATA[,Tecnológico Nacional de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Tecnológico Nacional de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Tecnológico Nacional de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2023</year>
</pub-date>
<volume>14</volume>
<numero>27</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S2007-74672023000200119&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S2007-74672023000200119&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S2007-74672023000200119&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Actualmente, la mayoría de investigaciones acerca del problema de balaceo de líneas de ensamble consideran que los tiempos de las tareas son determinados. Sin embargo, en los procesos de fabricación siempre existe la posibilidad de obtener en los procesos variaciones que impactan en los tiempos de las tareas. Por eso, en el presente trabajo, con base en un enfoque estocástico, se presenta un método que utiliza técnicas metaheurísticas mediante un algoritmo genético, el cual tiene como objetivo brindar una solución al problema de balanceo tipo 1 de líneas en forma de U con tiempos de tarea estocásticos. Para ello, se han tomado como referencia problemas existentes en la literatura para luego ofrecer una comparación entre las soluciones existentes. En el proceso de validación se utilizaron siete categorías de problemas resueltos por otro método. La solución brindada por el algoritmo se sometió a un análisis experimental de los datos para comprobar si era capaz de dar una o más soluciones mejores a las existentes; de ese modo, se buscó balancear la línea con la menor cantidad de recursos humanos posible. Los datos muestran mejores soluciones para los problemas de alta varianza únicamente en el resultado WS mayor, donde se observa una diferencia del 4 %; en los demás hallazgos los porcentajes son mejores. Además, se encontraron seis soluciones mejores a las existentes.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Currently, most of the research on the assembly line balancing problem considers that the task times are determined. However, in manufacturing processes there is always the possibility of obtaining variations in the processes, these variations lead to variations in the task times, which leads to address this type of problem from a stochastic approach. This paper presents a method that uses metaheuristic techniques, through a genetic algorithm which aims to solve the problem of balancing type 1 of U-shaped lines with stochastic task times using existing problems in the literature and then make a comparison between the existing solutions.  Seven categories of problems solved by another method were used for the validation process. The solution provided by the algorithm was subjected to an experimental analysis of the data to check if it is capable of providing one or more solutions that are better than the existing ones, seeking to balance the line with the least amount of human resources possible. The results show better solutions for the high variance problems, only for the WS Major result a difference of 4% is observed, but in the remaining results the percentages are better. It can be observed that 6 better solutions were found than the existing ones.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[Resumo  Atualmente, a maioria das pesquisas sobre o problema de balanceamento de linha de montagem considera que os tempos das tarefas são determinados. Porém, em processos de fabricação sempre existe a possibilidade de se obter variações nos processos que impactam os tempos das tarefas. Por esse motivo, no presente trabalho, baseado em uma abordagem estocástica, é apresentado um método que utiliza técnicas metaheurísticas por meio de um algoritmo genético, que visa fornecer uma solução para o problema de balanceamento tipo 1 de linhas em forma de U com tempos de tarefas estocásticas . Para isso, foram tomados como referência problemas existentes na literatura para posteriormente oferecer uma comparação entre as soluções existentes. No processo de validação, foram utilizadas sete categorias de problemas resolvidos por outro método. A solução fornecida pelo algoritmo foi submetida a uma análise experimental dos dados para verificar se era capaz de dar uma ou mais soluções melhores que as existentes; Desta forma, buscou-se equilibrar a linha com a menor quantidade de recursos humanos possível. Os dados mostram melhores soluções para problemas de alta variância apenas no maior resultado de WS, onde se observa uma diferença de 4%; nos demais achados as porcentagens são melhores. Além disso, foram encontradas seis soluções melhores que as existentes.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[técnicas metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[solución al problema de balanceo]]></kwd>
<kwd lng="es"><![CDATA[líneas en forma de U]]></kwd>
<kwd lng="es"><![CDATA[estocásticos]]></kwd>
<kwd lng="es"><![CDATA[validación]]></kwd>
<kwd lng="en"><![CDATA[metaheuristic techniques]]></kwd>
<kwd lng="en"><![CDATA[solution to the balancing problem]]></kwd>
<kwd lng="en"><![CDATA[U-shaped lines]]></kwd>
<kwd lng="en"><![CDATA[stochastics]]></kwd>
<kwd lng="en"><![CDATA[validation]]></kwd>
<kwd lng="pt"><![CDATA[técnicas metaheurísticas]]></kwd>
<kwd lng="pt"><![CDATA[solução do problema de balanceamento]]></kwd>
<kwd lng="pt"><![CDATA[linhas em forma de U]]></kwd>
<kwd lng="pt"><![CDATA[estocástica]]></kwd>
<kwd lng="pt"><![CDATA[validação]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baykaso&#287;lu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Özbak&#305;r]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Stochastic U-line balancing using genetic algorithms]]></article-title>
<source><![CDATA[The International Journal of Advanced Manufacturing Technology]]></source>
<year>2006</year>
<volume>32</volume>
<page-range>139-47</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cortez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Teoría de la complejidad computacional y teoría de la computabilidad]]></article-title>
<source><![CDATA[Revista de Investigación se Sistemas e Informática]]></source>
<year>2004</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>102-5</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Esparza]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[EDA para la resolución de problemas de optimización con restricciones]]></source>
<year>2009</year>
<publisher-name><![CDATA[Centro de Investigación en Matemáticas]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gallego]]></surname>
<given-names><![CDATA[R. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Escobar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Toro]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Técnicas heurísticas y metaheurísticas de optimización]]></source>
<year>2015</year>
<publisher-name><![CDATA[Universidad Tecnológica de Pereira]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Maldonado]]></surname>
<given-names><![CDATA[C. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Metaheurísticas y resolución de problemas complejos]]></article-title>
<source><![CDATA[Revista Colombiana de Filosofía de la Ciencia]]></source>
<year>2016</year>
<volume>16</volume>
<numero>33</numero>
<issue>33</issue>
<page-range>169-85</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics Approach to Solving U-Shaped Assembly Line Balancing Problems using a Rule-Base Coded Genetic Algorithm]]></source>
<year>2015</year>
<publisher-name><![CDATA[Department of Mechanical Engineering]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Orejuela]]></surname>
<given-names><![CDATA[J. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Flórez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Balanceo de líneas de producción en la industria farmacéutica mediante programación por metas]]></article-title>
<source><![CDATA[INGE CUC]]></source>
<year>2019</year>
<volume>15</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>109-22</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scholl]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data of assembly line balancing problems]]></source>
<year>1993</year>
<publisher-name><![CDATA[TH Darmstadt]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Urban]]></surname>
<given-names><![CDATA[T. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Chiang]]></surname>
<given-names><![CDATA[W. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An optimal piecewise-linear program for the U-line balancing problem with stochastic task times]]></article-title>
<source><![CDATA[Eur J Oper Res]]></source>
<year>2006</year>
<volume>168</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>771-82</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Peng]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Tian]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[XU Liu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Peng]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Balancing Problem of Stochastic Large-Scale U-Type Assembly Lines Using a Modified Evolutionary Algorithm]]></source>
<year>2018</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
