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

V. Sels (), J. Coelho and Mario Vanhoucke

Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium from Ghent University, Faculty of Economics and Business Administration

Abstract: 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.

Pages: 2 pages
Date: 2011-10
New Economics Papers: this item is included in nep-cmp
References: Add references at CitEc
Citations:

Downloads: (external link)
http://wps-feb.ugent.be/Papers/wp_11_753.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rug:rugwps:11/753

Access Statistics for this paper

More papers in Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium from Ghent University, Faculty of Economics and Business Administration Contact information at EDIRC.
Bibliographic data for series maintained by Nathalie Verhaeghe ().