Proposição e análise de modelos híbridos para o problema de escalonamento de produção em oficina de máquinas

• Ano de defesa: 2010
• Autor(a) principal: Fraga, Tatiana Balbi
• Orientador(a): Silva Neto, Antônio José da
• Banca de defesa: Biondi Neto, Luiz , Cursi, José Eduardo Souza de , Ferreira, Edson Luiz Cataldo , Yanasse, Horacio Hideki
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade do Estado do Rio de Janeiro
• Programa de Pós-Graduação: Programa de Pós-Graduação em Modelagem Computacional
• Departamento: Centro de Tecnologia e Ciências::Instituto Politécnico
• País: BR
• Palavras-chave em Português: Escalonamento da produção; Busca Tabu; Multidão de partículas; Colisão de partículas; Hibridização; Otimização; Algoritmo
• Palavras-chave em Inglês: Scheduling problem; Tabu Search; Particle swarm optimization; Particle collision; Hybridization; Optimization
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::MATEMATICA::MATEMATICA APLICADA
• Link de acesso: http://www.bdtd.uerj.br/handle/1/13646

In recent decades, the Job Shop Scheduling Ploblem (JSSP) has received great attention of researchers worldwide. One of the reasons for such interest is its high complexity. The JSSP is a combinatorial optimization problem classified as NP-Hard and, although there is a variety of methods and heuristics that are able to solve it, even today no method or heuristic is able to find optimal solutions for all benchmarcks presented in the literature. The other reason builds on noted fact that this problem is present in day-to-day of industries of various segments and, since the optimal scheduling may cause a significant reduction in production time and thus a better utilization of manufacturing resources, it can generate a strong impact on the gain of these industries, especially in cases where the production sector is responsible for most of their total costs. Among the heuristics that can be applied to the solution of this problem, the Tabu Search and the Particle Swarm Optimization show good performance for most benchmarcks found in the literature. Usually, the Taboo Search heuristic presents a good and fast convergence to the optimal or sub-optimal points, but this convergence is frequently interrupted by cyclical processes, offset, the Particle Swarm Optimization heuristic tends towards a convergence by means of a lot of computational time, and the performance of both heuristics strongly depends on the adjusting of its parameters. This thesis presents four different hybridization models to solve the classical Job Shop Scheduling Problem, three of which based on the general schema of Local Search Heuristics and the fourth based on the method Particle Collision. These models are analyzed with these two heuristics, Taboo Search and Particle Swarm Optimization, and the elements of this heuristics, showing what aspects must be considered in order to achieve a best solution of the one obtained by the original heuristics in a considerable computational time. As results this thesis demonstrates that the four models are able to improve the robustness of the original heuristics and the results found by Taboo Search.