<?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>1909-8367</journal-id>
<journal-title><![CDATA[Entre Ciencia e Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Entre Ciencia e Ingenieria]]></abbrev-journal-title>
<issn>1909-8367</issn>
<publisher>
<publisher-name><![CDATA[Universidad Católica de Pereira]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1909-83672018000200105</article-id>
<article-id pub-id-type="doi">10.31908/19098367.3820</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Optimización del makespan en el problema de Job Shop Flexible con restricciones de transporte usando Algoritmos Genéticos]]></article-title>
<article-title xml:lang="en"><![CDATA[Makespan optimization in the flexible Job Shop problem with transportation constraints using Genetic Algorithms]]></article-title>
<article-title xml:lang="pt"><![CDATA[Otimização da Makespan no problema flexível da Job Shop com restrição de transporte usando Algoritmos Genéticos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castillo]]></surname>
<given-names><![CDATA[T. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[C. E.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gómez]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Orduz]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Niño]]></surname>
<given-names><![CDATA[M. L.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[Bucaramanga ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[Bucaramanga ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Avianca  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,IBM  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[Bucaramanga ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<volume>12</volume>
<numero>24</numero>
<fpage>105</fpage>
<lpage>115</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S1909-83672018000200105&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S1909-83672018000200105&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S1909-83672018000200105&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: En el presente artículo se aborda el problema Flexible Job Shop Scheduling (FJSSP) con restricciones de transporte, con el objetivo de minimizar el makespan realizando la secuenciación y asignación de máquinas. Se llevó a cabo una revisión bibliográfica para orientar la metodología a utilizar, y a partir de allí, se decidió abordar el problema con un algoritmo genético, validando su efectividad a través de la comparación de los resultados obtenidos con distintas instancias propuestas en la literatura. Los resultados obtenidos muestran que el algoritmo genético propuesto es eficiente en las diferentes configuraciones del Job Shop clásico probadas, y para el Job Shop flexible con restricciones de transportes se presentan soluciones muy aproximadas a las mejores encontradas hasta el día de hoy.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: We solved the Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints in order to minimize the makespan by sequencing and assigning machines. A bibliographic review was made in order to guide the methodology to be used. From there, we approached the problem with a genetic algorithm. We validated its effectiveness by comparing the results obtained with different instances proposed in the literature. The results obtained show that the proposed genetic algorithm is efficient in the different classic Job Shop configurations tested. The algorithm is able to find very approximate solutions to the best found to date for the Flexible Job Shop Scheduling Problem with transportation constraints.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[Resumo: Resolvemos o Problema de Agendamento de Oficina de Trabalho Flexível (FJSSP) com restrições de transporte para minimizar o makespan por sequenciamento e atribuição de máquinas. Uma revisão bibliográfica foi realizada para orientar a metodologia a ser utilizada. A partir daí, abordamos o problema com um algoritmo genético. Nós validamos sua eficácia comparando os resultados obtidos com diferentes instâncias propostas na literatura. Os resultados obtidos mostram que o algoritmo genético proposto é eficiente nas diferentes configurações clássicas de Job Shop testadas. O algoritmo é capaz de encontrar soluções muito aproximadas para o melhor encontrado até o momento para o Problema de Agendamento de Oficina de Trabalho Flexível com restrições de transporte.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Algoritmo genético]]></kwd>
<kwd lng="es"><![CDATA[AG, Job Shop]]></kwd>
<kwd lng="es"><![CDATA[Job Shop Flexible]]></kwd>
<kwd lng="es"><![CDATA[Job Shop Flexible Restricciones de transporte]]></kwd>
<kwd lng="es"><![CDATA[Metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[Makespan]]></kwd>
<kwd lng="es"><![CDATA[Restricciones de transporte]]></kwd>
<kwd lng="en"><![CDATA[Job Shop]]></kwd>
<kwd lng="en"><![CDATA[Flexible Job Shop]]></kwd>
<kwd lng="en"><![CDATA[Flexible Job Shop with transportation constraints]]></kwd>
<kwd lng="en"><![CDATA[Transportation constraints]]></kwd>
<kwd lng="en"><![CDATA[Genetic Algorithm]]></kwd>
<kwd lng="en"><![CDATA[GA]]></kwd>
<kwd lng="en"><![CDATA[Metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[Makespan]]></kwd>
<kwd lng="pt"><![CDATA[Job Shop]]></kwd>
<kwd lng="pt"><![CDATA[flexível Job Shop]]></kwd>
<kwd lng="pt"><![CDATA[flexível Job Shop com restrições de transporte]]></kwd>
<kwd lng="pt"><![CDATA[restrições de transporte]]></kwd>
<kwd lng="pt"><![CDATA[algoritmo genético]]></kwd>
<kwd lng="pt"><![CDATA[GA]]></kwd>
<kwd lng="pt"><![CDATA[Metaheuristics]]></kwd>
<kwd lng="pt"><![CDATA[Makespan]]></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[Zhang]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Shao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2009</year>
<volume>56</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1309-18</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid algorithm for flexible job-shop scheduling problem]]></article-title>
<source><![CDATA[Procedia Engineering]]></source>
<year>2011</year>
<volume>15</volume>
<page-range>3678-83</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fernández]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soluciones metaheurísticas al &#8216;Job-shop scheduling problem with sequence-dependent setup times]]></source>
<year>2011</year>
<publisher-loc><![CDATA[España ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Oviedo]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rossi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2014</year>
<volume>153</volume>
<page-range>253-67</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[D. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and intractability: a guide to the theory of NP-completeness]]></source>
<year>1979</year>
<publisher-loc><![CDATA[San Francisco ]]></publisher-loc>
<publisher-name><![CDATA[LA: Freeman]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="book">
<source><![CDATA[John Henry Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence]]></source>
<year>1992</year>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[MA: MIT press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[A. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Meeran]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Deterministic job-shop scheduling: Past, present and future]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>1999</year>
<volume>113</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>390-434</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[Graham]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Lawler]]></surname>
<given-names><![CDATA[E. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[J. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kan]]></surname>
<given-names><![CDATA[A. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization and approximation in deterministic sequencing and scheduling: a survey]]></article-title>
<source><![CDATA[Annals of discrete mathematics]]></source>
<year>1979</year>
<volume>5</volume>
<page-range>287-326</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[Conway]]></surname>
<given-names><![CDATA[R. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Maxwell]]></surname>
<given-names><![CDATA[W. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Miller]]></surname>
<given-names><![CDATA[L. W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Theory of scheduling.]]></source>
<year>2012</year>
<publisher-name><![CDATA[Courier Corporation]]></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[Johnson]]></surname>
<given-names><![CDATA[S. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal two and three stage production schedules with setup times included]]></article-title>
<source><![CDATA[Naval research logistics quarterly]]></source>
<year>1954</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>61-8</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Najid]]></surname>
<given-names><![CDATA[N. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Dauzere-Pérès]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Zaidat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A modified simulated annealing method for flexible job shop scheduling problem]]></source>
<year></year>
<volume>5</volume>
<conf-name><![CDATA[ IEEE International Conference on Systems, Man and Cybernetics]]></conf-name>
<conf-date>2002</conf-date>
<conf-loc> </conf-loc>
<page-range>6</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[Brucker]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schlie]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Job-shop scheduling with multi-purpose machines]]></article-title>
<source><![CDATA[Computing]]></source>
<year>1990</year>
<volume>45</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>369-75</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jansen]]></surname>
<given-names><![CDATA[k.]]></given-names>
</name>
<name>
<surname><![CDATA[Mastrolilli]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Solis-Oba]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximation algorithms for flexible job shop problems]]></source>
<year>2000</year>
<page-range>68-77</page-range><publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jiménez]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Muñoz]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Toro]]></surname>
<given-names><![CDATA[E. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solución del Problema de Flow Shop Flexible Aplicando el Algoritmo Genético de Chu- Beasley]]></article-title>
<source><![CDATA[Entre Ciencia e Ingeniería]]></source>
<year>2013</year>
<volume>7</volume>
<numero>13</numero>
<issue>13</issue>
<page-range>34-40</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[Xia]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2005</year>
<volume>48</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>409-25</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[Osorio]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Motoa]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Planificación jerárquica de la producción en un job shop flexible]]></article-title>
<source><![CDATA[Revista Facultad de Ingeniería Universidad de Antioquia]]></source>
<year>2008</year>
<numero>44</numero>
<issue>44</issue>
<page-range>158-71</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[Gao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2006</year>
<volume>17</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>493-507</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[Zhang]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Shao]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2009</year>
<volume>56</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1309-18</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>[19]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De Giovanni]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Pezzella]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved genetic algorithm for the distributed and flexible job-shop scheduling problem]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2010</year>
<volume>200</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>395-408</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Manier]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Manier]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm with Tabu Search procedure for flexible Job Shop Scheduling with transportation constraints and bounded processing times]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1713-23</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moslehi]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahnam]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Pareto approach to multi-objective flexible Job-Shop Scheduling problem using Particle Swarm Optimization and local search]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2011</year>
<volume>129</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>14-22</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez Vela]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Varela]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[An efficient memetic algorithm for the flexible job shop with setup times]]></source>
<year></year>
<conf-name><![CDATA[ Twenty-Third International Conference on Automated Planning and Scheduling]]></conf-name>
<conf-date>Febrero, 2013</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Ma]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Teng]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving multi-objective Flexible Job Shop Scheduling with transportation constraints using a micro artificial bee colony algorithm]]></source>
<year></year>
<conf-name><![CDATA[ Computer Supported Cooperative Work in Design (CSCWD)]]></conf-name>
<conf-date>Junio, 2013</conf-date>
<conf-loc> </conf-loc>
<page-range>427-32</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rossi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2014</year>
<volume>153</volume>
<page-range>253-67</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gallego]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear control policies for scheduling a single facility after an initial disruption]]></source>
<year>1988</year>
<publisher-name><![CDATA[School of Operations Research and Industrial Engineering]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[DE JONG]]></surname>
<given-names><![CDATA[K. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[An analysis of the behaviour of a class of genetic adaptive systems]]></source>
<year>1975</year>
<publisher-loc><![CDATA[MI, USA ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Michigan]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fisher]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Thompson]]></surname>
<given-names><![CDATA[G. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Probabilistic learning combinations of local job-shop scheduling rules]]></article-title>
<source><![CDATA[Industrial scheduling]]></source>
<year>1963</year>
<volume>3</volume>
<page-range>225-51</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lawrence]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement)]]></source>
<year>1984</year>
<publisher-loc><![CDATA[Pittsburgh, PA ]]></publisher-loc>
<publisher-name><![CDATA[Carnegie-Mellon University, Graduate School of Industrial Administration]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<label>[29]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fattahi]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehrabad]]></surname>
<given-names><![CDATA[M. Saidi]]></given-names>
</name>
<name>
<surname><![CDATA[J.]]></surname>
<given-names><![CDATA[Fariborz.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mathematical modeling and heuristic approaches to flexible job shop scheduling problems]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2007</year>
<volume>18</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>331-42</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>[30]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dauzère-Pérès]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Paulli]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>1997</year>
<volume>70</volume>
<page-range>281-306</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>[31]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hurink]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Knust]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Makespan minimization for flow-shop problems with transportation times and a single robot]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2001</year>
<volume>112</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>199-216</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>[32]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deroussi]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Norre]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Simultaneous scheduling of machines and vehicles for the flexible job shop problem.]]></source>
<year></year>
<conf-name><![CDATA[ International conference on metaheuristics and nature inspired computing.]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B33">
<label>[33]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Manier]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Manier]]></surname>
<given-names><![CDATA[M.-A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm with Tabu Search procedure for flexible job shop scheduling with transportation constraints and bounded processing times]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1713-23</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>[34]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Box]]></surname>
<given-names><![CDATA[G. E. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Stuart Hunter]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Hunter]]></surname>
<given-names><![CDATA[W. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Statistics for Experimenters: Design, Innovation, and Discovery]]></source>
<year>2005</year>
<volume>2</volume>
<publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Wiley-Interscience]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B35">
<label>[35]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Castrillón]]></surname>
<given-names><![CDATA[O. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarache]]></surname>
<given-names><![CDATA[W. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solución de un problema Job Shop con un agente inteligente]]></article-title>
<source><![CDATA[Ingeniería y Ciencia]]></source>
<year>2009</year>
<volume>5</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>75-92</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
