Publicação

Um Método heurístico aplicado no problema de programação flow shop permutacional

Detalhes bibliográficos
Resumo:	The aim of this paper is to present a new method applied to solve the FlowShop Scheduling Problem (FSP). The method can also be used to solve Combinatorial Optimization Problems that involves permutation, it is a simple program of computer where the solution structure is based on permutation. This technique partitions the set of feasible solutions into small regions to diversify the local search. The technique was applied effectively to the FSP which is an NP-hard problem and difficult to be solved in the practice. Extensive computational experiments are reported for instances with up to 100 jobs and 20 machines and the results are compared with those obtained from the literature. Key words: Scheduling Problem, Combinatorial Optimization, Heuristics
Autores principais:	Silva, José Lassance de Castro
Outros Autores:	Soma, Ney Yoshihiro
Assunto:	Problema de seqüenciamento Otimização combinatória Heurística
Ano:	2015
País:	Brasil
Tipo de documento:	artigo
Tipo de acesso:	acesso aberto
Instituição associada:	IBICT
Idioma:	português
Origem:	Oasisbr

Descrição
Resumo:	The aim of this paper is to present a new method applied to solve the FlowShop Scheduling Problem (FSP). The method can also be used to solve Combinatorial Optimization Problems that involves permutation, it is a simple program of computer where the solution structure is based on permutation. This technique partitions the set of feasible solutions into small regions to diversify the local search. The technique was applied effectively to the FSP which is an NP-hard problem and difficult to be solved in the practice. Extensive computational experiments are reported for instances with up to 100 jobs and 20 machines and the results are compared with those obtained from the literature. Key words: Scheduling Problem, Combinatorial Optimization, Heuristics

Não foram encontrados projetos financiados.