Por favor, use este identificador para citar o enlazar este ítem:
http://www.repositorio.ufop.br/jspui/handle/123456789/11344
Título : | A Multi-objective Variable Neighborhood Search algorithm for solving the Hybrid Flow Shop Problem. |
Autor : | Siqueira, Eduardo Camargo de Souza, Marcone Jamilson Freitas Souza, Sergio Ricardo de |
Palabras clave : | Multi-objective optimization |
Fecha de publicación : | 2018 |
Citación : | SIQUEIRA, E. C. de; SOUZA, M. J. F.; SOUZA, S. R. de. A Multi-objective Variable Neighborhood Search algorithm for solving the Hybrid Flow Shop Problem. Electronic Notes in Discrete Mathematics, v. 66, p. 87-94, abr. 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300581>. Acesso em: 19 mar. 2019. |
Resumen : | This 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. |
URI : | http://www.repositorio.ufop.br/handle/123456789/11344 |
metadata.dc.identifier.uri2: | https://www.sciencedirect.com/science/article/pii/S1571065318300581?via%3Dihub#! |
metadata.dc.identifier.doi: | https://doi.org/10.1016/j.endm.2018.03.012 |
ISSN : | 1571-0653 |
Aparece en las colecciones: | DECOM - Artigos publicados em periódicos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
ARTIGO_MultiObjectiveVariable.pdf Restricted Access | 336,14 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.