Please use this identifier to cite or link to this item:
|標題:||A hybrid genetic algorithm for the flow-shop scheduling problem||作者:||Tseng, L.Y.
|關鍵字:||genetic algorithms;planning and scheduling;tabu search algorithm;sequencing problem;shop problem||Project:||Lecture Notes in Computer Science||期刊/報告no：:||Lecture Notes in Computer Science, Volume 4031, Page(s) 218-227.||摘要:||
The flow-shop scheduling problem with the makespan criterion is an important production scheduling problem. Although this problem has a simple formulation, it is NP-hard. Therefore many heuristic and metaheuristic methods had been proposed to solve this problem. In this paper, a hybrid genetic algorithm is presented for the flow-shop scheduling problem. In our method, a modified version of NEH with random re-start is used to generate the initial population. Also, a new orthogonal array crossover is devised as the crossover operator of the genetic algorithm. The tabu search is hybridized with the genetic algorithm and acts as the local search method. The proposed algorithm had been tested on two benchmarks. The results are compared with those of other methods that had also been tested on these benchmarks. The comparison shows that our method outperforms other methods on these benchmarks.
|Appears in Collections:||期刊論文|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.