| Full text | |
| Author(s): |
Soler, Willy A. Oliveira
;
Santos, Maristela O.
;
Akartunali, Kerem
Total Authors: 3
|
| Document type: | Journal article |
| Source: | Journal of Heuristics; v. 31, n. 1, p. 35-pg., 2025-03-01. |
| Abstract | |
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) | |
| FAPESP's process: | 24/07482-5 - Models and Solution Methods for Production Planning and Logistics Problems |
| Grantee: | Willy Alves de Oliveira Soler |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |