Bui Thanh Trung creator Huynh, Trung Luong Chairperson Anulark Techanitisawad Examination committee Voratas Kachitvichyanukul Examination Committee Petro Vietnam Scholarship donor text series technical report th Pathum Thani, Thailand Asian Institute of Technology 2005 continuing eng 60 p. 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. A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced of Technologies Thesis (M.Eng.) - Asian Institute of Technology, 2005 Genetic algorithms Production scheduling Asian Institute of Technology. http://203.159.5.9/ait-thesis/detail.php?q=B09627 http://203.159.5.9/ait-thesis/detail.php?q=B09627 060123 20260817162859.0