Algorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorRosa, Bruno Ferreira-
Autor(es): dc.creatorSouza, Marcone Jamilson Freitas-
Autor(es): dc.creatorSouza, Sergio Ricardo de-
Data de aceite: dc.date.accessioned2025-08-21T15:52:45Z-
Data de disponibilização: dc.date.available2025-08-21T15:52:45Z-
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/11343-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/pii/S1571065318300532-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.endm.2018.03.007-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1026350-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectSequence-Dependent Setup Times-
Título: dc.titleAlgorithms based on VNS for solving the Single Machine Scheduling Problem with Earliness and Tardiness Penalties.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.