Improved heuristic algorithms for the job sequencing and tool switching problem.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorPaiva, Gustavo Silva-
Autor(es): dc.creatorCarvalho, Marco Antonio Moreira de-
Data de aceite: dc.date.accessioned2025-08-21T15:43:45Z-
Data de disponibilização: dc.date.available2025-08-21T15:43:45Z-
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/9364-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/pii/S0305054817301971-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.cor.2017.07.013-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1022671-
Descrição: dc.descriptionIn flexible manufacturing systems, a single machine can be configured with different tools for process- ing different jobs, each requiring a specific set of tools. There is a limit to the maximum number of tools that can be loaded simultaneously in the machine; between the processing of two different jobs, it may be necessary to switch these tools, causing interruptions in the production line. The Job Sequenc- ing and Tool Switching Problem (SSP) aims to determine a job sequence and the tool-loading order for a flexible machine, in order to minimize the number of tool switches. These two tasks can be separated into Sequencing , an N P -hard problem, and Tooling , which is a Pproblem if the job sequence is given. This paper proposes a methodology that uses graph representations, heuristic methods, and local search methods to solve the sequencing problem. These contributions are combined in an Iterated Local Search scheme, which is then combined with a classical tooling method, in order to solve the SSP. Comprehen- sive computational experiments show that the resulting method is competitive and can establish new best solutions for literature instances, while outperforming the current state-of-the-art method.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectScheduling job-
Palavras-chave: dc.subjectSequencing and tool-
Palavras-chave: dc.subjectSwitching problem-
Palavras-chave: dc.subjectIterated local search-
Título: dc.titleImproved heuristic algorithms for the job sequencing and tool switching problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.