GENERALIZED PAIRWISE INTERCHANGES AND MACHINE SCHEDULING

In this paper a generalization of pairwise interchanges is considered and applied to machine scheduling problems. It is shown how these swap operators can be used to compute bounds for Branch and Bound procedur es, to prove dominance properties and to define a high-performance nei ghborhood for local search methods.