![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
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.
An Erratum for this chapter can be found at http://dx.doi.org/10.1057/palgrave.jors.2600667
An erratum to this article is available at http://dx.doi.org/10.1057/palgrave.jors.2600667.
An Erratum for this chapter can be found at http://dx.doi.org/10.1057/palgrave.jors.2600667
An erratum to this article is available at http://dx.doi.org/10.1057/palgrave.jors.2600667.