一种快速解决PFSP问题的混合遗传算法

流水车间调度问题属于NP难问题，并且和实际问题联系很紧。但是因为它的解空间太大，一般的算法很容易过早的陷入局部最优或者计算时间太长，提出了一种比较快速的混合遗传算法，能够在很短时间内计算出比较优的结果。详细介绍了这种算法的效果，并与两种常用来解决此类问题的算法进行了比较，总结出了这个算法的特点。

Quick hybrid-genetic algorithm used to solve permutation flowshop sequencing problem

Flowshop sequencing problem belongs to NP-hard problem, and it is similar to the realities, so it is deserved to be solved. Because this kind of problems always have a huge landscape of sequences, it is too hard to find a global-optimal result in a short time. A hybird-genetic algorithm is commended to solve this kind of problems efficently, which can find a good result in few minutes. This algorithm will be discussed particulary in the following text. At the end of the paper, characters of the algorithm are concluded.