Scheduling tasks on unrelated machines: large neighborhood improvement procedures

Francis Sourd (1)

1 SYSDEF - Systèmes d'aide à la décision et à la formation

Two approximation algorithms are presented for minimizing the makespan of independant tasks assigned on unrelated machines. The first one is based upon a partial and heuristical exploration of a search tree, which is used not only to build a solution but also to improve it thanks to a post-optimization procedure. The second implements a new large neighborhood improvement procedure to an already existing algorithm. Computational experiments show that their efficiency is equivalent to the best local search heuristics.

Domaines: Informatique [cs]

Francis Sourd. Scheduling tasks on unrelated machines: large neighborhood improvement procedures. Journal of Heuristics, 2001, 7 (6), pp.519-531. ⟨10.1023/A:1011960407575⟩. ⟨hal-01194872⟩