Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times

Autor(es)

Soler, Willy A. Oliveira ; Santos, Maristela O. ; Akartunali, Kerem

• Tipo de documento: Artigo Científico
• Fonte: Journal of Heuristics; v. 31, n. 1, p. 35-pg., 2025-03-01.

Resumo

In this paper, we study a lot-sizing and scheduling problem apparent in the food industry that stemmed originally from the Brazilian meat production sector. More specifically, we consider a production environment in which various production lines share a set of scarce production resources. Therefore, only a subset of the existing production lines can simultaneously operate in each period under the limitations of the availability of resources. Moreover, we consider sequence-dependent setup times and costs, significant inventory holding costs, backlogging, and perishable products. The problem is formulated as a mixed integer programming model, and we propose four Lagrangian-based heuristics to find high-quality solutions for challenging instances. A computational study shows that proposed approaches are very competitive in solving the problem, outperforming methods already established in the literature. (AU)

• Processo FAPESP: 24/07482-5 - Modelos e Métodos de Solução para Problemas de Planejamento de Produção e de Logística
• Beneficiário: Willy Alves de Oliveira Soler
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado
• Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
• Beneficiário: Francisco Louzada Neto
• Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs