O problema de sequenciamento em máquina única em uma indústria metal mecânica

Abstract

This work deals with a problem of lot sequencing in an industry of springs and auto parts of the north of Paraná. In which, there is a sequence of unique and serial machines, where the final product of one machine is the initial product of the next, setup times vary according to lot sequencing. Parts of similar processes require minimal adjustments, however, depending on the case, the setup time increases significantly. The product does not necessarily go through all the machines, but it follows the same flow characterizing a single machine sequencing problem with dependent setup times. To arrive at a feasible solution, the Vizinho Mais Próximo (VMP) heuristic and Hill Climbing algorithm are proposed as sequencing tools, the 2-OPT algorithm is used to improve the solutions found. The proposed study obtained an improvement of up to 53% of the current solution used by the company with the application of the 2-OPT improvement algorithm, the results obtained were mutually contrasted, and the techniques reached a satisfactory solution.