IDEAS home Printed from
   My bibliography  Save this paper

Truncated branch-and-bound guided meta-heuristics for the unrelated parallel machine scheduling problem


  • V. SELS





In this paper, we consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in order to minimize the makespan. We develop two heuristic approaches, i.e. a genetic algorithm and a tabu search algorithm and the hybridization of these heuristics with a truncated branch-and-bound procedure. This hybridization is made in order to accelerate the search process to near-optimal solutions. The branch-and-bound procedure will check whether the solutions obtained by the meta-heuristics can be scheduled within a tight upper bound. We compare the performances of these heuristics on standard data sets available in the literature. Moreover, the influence of the different heuristic parameters is examined as well. The computational experiments reveal that the hybrid heuristics are (almost) able to compete with the best known results from the literature.

Suggested Citation

  • V. Sels & J. Coelho & M. Vanhoucke, 2011. "Truncated branch-and-bound guided meta-heuristics for the unrelated parallel machine scheduling problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 11/753, Ghent University, Faculty of Economics and Business Administration.
  • Handle: RePEc:rug:rugwps:11/753

    Download full text from publisher

    File URL:
    Download Restriction: no

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:11/753. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.