On the heuristic solution of the permutation flow shop problem by path algorithms

What is it about?

The core of the algorithm is the introduction of a flexible neighborhood structrue in the sense that one generates a set of paths (i.e., several consecutive neighbors) in the chosen neighborhood in dependence on how promising the particular paths are for an improvement of the objective function value.

Featured Image