Heurísticas para o problema de dimensionamento e sequenciamento de lotes em um ambiente de produção flowshop

• Autor(a) principal: Madrid Villadiego, Harlem Maurício
• Data de Publicação: 2014
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: LOCUS Repositório Institucional da UFV
• Texto Completo: http://locus.ufv.br/handle/123456789/2682
• topic: Heurística; Algorítmo; Flowshop; Sheduling; Dimensionamento de lotes; Heuristic; Algorithm; Flowshop; Sheduling; Lot-sizing; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

In this work, we consider a finite planning horizon and divided into equal periods. The problem consists on determining the lot sizing and the production sequence in each period of a planning horizon so that the customer demands will be met and machines capacity respected. The objective is to minimize the sum of the setup, production and inventory costs. Given the complexity of the problem, this work proposes three heuristic algorithms, all them based on metaheuristic Iterated Greedy (IG). In the proposed algorithms, the better production sequence, in each period, is determined by the basic procedures (destruction- construction and local search) of IG and the best lot sizing, for each product for each period, is determined using different methods.In the first algorithm, named IG+HR, an adaptations of Rolling Horizon (HR) heuristic is used. In the second algorithm, named IG+MDL, a improvement lot sizing method is used in which the production between the periods is advanced and postponed. In the third algorithm, named IG+F& 0, an adaptations of the heuristic Fix and Optimize (F& 0), proposed in the literature, is used. To analysis the performance of the proposed heuristic algorithms, different computational tests were realized using a set of small medium and large instances of the problem The results obtained are compared against the results of the better methods available in the literature. These results are validated by statistical test.