EEMCS EPrints Service
Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2008) Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines. In: 5th International Workshop on Approximation and Online Algorithms, October 11-12, 2007, Eilat, Israel. pp. 41-54. Lecture Notes in Computer Science 4927. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-77917-9
This is the latest version of this eprint.
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-540-77918-6_4
We study the problem of minimizing the makespan on parallel machines. We introduce a very large-scale neighborhood of exponential size (in the number of machines) that is based on a matching in a complete graph. The idea is to partition for every machine the set of assigned jobs into two sets by some fixed rule and then to reassign these parts such that every machine gets exactly two parts. The split neighborhood consists of all possible reassignments of the parts and a best neighbor can be calculated in by determining a perfect matching with minimum maximal edge weight. We examine local optima in the split neighborhood and in combined neighborhoods consisting of the split and other known neighborhoods and derive performance guarantees for these local optima.
Available Versions of this Item
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item