<?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-750X2017000100009</article-id>
<article-id pub-id-type="doi">10.14483/udistrital.jour.reving.2017.1.a03</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Revisión de la Literatura Sobre el Problema de Programación de "Flow Shop" Híbrido con Máquinas Paralelas no Relacionadas]]></article-title>
<article-title xml:lang="en"><![CDATA[Literature Review on the Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Peña Tibaduiza]]></surname>
<given-names><![CDATA[Eliana]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Garavito Hernández]]></surname>
<given-names><![CDATA[Edwin Alberto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Perez Figueredo]]></surname>
<given-names><![CDATA[Luis Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Moratto Chimenty]]></surname>
<given-names><![CDATA[Eslendis]]></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[Colombia ]]></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>22</volume>
<numero>1</numero>
<fpage>9</fpage>
<lpage>22</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-750X2017000100009&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-750X2017000100009&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-750X2017000100009&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Contexto: Se ha observado que el problema de flow shop híbrido con máquinas paralelas no relacionadas presenta escasos reportes en el ámbito académico, en comparación con elflow shophíbrido que considera procesadores idénticos, razón por la cual son poco conocidos los diferentes enfoques y aplicaciones que este problema puede tener.  Método: Se realizó una revisión de la literatura del estado del arte del problema de programación de trabajos en unflow shophíbrido mediante la recopilación y análisis de artículos académicos en diversas bases de datos científicas. Con este propósito se realizó una búsqueda a partir de palabras claves que definen el problema, revisando si evidencian en la descripción del problema la existencia de máquinas paralelas no relacionadas; como resultado se obtienen 50 artículos seleccionados para el presente estudio.  Resultados: Se realizo una clasificación del problema de acuerdo a las características del sistema productivo y se presentan los métodos de solución, restricciones y funciones objetivo comúnmente utilizadas.  Conclusiones: Se observa una tendencia creciente en los estudios delflow shopcon múltiples etapas, pero pocos son los estudios basados en casos de la industria.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Context: The flow shop hybrid problem with unrelated parallel machines has been less studied in the academia compared to the flow shop hybrid with identical processors. For this reason, there are few reports about the kind of application of this problem in industries.  Method: A literature review of the state of the art on flow-shop scheduling problem was conducted by collecting and analyzing academic papers on several scientific databases. For this aim, a search query was constructed using keywords defining the problem and checking the inclusion of unrelated parallel machines in such definition; as a result, 50 papers were finally selected for this study.  Results: A classification of the problem according to the characteristics of the production system was performed, also solution methods, constraints and objective functions commonly used are presented.  Conclusions: An increasing trend is observed in studies of flow shop with multiple stages, but few are based on industry case-studies.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[shop" híbrido]]></kwd>
<kwd lng="es"><![CDATA[maquinas paralelas no relacionadas]]></kwd>
<kwd lng="es"><![CDATA[programación]]></kwd>
<kwd lng="es"><![CDATA[revisión de la literatura]]></kwd>
<kwd lng="es"><![CDATA[Idioma:Español]]></kwd>
<kwd lng="en"><![CDATA[flow shop]]></kwd>
<kwd lng="en"><![CDATA[unrelated parallel machine]]></kwd>
<kwd lng="en"><![CDATA[literature review]]></kwd>
<kwd lng="en"><![CDATA[scheduling]]></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[Ribas]]></surname>
<given-names><![CDATA[Imma]]></given-names>
</name>
<name>
<surname><![CDATA[Leisten]]></surname>
<given-names><![CDATA[Rainer]]></given-names>
</name>
<name>
<surname><![CDATA[Framiñan]]></surname>
<given-names><![CDATA[Jose. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective]]></article-title>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2010</year>
<volume>37</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1439-54</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[Marcia de Fatima]]></surname>
<given-names><![CDATA[Morais]]></given-names>
</name>
<name>
<surname><![CDATA[Perassoli]]></surname>
<given-names><![CDATA[Thays. J.]]></given-names>
</name>
<name>
<surname><![CDATA[dos Santos]]></surname>
<given-names><![CDATA[Leandro]]></given-names>
</name>
<name>
<surname><![CDATA[Peterson]]></surname>
<given-names><![CDATA[Rony]]></given-names>
</name>
<name>
<surname><![CDATA[Paraíso]]></surname>
<given-names><![CDATA[Paulo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multicriteria Hybrid Flow Shop Scheduling Problem: Literature Review, Analysis, and Future Research]]></article-title>
<source><![CDATA[Indep. J. Manag. Prod.]]></source>
<year>2014</year>
<volume>5</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1004-31</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[Wang]]></surname>
<given-names><![CDATA[Wenpeng]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Review on hybrid flow shop scheduling]]></article-title>
<source><![CDATA[Int. Conf. Inf. Technol. Comput. Eng. Manag. Sci.]]></source>
<year>2011</year>
<volume>4</volume>
<page-range>7-10</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[Ruben]]></given-names>
</name>
<name>
<surname><![CDATA[Vázquez]]></surname>
<given-names><![CDATA[Jose]]></given-names>
</name>
</person-group>
<source><![CDATA[The hybrid flow shop scheduling problem]]></source>
<year>2010</year>
<volume>205</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-18</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[Lin]]></surname>
<given-names><![CDATA[James]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Chien]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing]]></article-title>
<source><![CDATA[Simul. Model. Pract. Theory]]></source>
<year>2015</year>
<volume>51</volume>
<page-range>100-14</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[Figielska]]></surname>
<given-names><![CDATA[Ewa]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new heuristic for scheduling the two-stage flowshop with additional resources]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>2008</year>
<volume>54</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>750-63</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pautasso]]></surname>
<given-names><![CDATA[Marco]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ten simple rules for writing a literature review]]></article-title>
<source><![CDATA[PLoS Comput. Biol.]]></source>
<year>2013</year>
<volume>9</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1-4</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[Pineda]]></surname>
<given-names><![CDATA[Cesar]]></given-names>
</name>
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[Cesar]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Una revisión al estado del arte de la integración de toma de decisiones en la red logística]]></article-title>
<source><![CDATA[Ingeniería]]></source>
<year></year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>118-48</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[D. Velásquez]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Una Guía Corta para Escribir Revisiones Sistemáticas de Literatura Parte 1]]></article-title>
<source><![CDATA[Dyna]]></source>
<year>2014</year>
<volume>81</volume>
<numero>187</numero>
<issue>187</issue>
<page-range>9-10</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[Figielska]]></surname>
<given-names><![CDATA[Ewa]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>2009</year>
<volume>56</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>142-51</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[Figielska]]></surname>
<given-names><![CDATA[Ewa]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>2010</year>
<volume>59</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>509-19</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[Figielska]]></surname>
<given-names><![CDATA[Ewa]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2014</year>
<volume>236</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>433-44</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jungwattanakit]]></surname>
<given-names><![CDATA[Jitti]]></given-names>
</name>
<name>
<surname><![CDATA[Reodecha]]></surname>
<given-names><![CDATA[Manop]]></given-names>
</name>
<name>
<surname><![CDATA[Chaovalitwongse]]></surname>
<given-names><![CDATA[Paveena]]></given-names>
</name>
<name>
<surname><![CDATA[Werner]]></surname>
<given-names><![CDATA[Frank.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constructive and simulated annealing heuristics for hybrid flow shops with unrelated parallel machines]]></source>
<year>2006</year>
<conf-name><![CDATA[ Proceedings of the 3rd OR-CRN Operations Research Conference]]></conf-name>
<conf-loc>Bangkok, Thailand </conf-loc>
<page-range>110-21</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[Jungwattanakit]]></surname>
<given-names><![CDATA[Jitti]]></given-names>
</name>
<name>
<surname><![CDATA[Reodecha]]></surname>
<given-names><![CDATA[Manop]]></given-names>
</name>
<name>
<surname><![CDATA[Chaovalitwongse]]></surname>
<given-names><![CDATA[Paveena]]></given-names>
</name>
<name>
<surname><![CDATA[Werner]]></surname>
<given-names><![CDATA[Frank]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2008</year>
<volume>37</volume>
<numero>3-4</numero>
<issue>3-4</issue>
<page-range>354-70</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[Jungwattanakit]]></surname>
<given-names><![CDATA[Jitti]]></given-names>
</name>
<name>
<surname><![CDATA[Reodecha]]></surname>
<given-names><![CDATA[Manop]]></given-names>
</name>
<name>
<surname><![CDATA[Chaovalitwongse]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Werner]]></surname>
<given-names><![CDATA[Frank]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria]]></article-title>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2009</year>
<volume>36</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>358-78</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[Linn]]></surname>
<given-names><![CDATA[Richard]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Wei]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid flow shop scheduling: a survey]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>1999</year>
<volume>37</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>57-61</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[Uetake]]></surname>
<given-names><![CDATA[Toshifumi]]></given-names>
</name>
<name>
<surname><![CDATA[Tsubone]]></surname>
<given-names><![CDATA[Hitoshi]]></given-names>
</name>
<name>
<surname><![CDATA[Ohba]]></surname>
<given-names><![CDATA[Masaaki]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A production scheduling system in a hybrid flow shop]]></article-title>
<source><![CDATA[Int. J. Prod. Econ.]]></source>
<year>1995</year>
<volume>41</volume>
<numero>1-3</numero>
<issue>1-3</issue>
<page-range>395-8</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[Almeder]]></surname>
<given-names><![CDATA[Christian]]></given-names>
</name>
<name>
<surname><![CDATA[Hartl]]></surname>
<given-names><![CDATA[Richard]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer]]></article-title>
<source><![CDATA[Int. J. Prod. Econ.]]></source>
<year>2013</year>
<volume>145</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>88-95</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[Low]]></surname>
<given-names><![CDATA[Chinyao]]></given-names>
</name>
<name>
<surname><![CDATA[Hsu]]></surname>
<given-names><![CDATA[Chou]]></given-names>
</name>
<name>
<surname><![CDATA[Su]]></surname>
<given-names><![CDATA[Chwen]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines]]></article-title>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2008</year>
<volume>35</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>845-53</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[Rabiee]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sadeghi Rad]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mazinani]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Shafaei]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2014</year>
<volume>71</volume>
<numero>5-8</numero>
<issue>5-8</issue>
<page-range>1229-45</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[Yaurima]]></surname>
<given-names><![CDATA[Victor]]></given-names>
</name>
<name>
<surname><![CDATA[Burtseva]]></surname>
<given-names><![CDATA[Larisa]]></given-names>
</name>
<name>
<surname><![CDATA[Tchernykh]]></surname>
<given-names><![CDATA[Andrei]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid Flowshop with Unrelated Machines , Sequence Dependent Setup Time and Availability Constraints : An Enhanced Crossover Operator for a Genetic Algorithm]]></article-title>
<source><![CDATA[Springer verlag]]></source>
<year>2008</year>
<page-range>608-17</page-range><publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yaurima]]></surname>
<given-names><![CDATA[Victor]]></given-names>
</name>
<name>
<surname><![CDATA[Burtseva]]></surname>
<given-names><![CDATA[Larisa]]></given-names>
</name>
<name>
<surname><![CDATA[Tchernykh]]></surname>
<given-names><![CDATA[Andrei]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid flowshop with unrelated machines, sequencedependent setup time, availability constraints and limited buffers]]></article-title>
<source><![CDATA[Comput. Ind. Eng.]]></source>
<year>2009</year>
<volume>56</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1452-63</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[Li]]></surname>
<given-names><![CDATA[Zhan Tao]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Jianjun]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Qing]]></given-names>
</name>
<name>
<surname><![CDATA[Mao]]></surname>
<given-names><![CDATA[Ning]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Xiaoming]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approximation algorithms for the threestage flexible flow shop problem with mid group constraint]]></article-title>
<source><![CDATA[Expert Syst. Appl.]]></source>
<year>2015</year>
<volume>42</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>3571-84</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[Seido Nagano]]></surname>
<given-names><![CDATA[Marcelo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Flowshops Paralelos Com Processadores Não-Relacionados]]></article-title>
<source><![CDATA[XXII Encontro Nacional de Engenharia de Produção]]></source>
<year>2002</year>
<page-range>1-8</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[Low]]></surname>
<given-names><![CDATA[Chinyao]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines]]></article-title>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2005</year>
<volume>32</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>2013-25</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[Ruiz]]></surname>
<given-names><![CDATA[Ruben]]></given-names>
</name>
<name>
<surname><![CDATA[&#350;erifo&#287;lu]]></surname>
<given-names><![CDATA[Funda]]></given-names>
</name>
<name>
<surname><![CDATA[Urlings]]></surname>
<given-names><![CDATA[Thijs]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modeling realistic hybrid flexible flowshop scheduling problems]]></article-title>
<source><![CDATA[Comput. Oper. Res.]]></source>
<year>2008</year>
<volume>35</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1151-75</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zandieh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Mozaffari]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Gholami]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems]]></article-title>
<source><![CDATA[J. Intell. Manuf.]]></source>
<year>2010</year>
<volume>21</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>731-43</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abbas Bozorgirad]]></surname>
<given-names><![CDATA[Mir]]></given-names>
</name>
<name>
<surname><![CDATA[Logendran]]></surname>
<given-names><![CDATA[Rasaratnam]]></given-names>
</name>
</person-group>
<source><![CDATA[Hybrid flowshop scheduling problem with a bi-criteria objective and group technology assumption]]></source>
<year>2013</year>
<conf-name><![CDATA[ IIE Annual Conference. Proceedings]]></conf-name>
<conf-loc> </conf-loc>
<page-range>3004</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[Attar]]></surname>
<given-names><![CDATA[S. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohammadi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Tavakkoli-Moghaddam]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2013</year>
<volume>68</volume>
<numero>5-8</numero>
<issue>5-8</issue>
<page-range>1583-99</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[Camargo]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<name>
<surname><![CDATA[Souza]]></surname>
<given-names><![CDATA[Sergio de]]></given-names>
</name>
<name>
<surname><![CDATA[Jamilson]]></surname>
<given-names><![CDATA[Marcone]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Um algoritmo iterated greedy search aplicado à minimização do makespan]]></article-title>
<source><![CDATA[Simpósio Brasileiro de pesquisa operacional]]></source>
<year>2013</year>
<page-range>44-55</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[Tao Li]]></surname>
<given-names><![CDATA[Zhan]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Qing]]></given-names>
</name>
<name>
<surname><![CDATA[Mao]]></surname>
<given-names><![CDATA[Ning]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Xiaoming]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Jianjun]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint]]></article-title>
<source><![CDATA[Int. J. Prod. Econ.]]></source>
<year>2013</year>
<volume>146</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>667-78</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[Arango]]></surname>
<given-names><![CDATA[Jaime]]></given-names>
</name>
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[Jaime]]></given-names>
</name>
<name>
<surname><![CDATA[Castrillón]]></surname>
<given-names><![CDATA[Omar]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Aplicando la Heurística TOC a la Secuenciaci´on de Trabajos en un Flow Shop Híbrido Flexible]]></article-title>
<source><![CDATA[Dyna,]]></source>
<year>2014</year>
<volume>81</volume>
<numero>2011</numero>
<issue>2011</issue>
<page-range>113-9</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[Kim]]></surname>
<given-names><![CDATA[H.-W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[D.-H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallelmachines]]></article-title>
<source><![CDATA[Proc. Inst. Mech. Eng. Part B J. Eng. Manuf.]]></source>
<year>2009</year>
<volume>223</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>433-42</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[Soltani]]></surname>
<given-names><![CDATA[Abolfazl]]></given-names>
</name>
<name>
<surname><![CDATA[Karimi]]></surname>
<given-names><![CDATA[Behrooz]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2014</year>
<volume>76</volume>
<numero>9-12</numero>
<issue>9-12</issue>
<page-range>1739-55</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[Castrillón]]></surname>
<given-names><![CDATA[Omar]]></given-names>
</name>
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[Jaime]]></given-names>
</name>
<name>
<surname><![CDATA[Sarache]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Técnicas inteligentes y estocásticas en scheduling]]></article-title>
<source><![CDATA[Un enfoque en la Prod. y las operaciones]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Bogotá, D. C. ]]></publisher-loc>
<publisher-name><![CDATA[Unibiblios]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B36">
<label>[36]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[Ruben]]></given-names>
</name>
<name>
<surname><![CDATA[Maroto]]></surname>
<given-names><![CDATA[Concepción]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2006</year>
<volume>169</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>781-800</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>[37]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gómez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
</person-group>
<source><![CDATA[Un nuevo algoritmo genético basado en un sistema multiagente para la programación de la producción en un taller de flujo híbrido]]></source>
<year>2007</year>
<conf-name><![CDATA[ Internacional Conference on Industrial Engineering &amp; Industrial Management]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1675-85</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[Rashidi]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Jahandar]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Zandieh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2010</year>
<volume>49</volume>
<numero>9-12</numero>
<issue>9-12</issue>
<page-range>1129-39</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[Defersha]]></surname>
<given-names><![CDATA[Fantahun]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Mingyuan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem]]></article-title>
<source><![CDATA[Int. J. Adv. Manuf. Technol.]]></source>
<year>2012</year>
<volume>62</volume>
<numero>1-4</numero>
<issue>1-4</issue>
<page-range>249-265.</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[Gómez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
<name>
<surname><![CDATA[Andrés]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<name>
<surname><![CDATA[Lario]]></surname>
<given-names><![CDATA[Francisco]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan]]></article-title>
<source><![CDATA[Expert Syst. Appl.]]></source>
<year>2012</year>
<volume>39</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>8095-107</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[Miranda]]></surname>
<given-names><![CDATA[Pedro Luis]]></given-names>
</name>
<name>
<surname><![CDATA[Florence Teixeira Jr]]></surname>
<given-names><![CDATA[Rodolfo]]></given-names>
</name>
</person-group>
<source><![CDATA[Algoritmo genético com busca local para a programação da produção em sistemas flow- shop híbridos]]></source>
<year>2012</year>
<conf-name><![CDATA[ Congreso Latino-iberoamericano de Investigación Operativa]]></conf-name>
<conf-loc> </conf-loc>
<page-range>19-29</page-range></nlm-citation>
</ref>
<ref id="B42">
<label>[42]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miranda]]></surname>
<given-names><![CDATA[Pedro Luis]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[Karim]]></given-names>
</name>
<name>
<surname><![CDATA[Florence Teixeira Jr]]></surname>
<given-names><![CDATA[Rodolfo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Um modelo de programação inteira mista para a programação da produção em flowshop híbrido com buffers limitados]]></article-title>
<source><![CDATA[Simpósio Brasileiro de Pesquisa Operacional]]></source>
<year>2013</year>
<page-range>154-65</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>[43]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jenabi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Fatemi Ghomi]]></surname>
<given-names><![CDATA[S. M. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Torabi]]></surname>
<given-names><![CDATA[S. a.]]></given-names>
</name>
<name>
<surname><![CDATA[Karimi]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with 3]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B44">
<label>[44]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Ye]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Ling]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[Gang]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Shengyao]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective shuffled frog leaping algorithm for solving hybrid flow-shop scheduling problem]]></article-title>
<source><![CDATA[Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics)]]></source>
<year>2011</year>
<volume>6838</volume>
<page-range>560-7</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>[45]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jun-qing]]></surname>
<given-names><![CDATA[Li]]></given-names>
</name>
<name>
<surname><![CDATA[Quan-ke]]></surname>
<given-names><![CDATA[Pan]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B46">
<label>[46]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scholz-Reiter]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Rekersbrink]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Görges]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic flexible flow shop problems - Scheduling heuristics vs. autonomous control]]></article-title>
<source><![CDATA[CIRP Ann. - Manuf. Technol.]]></source>
<year>2010</year>
<volume>59</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>465-8</page-range></nlm-citation>
</ref>
<ref id="B47">
<label>[47]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Parra Peña]]></surname>
<given-names><![CDATA[Javier]]></given-names>
</name>
<name>
<surname><![CDATA[Mejia]]></surname>
<given-names><![CDATA[Gónzalo]]></given-names>
</name>
</person-group>
<source><![CDATA[Desarrollo de un modelo para la secuenciación de trabajos en la mediana industria ladrillera de la localidad XIX]]></source>
<year>2006</year>
<publisher-loc><![CDATA[Colombia ]]></publisher-loc>
<publisher-name><![CDATA[Unidandes]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B48">
<label>[48]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dai]]></surname>
<given-names><![CDATA[Min]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[Dunbing]]></given-names>
</name>
<name>
<surname><![CDATA[Giret]]></surname>
<given-names><![CDATA[Adriana]]></given-names>
</name>
<name>
<surname><![CDATA[Salido]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[W. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Energy-efficient scheduling for a flexible flow shop using an improved genetic- simulated annealing algorithm]]></article-title>
<source><![CDATA[Robot. Comput. Integr. Manuf.]]></source>
<year>2013</year>
<volume>29</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>418-29</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[Dudas]]></surname>
<given-names><![CDATA[Catarina]]></given-names>
</name>
<name>
<surname><![CDATA[Frantzén]]></surname>
<given-names><![CDATA[Marcus]]></given-names>
</name>
<name>
<surname><![CDATA[HC. NG]]></surname>
<given-names><![CDATA[Amos]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A synergy of multi-objetive optimization and data mining for analysis of a flexible flow shop]]></article-title>
<source><![CDATA[Robotics and Computer-Integrated Manufacturing]]></source>
<year>2011</year>
<volume>27</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>687-95</page-range></nlm-citation>
</ref>
<ref id="B50">
<label>[50]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[Ruben]]></given-names>
</name>
<name>
<surname><![CDATA[Maroto]]></surname>
<given-names><![CDATA[Concepción]]></given-names>
</name>
</person-group>
<source><![CDATA[Evaluación de Heurísticas para el Problema del Taller de Flujo]]></source>
<year></year>
<conf-name><![CDATA[ 27Congreso Nacional de Estadística e Investigación Operativa]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc> </conf-loc>
<page-range>1-18</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[Suarez]]></surname>
<given-names><![CDATA[Orlando]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Una aproximación a la heuristica y metaheuristicas]]></article-title>
<source><![CDATA[INGE@ UAN,Tendencias en la Ing.]]></source>
<year>2013</year>
<volume>1</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>44-51</page-range></nlm-citation>
</ref>
<ref id="B52">
<label>[52]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chicano]]></surname>
<given-names><![CDATA[Jose Francisco]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheurísticas e ingeniería del software]]></source>
<year>2007</year>
<publisher-loc><![CDATA[Málaga, España ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Málaga]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B53">
<label>[53]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jun]]></surname>
<given-names><![CDATA[Sungbum]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[Jinwoo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and si multaneous work constraints: A case study from the transformer industry]]></article-title>
<source><![CDATA[Expert Syst.Appl.]]></source>
<year>2015</year>
<volume>42</volume>
<numero>15</numero>
<issue>15</issue>
<page-range>6196-204</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[Safaei]]></surname>
<given-names><![CDATA[Sahar]]></given-names>
</name>
<name>
<surname><![CDATA[Naderi]]></surname>
<given-names><![CDATA[Reihane]]></given-names>
</name>
<name>
<surname><![CDATA[Sohrabi]]></surname>
<given-names><![CDATA[Amir]]></given-names>
</name>
<name>
<surname><![CDATA[Hatami]]></surname>
<given-names><![CDATA[Amin]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling of Unrelated Parallel Machines using Two Multi Objective Genetic Algorithms with Sequence-Dependent Setup Times and Precedent Constraints]]></article-title>
<source><![CDATA[International Journal of Advanced Design and Manufacturing Technology]]></source>
<year>2016</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
