A Multi-objective Variable Neighborhood Search algorithm for solving the Hybrid Flow Shop Problem.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorSiqueira, Eduardo Camargo de-
Autor(es): dc.creatorSouza, Marcone Jamilson Freitas-
Autor(es): dc.creatorSouza, Sergio Ricardo de-
Data de aceite: dc.date.accessioned2025-08-21T15:41:37Z-
Data de disponibilização: dc.date.available2025-08-21T15:41:37Z-
Data de envio: dc.date.issued2019-05-17-
Data de envio: dc.date.issued2019-05-17-
Data de envio: dc.date.issued2018-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/11344-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/pii/S1571065318300581?via%3Dihub#!-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.endm.2018.03.012-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1021751-
Descrição: dc.descriptionThis paper addresses the Hybrid Flow Shop Problem (HFSP) through the Multi-objective Variable Neighborhood Search metaheuristic (MOVNS). In this problem, we have a set of jobs that must be performed on a set of stages. At each stage, we have a set of unrelated parallel machines. Some jobs may skip stages. In this paper we considere two evaluation criteria under simultaneous analysis: the minimization of the makespan and the minimization of the weighted sum of tardiness. Instances of the HFSP from literature are solved by four versions of the MOVNS algorithm. The results are evaluated using the Hypervolume, Epsilon, Spacing and Sphere counting metrics.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectMulti-objective optimization-
Título: dc.titleA Multi-objective Variable Neighborhood Search algorithm for solving the Hybrid Flow Shop Problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.