Descent search approaches applied to the minimization of open stacks.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorLima, Júnior Rhis-
Autor(es): dc.creatorCarvalho, Marco Antonio Moreira de-
Data de aceite: dc.date.accessioned2025-08-21T15:25:15Z-
Data de disponibilização: dc.date.available2025-08-21T15:25:15Z-
Data de envio: dc.date.issued2018-01-26-
Data de envio: dc.date.issued2018-01-26-
Data de envio: dc.date.issued2017-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/9363-
Fonte completa do material: dc.identifierhttp://www.sciencedirect.com/science/article/pii/S0360835217303741-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.cie.2017.08.016-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1014077-
Descrição: dc.descriptionIn this paper, new algorithms are proposed for solving the minimization of open stacks, an industrial cutting pattern sequencing problem. In the considered context, the objective is to minimize the use of intermediate storage, as well as the unnecessary handling of manufactured products. We introduce a new local search method, specifically tailored for this NP-hard problem, which has wide practical applications. In order to further explore the solution space, we use this new local search as a component in two descent search methods associated with grouping strategies: variable neighborhood descent and steepest descent. Computational experiments were conducted involving 595 benchmark instances from five different sets through which the contributions of the proposed methods were compared with those of the state-of-the-art methods. The results demonstrate that the proposed algorithms are competitive and robust, as high quality solutions were consistently generated in a reasonable running time.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectScheduling-
Palavras-chave: dc.subjectMinimization of open stacks-
Palavras-chave: dc.subjectVariable neighborhood descent-
Título: dc.titleDescent search approaches applied to the minimization of open stacks.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.