Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/11343
Title: Algorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties.
Authors: Rosa, Bruno Ferreira
Souza, Marcone Jamilson Freitas
Souza, Sergio Ricardo de
Keywords: Sequence-Dependent Setup Times
Issue Date: 2018
Citation: ROSA, B. F.; SOUZA, M. J. F.; SOUZA, S. R. de. Algorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties. Electronic Notes in Discrete Mathematics, v. 66, p. 47-54, abr. 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300532#!>. Acesso em: 19 mar. 2019.
Abstract: This work implements and compares four algorithms based on Variable Neighborhood Search (VNS), named RVNS, GVNSf, GVNSr and GVNSrf, for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties (SM-SPETP). Computational experiments showed that the algorithm GVNSf obtained better-quality solutions compared with the other algorithms, including an algorithm found in the literature. The algorithms GVNSr and GVNSrf obtained solutions close to the GVNSf, and outperformed the algorithm of the literature, both with respect to the quality of the solutions and the computational times.
URI: http://www.repositorio.ufop.br/handle/123456789/11343
metadata.dc.identifier.uri2: https://www.sciencedirect.com/science/article/pii/S1571065318300532
metadata.dc.identifier.doi: https://doi.org/10.1016/j.endm.2018.03.007
ISSN: 1571-0653
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_AlgorithmsBasedVNS.pdf211,36 kBAdobe PDFView/Open    Request a copy


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