<?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>1405-7743</journal-id>
<journal-title><![CDATA[Ingeniería, investigación y tecnología]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. invest. y tecnol.]]></abbrev-journal-title>
<issn>1405-7743</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Facultad de Ingeniería]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-77432020000100006</article-id>
<article-id pub-id-type="doi">10.22201/fi.25940732e.2020.21n1.006</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Sistema de producción multi-línea optimizado por PSO]]></article-title>
<article-title xml:lang="en"><![CDATA[Multiple system of production optimized by PSO]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Quezada-Aguilar]]></surname>
<given-names><![CDATA[Víctor]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Seck Tuoh-Mora]]></surname>
<given-names><![CDATA[Juan Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Quezada-Quezada]]></surname>
<given-names><![CDATA[Jose Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cuatepotzo-Bravo]]></surname>
<given-names><![CDATA[Arturo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma del Estado de Hidalgo Escuela Superior de Tizayuca ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma del Estado de Hidalgo Área académica de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Autónoma del Estado de Hidalgo Escuela Superior de Tizayuca ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Instituto Tecnológico de Monterrey Campus Hidalgo, Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2020</year>
</pub-date>
<volume>21</volume>
<numero>1</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-77432020000100006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-77432020000100006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-77432020000100006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen La competitividad en el sector industrial nacional e internacional exige variabilidad de productos, donde la flexibilidad de los sistemas productivos es el eje principal. Sin embargo, el manejo inadecuado de los recursos disminuye el factor de competencia en los mercados. Este documento analiza el problema de asignación de órdenes de producción en un sistema flexible, que tiene 4 líneas productivas, donde cada una cuenta hasta con 6 estaciones de trabajo. La producción es de 10 lotes, cada uno de ellos contiene hasta 5 productos diferentes. El objetivo es encontrar la asignación de lotes para su procesamiento en las líneas de producción, que optimicen el tiempo total de procesamiento, así como el tiempo total de demora. Para lograr el objetivo se evalúan soluciones en un simulador del sistema productivo; la optimización de las funciones objetivo le corresponde al algoritmo PSO (Particle Swarm Optimization). La optimización se realiza primero para cada función objetivo y después para ambas considerando pesos ponderados. Los resultados muestran correlación en los valores de las funciones objetivo, sin embargo la solución del óptimo de la función objetivo 1 no lo es para la función objetivo 2 y viceversa. Una limitante en el proceso de optimización es la aleatoriedad que existe en el sistema de producción, lo que implica tener valores diferentes para una misma solución. No obstante, el proceso de optimización mantiene la solución óptima.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The competitiveness in the national and international industrial sectors requires product variability, where the flexibility of the production systems is the central axis. However, the inadequate management of resources diminishes the competition factor in the markets. The document considers the problem of assigning production orders in a flexible system that has four production lines where each one has up to 6 work stations. The production is of 10 lots where each of them contains up to 5 different products. The objective is to find the allocation of batches for processing to the production lines, which optimize the total processing time as well as the total delay time. To achieve the objective, solutions are evaluated in a production system simulator where the optimization of the objective functions corresponds to the PSO (Particle Swarm Optimization) algorithm. The optimization is done first for each objective function and then taking both considering weighted weights. The results show a correlation in the values of the objective functions. Nevertheless, the solution of the optimum of the objective function 1 is not for objective function 2 and vice versa. One limitation in the optimization process is the randomness that exists in the production system, which implies having different values for the same solution; however, the optimization process maintains the optimal solution.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Optimización]]></kwd>
<kwd lng="es"><![CDATA[órdenes de producción]]></kwd>
<kwd lng="es"><![CDATA[PSO]]></kwd>
<kwd lng="es"><![CDATA[sistema de producción]]></kwd>
<kwd lng="es"><![CDATA[manufactura flexible]]></kwd>
<kwd lng="en"><![CDATA[Optimization]]></kwd>
<kwd lng="en"><![CDATA[production orders]]></kwd>
<kwd lng="en"><![CDATA[PSO]]></kwd>
<kwd lng="en"><![CDATA[production system]]></kwd>
<kwd lng="en"><![CDATA[flexible manufacturing]]></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[Acosta-Flores]]></surname>
<given-names><![CDATA[J.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algoritmo para analizar decisiones con objetivos múltiples bajo incertidumbre]]></article-title>
<source><![CDATA[Ingeniería Investigación y Tecnología]]></source>
<year>2019</year>
<volume>XX</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bellgran]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Säfsten]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Production development design and operation of production systems]]></source>
<year>2010</year>
<volume>1</volume>
<publisher-loc><![CDATA[New York, EUA ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ben-Guedria]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improved accelerated PSO algorithm for mechanical engineering optimization problems]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2016</year>
<volume>40</volume>
<page-range>455-67</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[You]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Wassick]]></surname>
<given-names><![CDATA[J.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Agarwal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Integrated planning and scheduling under production uncertainties: Bi-level model formulation and hybrid solution method]]></article-title>
<source><![CDATA[Computers and Chemical Engineering]]></source>
<year>2015</year>
<volume>72</volume>
<page-range>255-72</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cuevas-Jiménez]]></surname>
<given-names><![CDATA[E.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Osuna-Enciso]]></surname>
<given-names><![CDATA[J.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliva-Navarro]]></surname>
<given-names><![CDATA[D.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Díaz-Cortés]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimización, algoritmos programados con MATLAB]]></source>
<year>2017</year>
<edition>1ª</edition>
<publisher-loc><![CDATA[CDMX, México ]]></publisher-loc>
<publisher-name><![CDATA[Alfaomega]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dorigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Birattari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Stützle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ant colony optimization artificial ants as a computational intelligence technique]]></article-title>
<source><![CDATA[IEEE Comput. Intell. Mag.]]></source>
<year>2006</year>
<volume>I</volume>
<page-range>28-39</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eskandar]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Sadollah]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bahreininejad]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Hamdi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Water cycle algorithm a novel metaheuristic optimization method for solving constrained engineering optimization problems]]></article-title>
<source><![CDATA[Comput. Struct]]></source>
<year>2012</year>
<volume>110</volume>
<page-range>151-66</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithms in search, optimization and machine learning]]></source>
<year>1989</year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guinet]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-site planning: A transshipment problem]]></article-title>
<source><![CDATA[International journal of production economics]]></source>
<year>2001</year>
<volume>74</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>21-32</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Ren]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modeling and Pareto optimization of multi-objective order scheduling problems in production planning]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2013</year>
<numero>64</numero>
<issue>64</issue>
<page-range>972-86</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holland]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptation in natural and artificial systems: An introductory analysis with applications to biology, Control, and artificial intelligence.]]></source>
<year>1975</year>
<publisher-name><![CDATA[University of Michigan]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoon-Kim]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Hoon-Lee]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Synchronnized production planning and scheduling in semiconductor fabrication]]></article-title>
<source><![CDATA[Computer and industrial engineering]]></source>
<year>2016</year>
<numero>96</numero>
<issue>96</issue>
<page-range>72-85</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Husseinzadeh-Kashan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient algorithm for constrained global optimization and application to mechanical engineering design: league championship algorithm (LCA)]]></article-title>
<source><![CDATA[Comput. Des.]]></source>
<year>2011</year>
<volume>43</volume>
<page-range>1769-92</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Józefowska]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zimniak]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization tool for short-term production planning and scheduling]]></article-title>
<source><![CDATA[International journal de production economics]]></source>
<year>2008</year>
<volume>112</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>109-20</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Basturk]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Artificial bee colony (ABC) optimization algorithm for solving constrained optimization]]></article-title>
<source><![CDATA[LNAI]]></source>
<year>2007</year>
<volume>4529</volume>
<page-range>789-98</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kennedy]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Eberhart]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Particle swarm optimization]]></source>
<year>1995</year>
<conf-name><![CDATA[ International Conference on Neural Networks. IV]]></conf-name>
<conf-loc>Perth, Australia </conf-loc>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Geem]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new structural optimization method based on the harmony search algorithm]]></article-title>
<source><![CDATA[Comput. Struct]]></source>
<year>2004</year>
<volume>82</volume>
<page-range>781-98</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leung]]></surname>
<given-names><![CDATA[S.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Tsang]]></surname>
<given-names><![CDATA[S.O.]]></given-names>
</name>
<name>
<surname><![CDATA[Lung]]></surname>
<given-names><![CDATA[W.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A robust optimization model for multi-site production planning problem in an uncertain environment]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2017</year>
<volume>181</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>224-38</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López-Sánchez]]></surname>
<given-names><![CDATA[A.Y.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Lara]]></surname>
<given-names><![CDATA[A.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Alcaraz-Corona]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulación para la optimización de la producción de ejes en la línea de ensamblaje de una empresa de manufactura]]></article-title>
<source><![CDATA[Ingeniería Investigación y Tecnología]]></source>
<year>2019</year>
<volume>XX</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-9</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Man]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kwong]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ip]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithm to production planning and scheduling problems for manufacturing systems]]></article-title>
<source><![CDATA[Production Planning y control]]></source>
<year>2000</year>
<volume>11</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>443-58</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mori]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahalec]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Planning and scheduling of steel plates production. Part II: Scheduling of continuous casting]]></article-title>
<source><![CDATA[Computer and Chemical Engineering]]></source>
<year>2017</year>
<numero>101</numero>
<issue>101</issue>
<page-range>312-25</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pedersen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chipperfield]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simplifying Particle Swarm Optimization]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2010</year>
<volume>10</volume>
<page-range>618-28</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sadollah]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bahreininejad]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Eskandar]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hamdi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems]]></article-title>
<source><![CDATA[Appl. Soft Comput. J]]></source>
<year>2013</year>
<volume>13</volume>
<page-range>2592-612</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Timpe]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Kallrath]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal planning in large multi-site production networks]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2000</year>
<volume>126</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>422-35</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Firefly algorithms for multimodal optimization]]></source>
<year>2009</year>
<volume>5792</volume>
<page-range>169-78</page-range><publisher-name><![CDATA[Lect. Notes Comput. Sci]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
