Evolutionary fragmentary algorithm for permutation flow shop problem

The article tackles the strongly $\mathscr{NP}$-hard permutation flow shop problem. The fragmentary structure of the problem is pointed out. The evolutionary fragmentary approach for optimal solution is proposed. The testing of evolutionary fragmentary algorithm on instances' set from the ORLib library is conducted.