| Article ID: | iaor19981162 |
| Country: | Netherlands |
| Volume: | 83 |
| Issue: | 2 |
| Start Page Number: | 310 |
| End Page Number: | 319 |
| Publication Date: | Jun 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Croce Federico Della |
| Keywords: | programming: mathematical, programming: branch and bound, combinatorial optimization |
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 procedures, to prove dominance properties and to define a high-performance neighborhood for local search methods.