Bui Thanh Trung <br/><br/>
Application of genetic algorithm in continuous flow shop scheduling 

 - Pathum Thani, Thailand :  Asian Institute of Technology,  2005 
 - 60 p. 
 - Thesis ;  no. ISE-05-05 .
 - Asian Institute of Technology.  Thesis ;  no. ISE-05-05 .
<br/><br/> A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced of Technologies 
<br/><br/>Thesis (M.Eng.) - Asian Institute of Technology, 2005 
<br/><br/> Continuous flow-shop scheduling problem is a class of sequencing problem in the field of production planning. The problem considered in this study is to find the permutation of jobs to be processed. The processing has no-waiting time between two consecutive jobs with respect to the objective of minimizing the makespan. The problem here is also NP-hard. This study considers the application of genetic algorithm to the continuous flow shop scheduling problem. Computational results is considered about the quality based on the running time and some parameters of the genetic algorithms, and the comparision with other two methods such as optimal method (Lingo) and cheapest insertion heuristic.  
<br/><br/><label>Subjects--Topical Terms: </label><br/>Genetic algorithms<br/>Production scheduling