Métodos heurísticos para programação de flow shopbicritério com datas de liberação e setup independente
Carregando...
Data
2014-10-30
Autores
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal de Goiás
Resumo
In this work are presented and evaluated sequencing rules and heuristic methods for production scheduling in permutation flow shop systems with setup times independent of the sequence of execution of tasks. The release dates of the tasks were also considered, seeking simulate a reality closer to a production environment in an organization where tasks usually arrive dynamically and not simultaneously. In the first part of this study, were defined and implemented computationally eight rules (R1, R2, R3, R4, R5, R6, R7 and R8), based on recognized rules SPT (Shortest Processing Time) and LPT (Longest Processing Time), adapted to this problem. The second stage of this study consisted of the creation of four heuristics (H1, H2, H3 and H4), based on the best rules, and comparative analysis of the performance of all the methods proposed solution, similar to the assessment rules priority, including the results of the optimal solution obtained by the method of complete enumeration. After computational implementation, the H1, H2 and H3 heuristics performed well, with satisfactory results near optimal solution.
Descrição
Palavras-chave
Programação da produção, Flow shop permutacional, Setup independente, Production scheduling, Permutation flow shop, Setup independent
Citação
ARAÚJO, Caio Soares de. Métodos heurísticos para programação de flow shopbicritério com datas de liberação e setup independente. 2014. 72 f. Dissertação (Mestrado Profissional em Gestão Organizacional) - Universidade Federal de Goiás, Catalão, 2014.