Please use this identifier to cite or link to this item:
Title: An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem.
Authors: Siqueira, Eduardo Camargo de
Souza, Marcone Jamilson Freitas
Souza, Sergio Ricardo de
Keywords: Multiobjective optimization
Issue Date: 2019
Citation: SIQUEIRA, E. C.; SOUZA, M. J. F.; SOUZA, S. R. An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem. International Transactions in Operational Research, v. 27, p. 614-650, mar. 2019. Disponível em: <>. Acesso em: 18 jun. 2020.
Abstract: This paper addresses the multiobjective hybrid flow shop (MOHFS) scheduling problem. In the MOHFS problem considered here, we have a set of jobs that must be performed in a set of stages. At each stage, we have a set of unrelated parallel machines. Some jobs may skip stages. The evaluation criteria are the minimizations of makespan, the weighted sum of the tardiness, and the weighted sum of the earliness. For solving it, an algorithm based on the multiobjective general variable neighborhood search (MO-GVNS) metaheuristic, named adapted MO-GVNS, is proposed. This work also presents and compares the results obtained by the adapted MO-GVNS with those of four other algorithms: multiobjective reduced variable neighborhood search, nondominated sorting genetic algorithm II (NSGA-II), and NSGA-III, and another MO-GVNS from the literature. The results were evaluated based on the Hypervolume, Epsilon, and Spacing metrics, and statistically validated by the Levene test and confidence interval charts. The results showed the efficiency of the proposed algorithm for solving the MOHFS problem.
ISSN: 1475-3995
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
2,63 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.