Theoretical Paper
Journal of the Operational Research Society (2005) 56, 687–698. doi:10.1057/palgrave.jors.2601868 Published online 22 December 2004
Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
C Gagné1, M Gravel1 and W L Price2
- 1Université du Québec à Chicoutimi, Chicoutimi, Québec, Canada
- 2Université Laval, Québec, Canada
Correspondence: WL Price, Faculté des Sciences de l'administration, Université Laval, 789 Gérard-Morisset, Québec, Canada G1K 7P4. E-mail: wilson.price@fsa.ulaval.ca
Received 0 July 2003; Accepted 0 June 2004; Published online 22 December 2004.
Abstract
In this paper, we propose a generic approach to find compromise solutions for multiple-objective scheduling problems using metaheuristics. As an illustration, we present a new hybrid tabu search/variable neighbourhood search application of this approach for the solution of a bi-objective scheduling problem. Through numerical experiments we demonstrate its efficiency and effectiveness. We have confirmed that compromise programming with the tabu-VNS metaheuristic generates solutions that approach those of the known reference sets.
Keywords:
metaheuristics, multiple-objective combinatorial optimization, compromise solutions, scheduling, tabu search, variable neighbourhood search
