Métodos de solução para o problema de dimensionamento e sequenciamento de lotes com limpezas temporais.

• Ano de defesa: 2020
• Autor(a) principal: Pineros Garcia, Juan Sebastian
• Orientador(a): Ferreira, Deisemara
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de São Carlos; Câmpus Sorocaba
• Programa de Pós-Graduação: Programa de Pós-Graduação em Engenharia de Produção - PPGEP-So
• Palavras-chave em Português: Bebidas à base de frutas; Fruit drinks; Heuristic methods; Dimensionamento e sequenciamento de lotes; Métodos heurísticos; Limpezas temporais; Lot sizing and scheduling; Temporal cleaning
• Área do conhecimento CNPq: ENGENHARIAS::ENGENHARIA DE PRODUCAO
• Link de acesso: https://repositorio.ufscar.br/handle/20.500.14289/13755

This paper presents the lot sizing and scheduling problem found in the production of fruit drinks. This is a two-stage production with some particularities: presence of a lung tank in the second stage and the need for mandatory cleanings at each predetermined time of continuous production of the same item. According to Associação Brasileira das Indústrias de Refrigerantes e de Bebidas Não Alcoólicas, the consumption of ready-to-drink fruit drinks is at its peak when compared to the consumption of soft drinks. From 2010 to 2017, the production of fruit drinks shows an increase of 48%, while the production of soft drinks market shows a decrease of 25%. In addition, on average, companies spend around 20% of the day cleaning line equipment. As far as the literature review is concerned, this problem with these characteristics is relatively new, difficult to solve for large real instances and has wide applicability. Based on a mathematical model found in the literature for the problem, analytical methods such as decomposition heuristic and hybrid meta-heuristic are proposed, in order to support decision making in a more efficient way in the planning and lot sizing seeking to minimize the costs associated with production. Computational tests were performed with instances found in the literature, based on real data, and with generated instances. These new instances were generated with the objective of having scenarios more adjusted to reality. Taking into consideration that a more in-depth investigation of the instances found in the literature will show, for the most part, excessive capacities and unbalanced costs. Decomposition and improvement heuristics (Fix-and-optimize) and Simulated Annealing heuristics were tested. The results found were compared with the best method found in the literature for the studied problem. Decomposition and improvement heuristics find better performances in instances with medium or low dimensions, however, for the larger dimensions the heuristic of the literature presents better computational performance.