<?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>0121-1129</journal-id>
<journal-title><![CDATA[Revista Facultad de Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Fac. ing.]]></abbrev-journal-title>
<issn>0121-1129</issn>
<publisher>
<publisher-name><![CDATA[Universidad Pedagógica y Tecnológica de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-11292017000100113</article-id>
<article-id pub-id-type="doi">10.19053/01211129.v26.n44.2017.5776</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem]]></article-title>
<article-title xml:lang="es"><![CDATA[Un algoritmo memético para minimizar el makespan en el problema del Job Shop Scheduling]]></article-title>
<article-title xml:lang="pt"><![CDATA[Um algoritmo memético para minimizar o makespan no problema do Job Shop Scheduling]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lamos-Díaz]]></surname>
<given-names><![CDATA[Henry]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Aguilar-Imitola]]></surname>
<given-names><![CDATA[Karin]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez-Díaz]]></surname>
<given-names><![CDATA[Yuleiny Tatiana]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Galván-Núñez]]></surname>
<given-names><![CDATA[Silvia]]></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 Santander]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[Bucaramanga Santander]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[Bucaramanga Santander]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Industrial de Santander  ]]></institution>
<addr-line><![CDATA[Bucaramanga Santander]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>04</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>04</month>
<year>2017</year>
</pub-date>
<volume>26</volume>
<numero>44</numero>
<fpage>113</fpage>
<lpage>123</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-11292017000100113&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0121-11292017000100113&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0121-11292017000100113&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The Job Shop Scheduling Problem (JSP) is a combinatorial optimization problem cataloged as type NP-Hard. To solve this problem, several heuristics and metaheuristics have been used. In order to minimize the makespan, we propose a Memetic Algorithm (MA), which combines the exploration of the search space by a Genetic Algorithm (GA), and the exploitation of the solutions using a local search based on the neighborhood structure of Nowicki and Smutnicki. The genetic strategy uses an operation-based representation that allows generating feasible schedules, and a selection probability of the best individuals that are crossed using the JOX operator. The results of the implementation show that the algorithm is competitive with other approaches proposed in the literature.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen El Job Shop Scheduling Problem (JSP) es un problema de optimización combinatoria catalogado de tipo NP-Hard. Para dar solución a este problema han sido utilizados diversos métodos heurísticos y metaheurísticos. Con el objetivo de minimizar el makespan se propone un algoritmo memético (MA) que combina la exploración del espacio de búsqueda mediante un algoritmo genético (GA) y la explotación de las soluciones, usando una búsqueda local basada en la estructura de vecindario de Nowicki y Smutnicki. La estrategia genética usa una representación basada en operaciones que le permite generar programas factibles y una probabilidad de selección de los mejores individuos que son cruzados usando el operador JOX. Los resultados obtenidos en la ejecución demuestran que el algoritmo es competitivo frente a otros enfoques propuestos en la literatura.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[Resumo O Job Shop Scheduling Problem (JSP) é um problema de otimização combinatória catalogado de tipo NP-Hard. Para dar solução a este problema têm sido utilizados diversos métodos heurísticos e metaheurísticos. Com o objetivo de minimizar o makespan propõe-se um algoritmo memético (MA) que combina a exploração do espaço de procura mediante um algoritmo genético (GA) e a exploração das soluções, usando uma busca local baseada na estrutura de vizinhança de Nowicki e Smutnicki. A estratégia genética usa uma representação baseada em operações que permite gerar programas factíveis e uma probabilidade de seleção dos melhores indivíduos que são cruzados usando o operador JOX. Os resultados obtidos na execução demonstram que o algoritmo é competitivo frente a outros enfoques propostos na literatura.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Job Shop Schedule]]></kwd>
<kwd lng="en"><![CDATA[local search]]></kwd>
<kwd lng="en"><![CDATA[memetic algorithm]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="es"><![CDATA[algoritmo memético]]></kwd>
<kwd lng="es"><![CDATA[búsqueda local]]></kwd>
<kwd lng="es"><![CDATA[Job Shop Schedule]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="pt"><![CDATA[algoritmo memético]]></kwd>
<kwd lng="pt"><![CDATA[busca local]]></kwd>
<kwd lng="pt"><![CDATA[Job Shop Schedule]]></kwd>
<kwd lng="pt"><![CDATA[metaheurísticas]]></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[Frutos]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Tohmé]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Multi-objective Memetic Algorithm for the Job-Shop Scheduling Problem]]></article-title>
<source><![CDATA[Oper. Res]]></source>
<year>2013</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>233-50</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="">
<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[Computer and Intractability: A Guide to the Theory of NP-Completeness]]></source>
<year>1979</year>
</nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jackson]]></surname>
<given-names><![CDATA[J. R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling a production to minimize maximum tardiness]]></article-title>
<source><![CDATA[Res. Report. Manag. Sci. Res. Proj]]></source>
<year>1955</year>
<volume>43</volume>
</nlm-citation>
</ref>
<ref id="B4">
<label>[4]</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. Res. Logist. Quart]]></source>
<year>1954</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>61-8</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[Akers]]></surname>
<given-names><![CDATA[S. B]]></given-names>
</name>
<name>
<surname><![CDATA[Friedman]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Non-Numerical Approach to Production Scheduling Problems]]></article-title>
<source><![CDATA[Oper. Res]]></source>
<year>1955</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>429-142</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[Roy]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Sussmann]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Les problems d'ordonnancement avec constraintes disjonctives]]></article-title>
<source><![CDATA[Note D.S]]></source>
<year>1964</year>
<volume>9</volume>
<publisher-name><![CDATA[SEMA]]></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[Balas]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm]]></article-title>
<source><![CDATA[Oper. Res]]></source>
<year>1969</year>
<volume>17</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>941-57</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[Applegate]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Cook]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Computational Study of the Job Shop Scheduling Problem]]></article-title>
<source><![CDATA[ORSA J. Comput]]></source>
<year>1991</year>
<volume>3</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>149-56</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[Brucker]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Jurisch]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Sievers]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A branch and bound algorithm for the job-shop scheduling problem]]></article-title>
<source><![CDATA[Discr. Appl. Math]]></source>
<year>1994</year>
<volume>49</volume>
<page-range>107-27</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[Mencía]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Sierra]]></surname>
<given-names><![CDATA[M. R]]></given-names>
</name>
<name>
<surname><![CDATA[Varela]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Depth-first heuristic search for the job shop scheduling problem]]></article-title>
<source><![CDATA[Ann. Oper. Res]]></source>
<year>2013</year>
<volume>206</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>265-96</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[Tan]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: A case study in Germany]]></article-title>
<source><![CDATA[Math. Probl. Eng]]></source>
<year>2015</year>
<page-range>1-12</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[Hadavi]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Hou]]></surname>
<given-names><![CDATA[Y.-W]]></given-names>
</name>
<name>
<surname><![CDATA[Hsu]]></surname>
<given-names><![CDATA[W.-L]]></given-names>
</name>
<name>
<surname><![CDATA[Levy]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Pinedo]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dispatching Issues in Job Shop Scheduling]]></article-title>
<source><![CDATA[New Directions for Operations Research in Manufacturing - Chapter 14]]></source>
<year>1992</year>
<page-range>234-45</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yokoyama]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Iizuka]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Yamamoto]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling problem]]></article-title>
<source><![CDATA[J. Adv. Mech. Des. Syst. Manuf]]></source>
<year>2014</year>
<volume>8</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1-6</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[Adams]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Balas]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Zawack]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Shifting Bottleneck Procedure for Job Shop Scheduling]]></article-title>
<source><![CDATA[Manage. Sci]]></source>
<year>1988</year>
<volume>34</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>391-101</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[Silva]]></surname>
<given-names><![CDATA[R. M]]></given-names>
</name>
<name>
<surname><![CDATA[Cubillos]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Cabrera Paniagua]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Constructive Heuristic for Solving the Job- Shop Scheduling Problem]]></article-title>
<source><![CDATA[IEEE Latin Am Trans]]></source>
<year>2016</year>
<volume>14</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2758-63</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[Dell'Amico]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Trubian]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Applying tabu search to the job-shop scheduling problem]]></article-title>
<source><![CDATA[Ann. Oper. Res]]></source>
<year>1993</year>
<volume>41</volume>
<page-range>1-4</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[Nowicki]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Smutnicki]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An advanced tabu search algorithm for the job shop problem]]></article-title>
<source><![CDATA[J. Sched]]></source>
<year>2005</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>145-59</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[C]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Guan]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem]]></article-title>
<source><![CDATA[Comput. Oper. Res]]></source>
<year>2007</year>
<volume>34</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>3229-42</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[Lin]]></surname>
<given-names><![CDATA[Y. K]]></given-names>
</name>
<name>
<surname><![CDATA[Chong]]></surname>
<given-names><![CDATA[C. S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem]]></article-title>
<source><![CDATA[JIMO]]></source>
<year>2015</year>
<volume>12</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>703-17</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[van Laarhoven]]></surname>
<given-names><![CDATA[P. J. M]]></given-names>
</name>
<name>
<surname><![CDATA[Aarts]]></surname>
<given-names><![CDATA[E. H. L]]></given-names>
</name>
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[J.K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Job Shop Scheduling by Simulated Annealing]]></article-title>
<source><![CDATA[Operations Res]]></source>
<year>1992</year>
<volume>40</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>113-25</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[Rojas-Santiago]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Damodaran]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Muthuswamy]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Vélez-Gallego]]></surname>
<given-names><![CDATA[M. C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Makespan minimization in a job shop with a BPM using simulated annealing]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol]]></source>
<year>2013</year>
<volume>68</volume>
<page-range>9-12</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[Zhang]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective]]></article-title>
<source><![CDATA[Comput. Oper. Res]]></source>
<year>2011</year>
<volume>38</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>854-67</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merkle]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Middendorf]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization]]></article-title>
<source><![CDATA[Springer Berlin Heidelberg]]></source>
<year>2001</year>
<page-range>484-194</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[Udomsakdigool]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Kachitvichyanukul]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiple colony ant algorithm for job-shop scheduling problem]]></article-title>
<source><![CDATA[Int. J. Prod. Res]]></source>
<year>2008</year>
<volume>46</volume>
<numero>15</numero>
<issue>15</issue>
<page-range>4155-75</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rui]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Shilong]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Zheqi]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Lili]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An ant colony algorithm for job shop scheduling problem with tool flow]]></article-title>
<source><![CDATA[Proc. Inst. Mech. Eng. Part B J. Eng. Manuf]]></source>
<year>2014</year>
<volume>228</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>959-68</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Korytkowski]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Rymaszewski]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Wisniewski]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ant colony optimization for job shop scheduling using multi-attribute dispatching rules]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol]]></source>
<year>2013</year>
<volume>67</volume>
<page-range>1-4</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eberhart]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Kennedy]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A new optimizer using particle swarm theory]]></source>
<year>2002</year>
<conf-name><![CDATA[ Proceedings of the Sixth International Symposium on Micro Machine and Human Science]]></conf-name>
<conf-loc> </conf-loc>
<page-range>39-13</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sha]]></surname>
<given-names><![CDATA[D. Y]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[H.-H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-objective PSO for job-shop scheduling problems]]></article-title>
<source><![CDATA[Expert Syst. Appl]]></source>
<year>2010</year>
<volume>37</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>1065-70</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>[29]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[T.-L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient job-shop scheduling algorithm based on particle swarm optimization?]]></article-title>
<source><![CDATA[Expert Syst. Appl]]></source>
<year>2010</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>2629-36</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[Zhao]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Jonrinaldi]]></surname>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem]]></article-title>
<source><![CDATA[Comput. Oper. Res]]></source>
<year>2014</year>
<volume>45</volume>
<page-range>38-50</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[Watanabe]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Tokumaru]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Hashimoto]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Jobshop scheduling using neural networks]]></article-title>
<source><![CDATA[Control Eng. Pract]]></source>
<year>1993</year>
<volume>1</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>957-61</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>[32]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Weckman]]></surname>
<given-names><![CDATA[G. R]]></given-names>
</name>
<name>
<surname><![CDATA[Ganduri]]></surname>
<given-names><![CDATA[C. V]]></given-names>
</name>
<name>
<surname><![CDATA[Koonce]]></surname>
<given-names><![CDATA[D. A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A neural network job-shop scheduler]]></article-title>
<source><![CDATA[J. Intell. Manuf]]></source>
<year>2008</year>
<volume>19</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>191-201</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>[33]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mattfeld]]></surname>
<given-names><![CDATA[D. C]]></given-names>
</name>
<name>
<surname><![CDATA[Bierwirth]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient genetic algorithm for job shop scheduling with tardiness objectives]]></article-title>
<source><![CDATA[Eur. J. Oper. Res]]></source>
<year>2004</year>
<volume>155</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>616-30</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>[34]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tsai]]></surname>
<given-names><![CDATA[J.-T]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[T.-K]]></given-names>
</name>
<name>
<surname><![CDATA[Ho]]></surname>
<given-names><![CDATA[W.-H]]></given-names>
</name>
<name>
<surname><![CDATA[Chou]]></surname>
<given-names><![CDATA[J.-H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol]]></source>
<year>2008</year>
<volume>38</volume>
<numero>9-10</numero>
<issue>9-10</issue>
<page-range>987-94</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>[35]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Essafi]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
<name>
<surname><![CDATA[Mati]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Dauzere-Peres]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem]]></article-title>
<source><![CDATA[Comput. Oper. Res]]></source>
<year>2008</year>
<volume>35</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>2599-616</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>[36]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[J.-C]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An adaptive multipopulation genetic algorithm for job-shop scheduling problem]]></article-title>
<source><![CDATA[Adv. Manuf]]></source>
<year>2016</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>142-9</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>[37]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moscato]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Norman]]></surname>
<given-names><![CDATA[M. G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems]]></article-title>
<source><![CDATA[Proc. Parallel Comput. Transputer Appl]]></source>
<year>1992</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>177-86</page-range></nlm-citation>
</ref>
<ref id="B38">
<label>[38]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Hybrid Adaptive Multi-objective Memetic Algorithm for 0/1 Knapsack Problem]]></article-title>
<source><![CDATA[Springer Berlin Heidelberg]]></source>
<year>2005</year>
<page-range>176-85</page-range></nlm-citation>
</ref>
<ref id="B39">
<label>[39]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ishibuchi]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Hitotsuyanagi]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Tsukamoto]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Nojima]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study]]></article-title>
<source><![CDATA[Studies in Computational Intelligence-Chapter]]></source>
<year>2009</year>
<volume>2</volume>
<numero>171</numero>
<issue>171</issue>
<page-range>27-49</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>[40]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rezoug]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Boughaci]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Badr-El-Den]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem]]></article-title>
<source><![CDATA[Springer International Publishing]]></source>
<year>2015</year>
<page-range>298-304</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>[41]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Bouchenoua]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Memetic Algorithm Solving the VRP, the CARP and General Routing Problems with Nodes, Edges and Arcs]]></article-title>
<source><![CDATA[Studies in Fuzziness and Soft Computing-Chapter]]></source>
<year>2005</year>
<volume>4</volume>
<page-range>65-85</page-range></nlm-citation>
</ref>
<ref id="B42">
<label>[42]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schönberger]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic Algorithm Vehicle Routing]]></article-title>
<source><![CDATA[Operational Freight Carrier Planning]]></source>
<year>2005</year>
<page-range>6576</page-range><publisher-loc><![CDATA[Berlin/Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B43">
<label>[43]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nalepa]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Blocho]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows]]></article-title>
<source><![CDATA[Soft Comput]]></source>
<year>2016</year>
<volume>20</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2309-27</page-range></nlm-citation>
</ref>
<ref id="B44">
<label>[44]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cordeau]]></surname>
<given-names><![CDATA[J.-F]]></given-names>
</name>
<name>
<surname><![CDATA[Gaudioso]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Moccia]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Memetic Heuristic for the Generalized Quadratic Assignment Problem]]></article-title>
<source><![CDATA[INFORMS J. Comput]]></source>
<year>2006</year>
<volume>18</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>433-143</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>[45]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Benlic]]></surname>
<given-names><![CDATA[U]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J.-K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic search for the quadratic assignment problem]]></article-title>
<source><![CDATA[Expert Syst. Appl]]></source>
<year>2015</year>
<volume>42</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>584-95</page-range></nlm-citation>
</ref>
<ref id="B46">
<label>[46]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fischer]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Merz]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Memetic Algorithm for the Optimum Communication Spanning Tree Problem]]></article-title>
<source><![CDATA[Hybrid Metaheuristics]]></source>
<year></year>
<page-range>170-84</page-range><publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B47">
<label>[47]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[H.-C]]></given-names>
</name>
<name>
<surname><![CDATA[Chiang]]></surname>
<given-names><![CDATA[T.-C]]></given-names>
</name>
<name>
<surname><![CDATA[Fu]]></surname>
<given-names><![CDATA[L.-C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A two-stage hybrid memetic algorithm for multiobjective job shop scheduling]]></article-title>
<source><![CDATA[Expert Syst. Appl]]></source>
<year>2011</year>
<volume>38</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>10983-98</page-range></nlm-citation>
</ref>
<ref id="B48">
<label>[48]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Raeesi N]]></surname>
<given-names><![CDATA[M. R]]></given-names>
</name>
<name>
<surname><![CDATA[Kobti]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic]]></article-title>
<source><![CDATA[Memetic Comp]]></source>
<year>2012</year>
<volume>4</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>231-45</page-range></nlm-citation>
</ref>
<ref id="B49">
<label>[49]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yuan]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms]]></article-title>
<source><![CDATA[IEEE Trans Automat Sci Eng]]></source>
<year>2015</year>
<volume>12</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>336-53</page-range></nlm-citation>
</ref>
<ref id="B50">
<label>[50]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mencía]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Sierra]]></surname>
<given-names><![CDATA[M. R]]></given-names>
</name>
<name>
<surname><![CDATA[Mencía]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Varela]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic algorithms for the job shop scheduling problem with operators]]></article-title>
<source><![CDATA[Appl. Soft Comput]]></source>
<year>2015</year>
<volume>34</volume>
<page-range>94-105</page-range></nlm-citation>
</ref>
<ref id="B51">
<label>[51]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nowicki]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Smutnicki]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Fast Taboo Search Algorithm for the Job-Shop Problem]]></article-title>
<source><![CDATA[Manage. Sci]]></source>
<year>1996</year>
<volume>42</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>797-813</page-range></nlm-citation>
</ref>
<ref id="B52">
<label>[52]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient memetic algorithm for solving the job shop scheduling problem]]></article-title>
<source><![CDATA[Comput. Ind. Eng]]></source>
<year>2011</year>
<volume>60</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>699-705</page-range></nlm-citation>
</ref>
<ref id="B53">
<label>[53]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beasley]]></surname>
<given-names><![CDATA[J. E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[OR-Library: Distributing Test Problems by Electronic Mail]]></article-title>
<source><![CDATA[J. Oper. Res. Soc]]></source>
<year>1990</year>
<volume>41</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1069</page-range></nlm-citation>
</ref>
<ref id="B54">
<label>[54]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González Fernández]]></surname>
<given-names><![CDATA[M. A]]></given-names>
</name>
</person-group>
<source><![CDATA[Soluciones metaheurísticas al 'job-shop scheduling problem with sequence-dependent setup times]]></source>
<year>2011</year>
</nlm-citation>
</ref>
<ref id="B55">
<label>[55]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumrul Hasan]]></surname>
<given-names><![CDATA[S. M]]></given-names>
</name>
<name>
<surname><![CDATA[Sarker]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Essam]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Cornforth]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic algorithms for solving job-shop scheduling problems]]></article-title>
<source><![CDATA[Memetic Comp]]></source>
<year>2009</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>69-83</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
