<?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>0120-5609</journal-id>
<journal-title><![CDATA[Ingeniería e Investigación]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. Investig.]]></abbrev-journal-title>
<issn>0120-5609</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería, Universidad Nacional de Colombia.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0120-56092018000300068</article-id>
<article-id pub-id-type="doi">10.15446/ing.investig.v38n3.75281</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Minimising Total Flowtime in a No-Wait Flow Shop (NWFS) using Genetic Algorithms]]></article-title>
<article-title xml:lang="es"><![CDATA[Minimizar el tiempo de flujo total en un Flow shop sin escalas (NWFS) utilizando algoritmos genéticos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Chaudhry]]></surname>
<given-names><![CDATA[Imran Ali]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Elbadawi]]></surname>
<given-names><![CDATA[Isam A-Q.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Usman]]></surname>
<given-names><![CDATA[Muhammad]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Tajammal Chugtai]]></surname>
<given-names><![CDATA[Muhammad]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,University of Hail Department of Industrial Engineering ]]></institution>
<addr-line><![CDATA[Ha'il ]]></addr-line>
<country>Saudi Arabia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,University of Hail Department of Industrial Engineering ]]></institution>
<addr-line><![CDATA[Ha'il ]]></addr-line>
<country>Saudi Arabia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,University of Hail Department of Electrical Engineering ]]></institution>
<addr-line><![CDATA[Ha'il ]]></addr-line>
<country>Saudi Arabia</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Department of Electrical Engineering  ]]></institution>
<addr-line><![CDATA[Ha'il ]]></addr-line>
<country>Saudi Arabia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<volume>38</volume>
<numero>3</numero>
<fpage>68</fpage>
<lpage>79</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0120-56092018000300068&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0120-56092018000300068&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0120-56092018000300068&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT This paper considers a no-wait flow shop scheduling (NWFS) problem, where the objective is to minimise the total flowtime. We propose a genetic algorithm (GA) that is implemented in a spreadsheet environment. The GA functions as an add-in in the spreadsheet. It is demonstrated that with proposed approach any criteria can be optimised without modifying the GA routine or spreadsheet model. Furthermore, the proposed method for solving this class of problem is general purpose, as it can be easily customised by adding or removing jobs and machines. Several benchmark problems already published in the literature are used to demonstrate the problem-solving capability of the proposed approach. Benchmark problems set ranges from small (7-jobs, 7 machines) to large (100-jobs, 10-machines). The performance of the GA is compared with different meta-heuristic techniques used in earlier literature. Experimental analysis demonstrate that solutions obtained in this research offer equal quality as compared to algorithms already developed for NWFS problems.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Este documento considera un problema de secuenciación de líneas de flujo sin espera (NWFS), donde el objetivo es minimizar el tiempo de flujo total. Proponemos un algoritmo genético (GA) que se implementa en un entorno de hoja de cálculo. El GA funciona como un complemento en la hoja de cálculo. Se demuestra que, con el enfoque propuesto, cualquier criterio puede optimizarse sin modificar la rutina del GA o el modelo de hoja de cálculo. Además, el método propuesto para resolver este problema de clase es de propósito general, ya que se puede personalizar fácilmente agregando o eliminando tareas y máquinas. Varios problemas de referencia ya publicados en la literatura se usan para demostrar la capacidad de resolución de problemas del enfoque propuesto. El conjunto de problemas de la evaluación tiene un rango que varía desde pequeños (7 trabajos, 7 máquinas) hasta grandes (100 trabajos, 10 máquinas). El rendimiento del GA se compara con diferentes técnicas meta-heurísticas utilizadas en la literatura anterior. El análisis experimental demuestra que las soluciones obtenidas en esta nueva búsqueda ofrecen igual calidad que los algoritmos ya desarrollados para el problema NWFS.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Genetic algorithm (GA)]]></kwd>
<kwd lng="en"><![CDATA[Scheduling]]></kwd>
<kwd lng="en"><![CDATA[No-wait]]></kwd>
<kwd lng="en"><![CDATA[Flow shop]]></kwd>
<kwd lng="es"><![CDATA[Algoritmo genético (AG)]]></kwd>
<kwd lng="es"><![CDATA[Secuenciación]]></kwd>
<kwd lng="es"><![CDATA[Líneas de flujo sin espera]]></kwd>
<kwd lng="es"><![CDATA[Flow shop]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Akhshabi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Tavakkoli-Moghaddam]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rahnamay-Roodposhti]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time]]></article-title>
<source><![CDATA[The International Journal of Advanced Manufacturing Technology]]></source>
<year>2014</year>
<volume>70</volume>
<numero>5-8</numero>
<issue>5-8</issue>
<page-range>1181-8</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aldowaisan]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Allahverdi]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New heuristics for m-machine no-wait flowshop to minimize total completion time]]></article-title>
<source><![CDATA[Omega]]></source>
<year>2004</year>
<volume>32</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>345-52</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Astaiza A]]></surname>
<given-names><![CDATA[L. G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A practical approach to scheduling examinations]]></article-title>
<source><![CDATA[Ingeniería e Investigación]]></source>
<year>2005</year>
<volume>25</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>92-100</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bertolissi]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristic algorithm for scheduling in the no-wait flow-shop]]></article-title>
<source><![CDATA[Journal of Materials Processing Technology]]></source>
<year>2000</year>
<volume>107</volume>
<numero>1-3</numero>
<issue>1-3</issue>
<page-range>459-65</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bewoor]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Chandra Prakash]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems]]></article-title>
<source><![CDATA[Algorithms]]></source>
<year>2017</year>
<month>a</month>
<volume>10</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>121</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bewoor]]></surname>
<given-names><![CDATA[L. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Prakash]]></surname>
<given-names><![CDATA[V. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S. U]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Comparative Analysis of Metaheuristic Approaches for m-Machine No Wait Flow Shop Scheduling for minimizing Total Flow Time with Stochastic Input]]></article-title>
<source><![CDATA[International Journal of Engineering and Technology]]></source>
<year>2017</year>
<month>b</month>
<volume>8</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>3021-6</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bewoor]]></surname>
<given-names><![CDATA[L. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Prakash]]></surname>
<given-names><![CDATA[V. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S. U]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Production scheduling optimization in foundry using hybrid Particle Swarm Optimization algorithm]]></article-title>
<source><![CDATA[Procedia Manufacturing]]></source>
<year>2018</year>
<volume>22</volume>
<page-range>57-64</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carlier]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ordonnancements a contraintes disjonctives]]></article-title>
<source><![CDATA[R.A.I.R.O. Recherche operationelle/Operations Research]]></source>
<year>1978</year>
<volume>12</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>333-50</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chaudhry]]></surname>
<given-names><![CDATA[I. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ahmed]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Khan]]></surname>
<given-names><![CDATA[A. M]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem]]></source>
<year>2014</year>
<volume>65</volume>
<numero>1</numero>
<conf-name><![CDATA[ IOP Conference Series: Materials Science and Engineering]]></conf-name>
<conf-loc> </conf-loc>
<issue>1</issue>
<page-range>1-6</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chaudhry]]></surname>
<given-names><![CDATA[I. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Elbadawi]]></surname>
<given-names><![CDATA[I. A. Q]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm]]></article-title>
<source><![CDATA[Sadhana - Academy Proceedings in Engineering Sciences]]></source>
<year>2017</year>
<volume>42</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>11-21</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chaudhry]]></surname>
<given-names><![CDATA[I. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Khan]]></surname>
<given-names><![CDATA[A. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Minimizing makespan for a no-wait flowshop using genetic algorithm]]></article-title>
<source><![CDATA[Sadhana -Academy Proceedings in Engineering Sciences]]></source>
<year>2012</year>
<volume>37</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>695-707</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Job Shop Scheduling with Cenetic Algorithms]]></source>
<year>1985</year>
<conf-name><![CDATA[ Paper presented at the Proceedings of the 1st International Conference on Genetic Algorithms]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Delgado]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[C. J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[Ó. G. D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Applying genetic algorithms for programming manufacto-ring cell tasks]]></article-title>
<source><![CDATA[Ingeniería e Investigación]]></source>
<year>2005</year>
<volume>25</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>24-31</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Díaz Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Huertas]]></surname>
<given-names><![CDATA[J. I]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A continuous time model for a short-term multiproduct batch process sche duling]]></article-title>
<source><![CDATA[Ingeniería e Investigación]]></source>
<year>2018</year>
<volume>38</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>96-104</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K.-Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[Q.-Q]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid differential evolution optimization algorithm for no-wait flow shop problem with total flow time criterion]]></article-title>
<source><![CDATA[Application Research of Computers]]></source>
<year>2010</year>
<volume>27</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>2875-7</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Framinan]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Leisten]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient constructive heuristic for flowtime minimisation in permutation flow shops]]></article-title>
<source><![CDATA[Omega - International Journal of Management Science]]></source>
<year>2003</year>
<volume>31</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>311-7</page-range></nlm-citation>
</ref>
<ref id="B17">
<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[Evolutionary multi-objective scheduling procedures in non-standardized production processes]]></article-title>
<source><![CDATA[DYNA]]></source>
<year>2012</year>
<volume>79</volume>
<numero>172</numero>
<issue>172</issue>
<page-range>101-7</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K.-Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.-Q]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion]]></article-title>
<source><![CDATA[International Journal of Advanced Manufacturing Technology]]></source>
<year>2011</year>
<month>a</month>
<volume>56</volume>
<numero>5-8</numero>
<issue>5-8</issue>
<page-range>683-92</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K.-Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.-Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Jia]]></surname>
<given-names><![CDATA[B.-X]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improved Harmony Search Algorithm for No-Wait Flow Shop Schedule]]></article-title>
<source><![CDATA[Computer Engineering]]></source>
<year>2011</year>
<month>b</month>
<volume>37</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>178-80</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K.-Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.-Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.-T.]]></given-names>
</name>
<name>
<surname><![CDATA[Liang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems]]></article-title>
<source><![CDATA[Asia-Pacific Journal of Operational Research]]></source>
<year>2012</year>
<volume>29</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>1250012/1250011-23</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K.-Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<source><![CDATA[A novel grouping harmony search algorithm for the no-wait flow shop scheduling problems with total flow time criteria]]></source>
<year>2010</year>
<conf-name><![CDATA[ Paper presented at the 2010 International Symposium on Computer Communication Control and Automation (3CA)]]></conf-name>
<conf-loc>Tainan, Taiwan </conf-loc>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[K.-Z.]]></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>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization]]></article-title>
<source><![CDATA[International Journal of Advanced Manufacturing Technology]]></source>
<year>2013</year>
<volume>66</volume>
<numero>9-12</numero>
<issue>9-12</issue>
<page-range>1563-72</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gilmore]]></surname>
<given-names><![CDATA[P. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gomory]]></surname>
<given-names><![CDATA[R. E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1964</year>
<volume>12</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>655-79</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Junqing]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolved Discrete Harmony Search Algorithm for Multi-objective No-wait Flow Shop Scheduling Problem]]></source>
<year>2012</year>
<conf-name><![CDATA[ Paper presented at the 2nd International Conference on Computer Application and System Modeling]]></conf-name>
<conf-loc>Taiyuan, Shanxi, China </conf-loc>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[J. N. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Stafford Jr]]></surname>
<given-names><![CDATA[E. F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Flowshop scheduling research after Ave decades]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2006</year>
<volume>169</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>699-711</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hall]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Sriskandarajah]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1996</year>
<volume>44</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>510-25</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hans]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Three-Machine No-Wait Flow Shop is NP-Complete]]></article-title>
<source><![CDATA[Journal of the Association for Computing Machinery]]></source>
<year>1984</year>
<volume>31</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>336-45</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heller]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Some Numerical Experiments for an M &#967; J Flow Shop and Its Decision - Theoretical Aspects]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1960</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>178-84</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holland]]></surname>
<given-names><![CDATA[J. H]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptation in natural and artificial systems]]></source>
<year>1975</year>
<publisher-loc><![CDATA[Ann Arbor, MI ]]></publisher-loc>
<publisher-name><![CDATA[University of Michigan Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[R.-H.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[C.-L.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[S.-C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[No-Wait Flexible Flow Shop Scheduling with Due Windows]]></article-title>
<source><![CDATA[Mathematical Problems in Engineering]]></source>
<year>2015</year>
<volume>9</volume>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[S. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal two- and three-stage production schedules with setup times included]]></article-title>
<source><![CDATA[Naval Research Logistics Quarterly]]></source>
<year>1954</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>61-8</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laha]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Chakraborty]]></surname>
<given-names><![CDATA[U. K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A constructive heuristic for minimizing makespan in no-wait flow shop scheduling]]></article-title>
<source><![CDATA[International Journal of Advanced Manufacturing Technology]]></source>
<year>2008</year>
<volume>41</volume>
<numero>1-2</numero>
<issue>1-2</issue>
<page-range>97-109</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laha]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[J. N. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S. U]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2014</year>
<month>a</month>
<volume>65</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1611-24</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laha]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S. U]]></given-names>
</name>
</person-group>
<source><![CDATA[An Efficient Heuristic Algorithm for m-Machine No-wait flow shops]]></source>
<year>2011</year>
<conf-name><![CDATA[ Paper presented at the International Multi Conference of Engineers and Computer Scientists]]></conf-name>
<conf-loc>Hong Kong </conf-loc>
</nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laha]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S. U]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2014</year>
<month>b</month>
<volume>67</volume>
<page-range>36-43</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miyata]]></surname>
<given-names><![CDATA[H. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Nagano]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[J. N. D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2018</year>
<page-range>1-19</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nagano]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Miyata]]></surname>
<given-names><![CDATA[H. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Araújo]]></surname>
<given-names><![CDATA[D. C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times]]></article-title>
<source><![CDATA[Journal of Manufacturing Systems]]></source>
<year>2015</year>
<volume>36</volume>
<page-range>224-30</page-range></nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nawaz]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Enscore Jr]]></surname>
<given-names><![CDATA[E. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ham]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem]]></article-title>
<source><![CDATA[Omega - International Journal of Management Science]]></source>
<year>1983</year>
<volume>11</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>91-5</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Qi]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2016</year>
<volume>54</volume>
<numero>16</numero>
<issue>16</issue>
<page-range>4957-72</page-range></nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rajendran]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaudhuri]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristic algorithms for continuous flow-shop problem]]></article-title>
<source><![CDATA[Naval Research Logistics]]></source>
<year>1990</year>
<volume>37</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>695-705</page-range></nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reddi]]></surname>
<given-names><![CDATA[S. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramamoorthy]]></surname>
<given-names><![CDATA[C. V]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the Flow-Shop Sequencing Problem with No Wait in Process]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1972</year>
<volume>23</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>323-31</page-range></nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reeves]]></surname>
<given-names><![CDATA[C. R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for flowshop sequencing]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>1995</year>
<volume>22</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>5-13</page-range></nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sapkal]]></surname>
<given-names><![CDATA[S. U.]]></given-names>
</name>
<name>
<surname><![CDATA[Laha]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic for no-wait flow shop scheduling]]></article-title>
<source><![CDATA[International Journal of Advanced Manufacturing Technology]]></source>
<year>2013</year>
<volume>68</volume>
<numero>5-8</numero>
<issue>5-8</issue>
<page-range>1327-38</page-range></nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shafaei]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Moradinasab]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rabiee]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines]]></article-title>
<source><![CDATA[International Journal of Management Science and Engineering Management]]></source>
<year>2011</year>
<volume>6</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>421-30</page-range></nlm-citation>
</ref>
<ref id="B45">
<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[European Journal of Operational Research]]></source>
<year>1993</year>
<volume>64</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>278-85</page-range></nlm-citation>
</ref>
<ref id="B46">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tasgetiren]]></surname>
<given-names><![CDATA[M. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.-K.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganthan]]></surname>
<given-names><![CDATA[P. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Buyukdagli]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2013</year>
<volume>40</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1729-43</page-range></nlm-citation>
</ref>
<ref id="B47">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tyagi]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Varshney]]></surname>
<given-names><![CDATA[N. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Chandramouli]]></surname>
<given-names><![CDATA[A. B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Six decades of flowshop scheduling research]]></article-title>
<source><![CDATA[International Jouranal of Scientific &amp; Engineering Research]]></source>
<year>2013</year>
<volume>4</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>854-64</page-range></nlm-citation>
</ref>
<ref id="B48">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Whitley]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Kauth]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[GENITOR: A different genetic algorithm]]></source>
<year>1988</year>
<conf-name><![CDATA[ Paper presented at the Proceedings of the 1988 Rocky Mountain Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B49">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ying]]></surname>
<given-names><![CDATA[K.-C.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[S.-W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[W.-J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Self-adaptive ruin-and-recreate algorithm for minimizing total flow time in no-wait flowshops]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2016</year>
<volume>101</volume>
<page-range>167-76</page-range></nlm-citation>
</ref>
<ref id="B50">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Iterative search method for total flow-time minimization no-wait flowshop problem]]></article-title>
<source><![CDATA[International Journal of Machine Learning and Cybernetics]]></source>
<year>2015</year>
<volume>6</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>747-61</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
