An effectie heuristic for minimising makespan on unrelated parallel machines

An effectie heuristic for minimising makespan on unrelated parallel machines

0.00 Avg rating0 Votes
Article ID: iaor19992340
Country: United Kingdom
Volume: 49
Issue: 8
Start Page Number: 886
End Page Number: 894
Publication Date: Aug 1998
Journal: Journal of the Operational Research Society
Authors:
Keywords: heuristics
Abstract:

Scheduling independent tasks on unrelated machines is a relatively difficult and challenging problem. In this paper, we develop a tabu search based heuristic for minimising makespan for the above problem that can provide good quality solutions for practical size problems within a reasonable amount of computational time. Our adaptation of this tabu search uses hashing to control the tabu restrictions of the search process and requires fewer critical parameters than many of the common tabu search approaches employed for combinatorial optimisation. Hashing is simple to implement and very effective in providing a near-optimal solution. Computational results are presented to demonstrate the effectiveness of the proposed heuristic.

Reviews

Required fields are marked *. Your email address will not be published.