Brueggemann, Tobias; Hurink, Johann L.; Vredeveld, Tjark; … - Maastricht : METEOR, Maastricht Research School of … - 2006
We study the problem of minimizing the makespan on m 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 the jobs assigned to the same machine into two sets. This...