Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

An Effective Heuristic for Minimising Makespan on Unrelated Parallel Machines

B. Srivastava
The Journal of the Operational Research Society
Vol. 49, No. 8 (Aug., 1998), pp. 886-894
DOI: 10.2307/3009970
Stable URL: http://www.jstor.org/stable/3009970
Page Count: 9
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
An Effective Heuristic for Minimising Makespan on Unrelated Parallel Machines
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
[886]
    [886]
  • Thumbnail: Page 
887
    887
  • Thumbnail: Page 
888
    888
  • Thumbnail: Page 
889
    889
  • Thumbnail: Page 
890
    890
  • Thumbnail: Page 
891
    891
  • Thumbnail: Page 
892
    892
  • Thumbnail: Page 
893
    893
  • Thumbnail: Page 
894
    894