'Problema de Dimensionamento de Lotes: uma abordagem via Relaxação Lagrangiana'

Detalhes bibliográficos
Ano de defesa: 2024
Autor(a) principal: LEE JING XUAN
Orientador(a): Rubia Mara de Oliveira Santos
Banca de defesa: Não Informado pela instituição
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Fundação Universidade Federal de Mato Grosso do Sul
Programa de Pós-Graduação: Não Informado pela instituição
Departamento: Não Informado pela instituição
País: Brasil
Palavras-chave em Português:
Link de acesso: https://repositorio.ufms.br/handle/123456789/9242
Resumo: A lot-sizing problem (LSP) is a production planning problem. Given a planning horizon discretized into time periods, the goal is to determine when and how many products should be produced in each period, aiming to minimize operational costs. The objective of this work is to solve an NP-hard LSP by applying Lagrangian Relaxation. This technique simplifies the problem by dualizing constraints and introducing penalties. The challenge is to determine the optimal penalties that bring the solution closer to optimality, using the subgradient method. In addition, heuristics for feasibility and improvement are proposed to obtain high-quality solutions. Finally, the efficiency of the technique for the problem under study will be evaluated based on tests performed with instances from the literature, considering the resolution time, duality gap, and the solutions obtained by the proposed approaches.