Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures

Authors:
Francis Sourd
Affiliations:
LIP6—Université Pierre et Marie Curie, 4, place Jussieu-F-75252 Paris, France. Francis.Sourd@lip6.fr
Venue:
Journal of Heuristics
Year:
2001

Citing 7
Cited 6

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
Interleaved depth-first search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Mathematical and Computer Modelling: An International Journal

A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Theoretical Computer Science
Search tree based approaches for parallel machine scheduling

Computers and Operations Research
Size-reduction heuristics for the unrelated parallel machines scheduling problem

Computers and Operations Research
Scheduling unrelated parallel machines computational results

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.