Advanced search
Start date
Betweenand


A surrogate-based heuristic for production planning problem of orders in small foundries

Full text
Author(s):
Alves, Giovanna Abreu ; Freitas, Iago Pinheiro de ; Camargo, Victor Claudio Bento
Total Authors: 3
Document type: Journal article
Source: Computers & Operations Research; v. 164, p. 11-pg., 2024-01-27.
Abstract

Market foundry production processes are characterized by raw materials that feed a furnace that produces metal alloys with limited capacity to meet item order demand. The foundry production system considered here is make -to -order. Although in the literature, production planning does not usually consider items produced as belonging to orders, it is essential to address this specificity. All component items must be produced to fulfill an order. We propose a surrogate -based heuristic (SUBH) to address the production planning problem of orders in small foundries. The quality of the lower bounds is compared to that of the linearly relaxed problem. The feasibility and optimality of the solutions are tested. Most tested instances are proved optimal. For infeasible solutions, we proposed a feasibility procedure based on item weight and order costs. We obtain excellent results with low computational time. (AU)

FAPESP's process: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 20/10069-1 - Feasibility heuristics for surrogate relaxation to the lotsizing problem in small foundries
Grantee:Iago Pinheiro de Freitas
Support Opportunities: Scholarships in Brazil - Scientific Initiation
FAPESP's process: 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants