Improving local search heuristics for some scheduling problems—I

What is it about?

For some scheduling problems, an approach is given which allows to perform a local search on the set of locally optimal solutions with respect to some primary neighborhood. Connectivity properties of the resulting neighborhood graphs are shown.

Featured Image

Why is it important?

It is an interesting approach for improving local search algorithms. It is closely related to those algorithms later introduced and denoted as 'iterated local search'.