Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems |
| |
Authors: | C Gagné M Gravel W L Price |
| |
Institution: | 1.Université du Québec à Chicoutimi,Chicoutimi,Canada;2.Université Laval,Canada |
| |
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: | |
本文献已被 SpringerLink 等数据库收录! |