SOLVING MULTIOBJECTIVE FLOWSHOP SCHEDULING PROBLEM BY GRASP WITH PATH-RELINKING
SOLVING MULTIOBJECTIVE FLOWSHOP SCHEDULING PROBLEM BY GRASP WITH PATH-RELINKING
No Thumbnail Available
Date
2011
Authors
Iryna Yevseyva
Jorge Pinho de Sousa
Ana Viana
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
In this work, a hybrid metaheuristic for solving the bi-objective
flowshop problem with makespan and tardiness objectives is proposed.
It is based on the well-known greedy randomized adaptive
search procedure (GRASP) with path-relinking adapted to the
multiobjective case. The proposed approach is tested on several
flowshop instances and compared to existing results from literature
with the hypervolume performance measures.