Solution of special scheduling problems by some neighbourhood structures of iteration methods

Many discrete optimization problems belong to the class of NP-hard problems. Therefore a number of approximation methods has been developed for these problems. As regards iteration methods, the determination of a suitable neighbourhood has a special importance. This paper considers various neighbourhood structures which can be used to solve such problems iteratively where the set of solutions is given by the set of permutations of m elements. Based on some introduced neighbourhood graphs, it states some properties of these structures.