<?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-750X</journal-id>
<journal-title><![CDATA[Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[ing.]]></abbrev-journal-title>
<issn>0121-750X</issn>
<publisher>
<publisher-name><![CDATA[Universidad Distrital Francisco José de Caldas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-750X2024000100205</article-id>
<article-id pub-id-type="doi">10.14483/23448393.21162</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Transgenic Algorithm Applied to the Job Shop Rescheduling Problem]]></article-title>
<article-title xml:lang="es"><![CDATA[Algoritmo transgenico aplicado al Job Shop Rescheduling Problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Beltran-Bernal]]></surname>
<given-names><![CDATA[Nestor Andres]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rodriguez-Molano]]></surname>
<given-names><![CDATA[Jose Ignacio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mendoza-Patino]]></surname>
<given-names><![CDATA[Diego Ernesto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de la Salle  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Distrital Francisco José de Caldas,  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Antonio Nariño  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>04</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>04</month>
<year>2024</year>
</pub-date>
<volume>29</volume>
<numero>1</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-750X2024000100205&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-750X2024000100205&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-750X2024000100205&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Context: Job sequencing has been approached from a static perspective, without considering the occurrence of unexpected events that might require modifying the schedule, thereby affecting its performance measures.  Method: This paper presents the development and application of a genetic algorithm to the Job Shop Rescheduling Problem (JSRP), a reprogramming of the traditional Job Shop Scheduling Problem. This novel approach seeks to repair the schedule in such a way that theoretical models accurately represent real manufacturing environments.  Results: The experiments designed to validate the algorithm aim to apply five classes of disruptions that could impact the schedule, evaluating two performance measures. This experiment was concurrently conducted with a genetic algorithm from the literature in order to facilitate the comparison of results. It was observed that the proposed approach outperforms the genetic algorithm 65 % of the time, and it provides better stability measures 98 % of the time.  Conclusions: The proposed algorithm showed favorable outcomes when tested with well-known benchmark instances of the Job Shop Scheduling Problem, and the possibility of enhancing the tool&#8217;s performance through simulation studies remains open.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Contexto: La secuenciación de trabajos ha sido abordada desde un enfoque estático, sin considerar la aparición de eventos inesperados que requieran modificar el cronograma, lo que incide en sus medidas de desempeño.  Método: Este artículo expone el desarrollo y aplicación de un algoritmo transgénico al Job Shop Rescheduling Problem (JSRP), una reprogramación del tradicional Job Shop Scheduling Problem. Este enfoque novedoso busca reparar el cronograma de modo que los modelos teóricos representen los entornos de manufactura reales.  Resultados: Los experimentos diseñados para validar el algoritmo pretenden aplicar cinco clases de interrupciones que pueden afectar el cronograma, evaluando dos medidas de desempeño. Este experimento se realizó simultáneamente en un algoritmo genético de la literatura para facilitar la comparación de los resultados. Se observó que el enfoque propuesto tiene un desempeño superior al del algoritmo genético el 65 % de las veces y lo supera en la medida de estabilidad el 98 % de las veces.  Conclusiones: El algoritmo propuesto mostró buenos resultados al ser probado con instancias de comparación reconocidas del Job Shop Scheduling Problem (JSSP), y queda abierta la posibilidad de mejorar el desempeño de la herramienta por medio de estudios de simulación.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[disruptions]]></kwd>
<kwd lng="en"><![CDATA[efficiency]]></kwd>
<kwd lng="en"><![CDATA[stability]]></kwd>
<kwd lng="en"><![CDATA[job shop]]></kwd>
<kwd lng="en"><![CDATA[rescheduling]]></kwd>
<kwd lng="en"><![CDATA[transgenic algorithm]]></kwd>
<kwd lng="es"><![CDATA[interrupciones]]></kwd>
<kwd lng="es"><![CDATA[eficiencia]]></kwd>
<kwd lng="es"><![CDATA[estabilidad]]></kwd>
<kwd lng="es"><![CDATA[job shop]]></kwd>
<kwd lng="es"><![CDATA[rescheduling]]></kwd>
<kwd lng="es"><![CDATA[algoritmo transgénico]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[JK]]></given-names>
</name>
<name>
<surname><![CDATA[Kan]]></surname>
<given-names><![CDATA[AHGR]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational complexity of discrete optimization problems]]></source>
<year>2005</year>
<page-range>121-40</page-range><publisher-name><![CDATA[A. Discrete Math.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[King]]></surname>
<given-names><![CDATA[JR]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The theory-practice gap in job-shop scheduling]]></article-title>
<source><![CDATA[Prod. Eng.]]></source>
<year>1976</year>
<volume>55</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>137-43</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vieira]]></surname>
<given-names><![CDATA[GE]]></given-names>
</name>
<name>
<surname><![CDATA[Herrmann]]></surname>
<given-names><![CDATA[JW]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Resheduling manufacturing system: A framework of strategies, policies, and methods]]></article-title>
<source><![CDATA[J. Sched.]]></source>
<year>2003</year>
<volume>6</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>39-62</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fang]]></surname>
<given-names><![CDATA[HL]]></given-names>
</name>
<name>
<surname><![CDATA[Ross]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Corne]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems]]></source>
<year>1993</year>
<conf-name><![CDATA[ Fifth Int. Conf. Genet. Algorithms]]></conf-name>
<conf-loc> </conf-loc>
<page-range>375-82</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[Li]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[LX]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A production rescheduling expert simulation system]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2000</year>
<volume>124</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>283-93</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[Li]]></surname>
<given-names><![CDATA[YCE]]></given-names>
</name>
<name>
<surname><![CDATA[Shaw]]></surname>
<given-names><![CDATA[WH]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulation modeling of a dynamic job shop rescheduling with machine availability constraints]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>1998</year>
<volume>35</volume>
<numero>1-2</numero>
<issue>1-2</issue>
<page-range>117-20</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moratori]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Petrovic]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Vazquez]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Match-up strategies for job shop rescheduling]]></source>
<year>2008</year>
<conf-name><![CDATA[ Int. Conf. Ind. Eng. Other App. Applied Intel. Sys.]]></conf-name>
<conf-loc> </conf-loc>
<page-range>119-28</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bastos]]></surname>
<given-names><![CDATA[REM]]></given-names>
</name>
</person-group>
<source><![CDATA[Investigacao de modelos e algoritmos para o problema do caixeiro viajante com multiplos passageiros e lotacao]]></source>
<year>2023</year>
<publisher-loc><![CDATA[Natal ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gouvea]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[ProtoG: A computational transgenetic algorithm]]></source>
<year>2001</year>
<conf-name><![CDATA[ MIC 2001-4th Metaheuristics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>625-30</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[Goldbarg]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Quadr]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Transgenetica computacional: Uma aplicacao ao problema quadratico de alocacao]]></article-title>
<source><![CDATA[Pesqui. Operacional]]></source>
<year>2002</year>
<volume>22</volume>
<page-range>359-86</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[Goldbarg]]></surname>
<given-names><![CDATA[EFG]]></given-names>
</name>
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[MC]]></given-names>
</name>
<name>
<surname><![CDATA[Bagi]]></surname>
<given-names><![CDATA[LB]]></given-names>
</name>
</person-group>
<source><![CDATA[Transgenetic algorithm: A new evolutionary perspective for heuristics design]]></source>
<year>2007</year>
<conf-name><![CDATA[ Proc. GECCO 2007 Genet. Evol. Comput. Conf. Companion Mater.]]></conf-name>
<conf-loc> </conf-loc>
<page-range>2701-8</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[MC]]></given-names>
</name>
<name>
<surname><![CDATA[Gouvea]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Extra-intracellular transgenetic algorithm applied to the graph coloring problem]]></source>
<year>2001</year>
<page-range>321-6</page-range><publisher-loc><![CDATA[Design ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[EFG]]></given-names>
</name>
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[MC]]></given-names>
</name>
<name>
<surname><![CDATA[Costa]]></surname>
<given-names><![CDATA[WE]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A transgenetic algorithm for the permutation flow-shop sequencing problem]]></article-title>
<source><![CDATA[WSEAS Trans. Syst.]]></source>
<year>2004</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>40-5</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lawler]]></surname>
<given-names><![CDATA[EL]]></given-names>
</name>
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[JK]]></given-names>
</name>
<name>
<surname><![CDATA[Kan]]></surname>
<given-names><![CDATA[AHGR]]></given-names>
</name>
<name>
<surname><![CDATA[Shmoys]]></surname>
<given-names><![CDATA[DB]]></given-names>
</name>
</person-group>
<source><![CDATA[Sequencing and scheduling: Algorithms and complexity]]></source>
<year>1993</year>
<volume>4</volume>
<page-range>445-522</page-range><publisher-loc><![CDATA[Handbooks Oper. Res. Manag. Sci. ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pinedo]]></surname>
<given-names><![CDATA[ML]]></given-names>
</name>
</person-group>
<source><![CDATA[Scheduling: Theory, algorithms, and systems]]></source>
<year>2022</year>
<edition>6th ed</edition>
<publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Gen]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Tsujimura]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tutorial survey of job-shop scheduling problems using genetic algorithms. I. Representation]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>1996</year>
<volume>30</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>983-97</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[Suresh]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Chaudhuri]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic scheduling: A survey of research]]></article-title>
<source><![CDATA[Int. J. Prod. Economics]]></source>
<year>1993</year>
<volume>32</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>53-63</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[An]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance]]></article-title>
<source><![CDATA[Expert Syst. App.]]></source>
<year>2023</year>
<volume>212</volume>
<page-range>art. 118711</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[Bierwirth]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Mattfeld]]></surname>
<given-names><![CDATA[DC]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Production scheduling and rescheduling with genetic algorithms]]></article-title>
<source><![CDATA[Evol. Comput.]]></source>
<year>1999</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-17</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[SF]]></given-names>
</name>
</person-group>
<source><![CDATA[Reactive scheduling systems]]></source>
<year>1995</year>
<page-range>155-92</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bean]]></surname>
<given-names><![CDATA[JC]]></given-names>
</name>
<name>
<surname><![CDATA[Birge]]></surname>
<given-names><![CDATA[JR]]></given-names>
</name>
<name>
<surname><![CDATA[Mittenthal]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Noon]]></surname>
<given-names><![CDATA[CE]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Matchup scheduling with multiple resources, release dates and disruptions]]></article-title>
<source><![CDATA[Oper. Res.]]></source>
<year>1991</year>
<volume>39</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>470-83</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Tao]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimization of manufacturing systems using the internet if things]]></source>
<year>2016</year>
<publisher-loc><![CDATA[London, UK ]]></publisher-loc>
<publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[R-K]]></given-names>
</name>
<name>
<surname><![CDATA[Shyu]]></surname>
<given-names><![CDATA[Y-T]]></given-names>
</name>
<name>
<surname><![CDATA[Adiga]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic rescheduling algorithm for computer-based production scheduling systems]]></article-title>
<source><![CDATA[Int. J. Prod. Res.]]></source>
<year>1993</year>
<volume>31</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1815-26</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[Wu]]></surname>
<given-names><![CDATA[H-H]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[R-K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new rescheduling method for computer based scheduling systems]]></article-title>
<source><![CDATA[Int. J. Prod. Res.]]></source>
<year>1995</year>
<volume>33</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>2097-110</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[Church]]></surname>
<given-names><![CDATA[LK]]></given-names>
</name>
<name>
<surname><![CDATA[Uzsoy]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analysis of periodic and event-driven rescheduling policies in shops]]></article-title>
<source><![CDATA[Int. J. Comput. Integr. Manuf.]]></source>
<year>1992</year>
<volume>5</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>153-63</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[Vieira]]></surname>
<given-names><![CDATA[GE]]></given-names>
</name>
<name>
<surname><![CDATA[Herrmann]]></surname>
<given-names><![CDATA[JW]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies]]></article-title>
<source><![CDATA[Int. J. Prod. Res.]]></source>
<year>2000</year>
<volume>38</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1899-915</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tomassini]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Stauffer]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[A survey of genetic algorithms]]></source>
<year>1995</year>
<publisher-loc><![CDATA[Singapore ]]></publisher-loc>
<publisher-name><![CDATA[World Scientific]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holland]]></surname>
<given-names><![CDATA[JH]]></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>1992</year>
<publisher-loc><![CDATA[Cambridge, MA, USA ]]></publisher-loc>
<publisher-name><![CDATA[MIT Press]]></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[Ahmed]]></surname>
<given-names><![CDATA[ZH]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm for the bottleneck traveling salesman problem]]></article-title>
<source><![CDATA[ACM Trans. Embedded Comput. Syst.]]></source>
<year>2013</year>
<volume>12</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-10</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[Morris]]></surname>
<given-names><![CDATA[GM]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function]]></article-title>
<source><![CDATA[J. Comput. Chem.]]></source>
<year>1998</year>
<volume>19</volume>
<numero>14</numero>
<issue>14</issue>
<page-range>1639-62</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>[31]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Moscato]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Cotta]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[A gentle introduction to memetic algorithms]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Boston, MA, USA ]]></publisher-loc>
<publisher-name><![CDATA[Kluwer Academic Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<label>[32]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Krasnogor]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tutorial for competent memetic algorithms: Model, taxonomy, and design issues]]></article-title>
<source><![CDATA[IEEE Trans. Evol. Comput.]]></source>
<year>2005</year>
<volume>9</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>474-88</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[Plotkin]]></surname>
<given-names><![CDATA[HC]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Non-genetic transmission of information: Candidate cognitive processes and the evolution of culture]]></article-title>
<source><![CDATA[Behav. Processes]]></source>
<year>1995</year>
<volume>35</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>207-13</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[Chattoe-Brown]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Just how (un)realistic are evolutionary algorithms as representations of social processes?]]></article-title>
<source><![CDATA[J. Artif. Soc. Soc. Simul.]]></source>
<year>1998</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1-2</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>[35]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merz]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Freisleben]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<source><![CDATA[A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. in 1999 Congr. Evol. Comput.-CEC99 (Cat. No. 99TH8406)]]></source>
<year>1999</year>
<volume>vol. 3</volume>
<page-range>2063-70</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>[36]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Radcliffe]]></surname>
<given-names><![CDATA[NJ]]></given-names>
</name>
<name>
<surname><![CDATA[Surry]]></surname>
<given-names><![CDATA[PD]]></given-names>
</name>
</person-group>
<source><![CDATA[Formal memetic algorithms]]></source>
<year>1994</year>
<publisher-name><![CDATA[Evolutionary Computing: AISB Workshop]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B37">
<label>[37]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonzero: The logic of human destiny]]></source>
<year>2002</year>
<volume>46</volume>
<numero>46</numero>
<issue>46</issue>
<publisher-name><![CDATA[Vintage]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B38">
<label>[38]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wilson]]></surname>
<given-names><![CDATA[EO]]></given-names>
</name>
</person-group>
<source><![CDATA[Consilience: The unity of knowledge]]></source>
<year>1999</year>
<volume>31</volume>
<publisher-name><![CDATA[Vintage]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B39">
<label>[39]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barboza]]></surname>
<given-names><![CDATA[AO]]></given-names>
</name>
</person-group>
<source><![CDATA[Simulacao e tecnicas da computacao evolucionaria aplicadas a problemas de programacao linear inteira mista]]></source>
<year>2005</year>
<publisher-name><![CDATA[Universidade Tecnologica Federal do Parana]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B40">
<label>[40]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[EFG]]></given-names>
</name>
<name>
<surname><![CDATA[Castro]]></surname>
<given-names><![CDATA[MP]]></given-names>
</name>
<name>
<surname><![CDATA[Goldbarg]]></surname>
<given-names><![CDATA[MC]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A transgenetic algorithm for the gas network pipe sizing problem]]></article-title>
<source><![CDATA[Computational Methods]]></source>
<year>2006</year>
<volume>1</volume>
<page-range>893-904</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>[41]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dhingra]]></surname>
<given-names><![CDATA[JS]]></given-names>
</name>
<name>
<surname><![CDATA[Musser]]></surname>
<given-names><![CDATA[KL]]></given-names>
</name>
<name>
<surname><![CDATA[Blankenehip]]></surname>
<given-names><![CDATA[GL]]></given-names>
</name>
</person-group>
<source><![CDATA[Reactive operations scheduling for flexible manufacturing systems]]></source>
<year>1993</year>
<conf-name><![CDATA[ 24th Conf. Winter Sim]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B42">
<label>[42]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dutta]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reacting to scheduling exceptions in FMS environments]]></article-title>
<source><![CDATA[IIE Trans.]]></source>
<year>1990</year>
<volume>22</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>300-14</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>[43]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Subramaniam]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Raheja]]></surname>
<given-names><![CDATA[AS]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[mAOR: A heuristic-based reactive repair mechanism for job shop schedules]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2003</year>
<volume>22</volume>
<numero>9-10</numero>
<issue>9-10</issue>
<page-range>669-80</page-range></nlm-citation>
</ref>
<ref id="B44">
<label>[44]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arisha]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Young]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[El Baradie]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Job shop scheduling problem: An overview]]></source>
<year>2001</year>
<conf-name><![CDATA[ Int. Conf. Flex. Autom. Intell. Manuf. (FAIM 01),]]></conf-name>
<conf-loc> </conf-loc>
<page-range>682-93</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>[45]</label><nlm-citation citation-type="book">
<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[GL]]></given-names>
</name>
</person-group>
<source><![CDATA[Probabilistic learning combinations of local job-shop scheduling rules]]></source>
<year>1963</year>
<publisher-loc><![CDATA[Englewood Cliffs, NJ, USA ]]></publisher-loc>
<publisher-name><![CDATA[Prentice Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B46">
<label>[46]</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-401</page-range></nlm-citation>
</ref>
<ref id="B47">
<label>[47]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yamada]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Nakano]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[A genetic algorithm applicable to large-scale job-shop problems. in Parallel Prob. Solv. Nature]]></source>
<year>1992</year>
<volume>2</volume>
<page-range>283-92</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[Applegate]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Cook]]></surname>
<given-names><![CDATA[WJ]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A computational study of the job-shop scheduling problem]]></article-title>
<source><![CDATA[INFORMS J. Comput.]]></source>
<year>1991</year>
<volume>3</volume>
<page-range>149-56</page-range></nlm-citation>
</ref>
<ref id="B49">
<label>[49]</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]]></source>
<year>1984</year>
<publisher-name><![CDATA[Carnegie-Mellon University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B50">
<label>[50]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Taillard]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Benchmarks for basic scheduling problems]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>1993</year>
<volume>64</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>278-85</page-range></nlm-citation>
</ref>
<ref id="B51">
<label>[51]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zweben]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Fox]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Intelligent scheduling]]></source>
<year>1994</year>
<publisher-loc><![CDATA[San Francisco, CA, USA ]]></publisher-loc>
<publisher-name><![CDATA[Morgan Kaufman Publishers Inc]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B52">
<label>[52]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deac]]></surname>
<given-names><![CDATA[G. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lancu]]></surname>
<given-names><![CDATA[D. T.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#8220;Trading strategy hyper-parameter optimization using genetic algorithm&#8221; in 24th Int. Conf. Control Syst. Comp. Sci. (CSCS)]]></source>
<year>2023</year>
<page-range>121-7</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[Gao]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P. N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[&#8221;Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm,&#8221;]]></article-title>
<source><![CDATA[IEEE Trans. Cybernetics]]></source>
<year>2019</year>
<volume>49</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1944-55</page-range></nlm-citation>
</ref>
<ref id="B54">
<label>[54]</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[Luo]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[&#8220;A variable interval rescheduling strategy for dynamic flexible job shop scheduling problem by improved genetic algorithm,&#8221;]]></article-title>
<source><![CDATA[J. Adv. Trans]]></source>
<year>2017</year>
<volume>2017</volume>
<page-range>1-12</page-range></nlm-citation>
</ref>
<ref id="B55">
<label>[55]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kundakci]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Kulak]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[&#8220;Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem,&#8221;]]></article-title>
<source><![CDATA[Comp. Ind. Eng]]></source>
<year>2016</year>
<volume>96</volume>
<page-range>31-51</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
