Problema de dimensionamento de lotes monoestágio com restrição de capacidade: modelagem, método de resolução e resultados computacionais

• Autor(a) principal: Araujo,Silvio Alexandre de
• Data de Publicação: 2000
• Outros Autores: Arenales,Marcos Nereu
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Pesquisa operacional (Online)
• Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200010
• topic: integer programming; lot-sizing; production planning

This work presents a study on the resolution method of the single product lot sizing problem formulated by Trigeiro et al. (1989). This problem consists of determining the quantities to be produced in different periods of time, minimizing the sum of costs of production, setup and inventory. The quantity to be produced in each period should be sufficient to attend the demands of items, without exceeding the capacity of the machine. To model the aspects of consumption of resources, setup and production times are included in the model. The resolution method developed by Trigeiro et al. (1989) consists of a heuristic method based on Lagrangean relaxation, subgradient optimization and a heuristic smoothing procedure. In this work that method was implemented considering variable costs. Furthermore, it was proposed a modification, based on the optimality conditions of the problem, during the phase of the improvement of the feasible solution. Some computational experiments are presented comparing both versions.