Maristela Oliveira Santos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Maristela Oliveira Santos has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Reinaldo Morabito
Departamento de Engenharia de Produção, Universidade Federal de Sao Carlos, Sao Carlos, Brazil
8 shared publications - Willy Alves de Oliveira Soler
Mathematics Institute, Universidade Federal de Mato Grosso do Sul, Campo Grande, Brazil
7 shared publications - Bernardo Almada-Lobo
INESC-TEC, Faculty of Engineering of the University of Porto, Porto, Portugal
5 shared publications - Caio Paziani Tomazella
Universidade de São Paulo
4 shared publications - Jose Alberto Cuminato
Universidade de São Paulo
4 shared publications - Kerem Akartunalı
University of Strathclyde
4 shared publications
Latest Publications
- Open Access
- 23 July 2026
- Published by Elsevier in SSRN Electronic Journal
Modeling Approaches for Production Planning of Perishable Products Under Depreciation Effects
This paper addresses a production planning problem faced by Brazilian meat companies. Several perishable products are manufactured on production lines that share limited resources, including tools, machines, and workers. Resource scarcity forces managers to decide which lines to operate in each period while respecting capacity constraints. The problem also involves inventory holding costs, backlogging, sequence-dependent setup times and costs, and costs associated with assembling production lines. Product perishability further complicates decision-making, as major customers (supermarkets and restaurant chains) avoid accepting items close to their shelf life at standard prices, making discount policies based on product age necessary. To address this problem, we propose a modeling and optimization approach. First, a price-and age-dependent demand function is developed, combining regular market prices and forecasted demand. Next, a customer service policy common in the target market is formalized, leading to an age-dependent pricing function. These prices are incorporated as parameters in a mixed-integer programming (MIP) model representing operational production planning decisions. A computational study evaluates the proposed approach and provides managerial insights into how price depreciation influences production planning.
- 23 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessModeling Approaches for Production Planning of Perishable Products Under Depreciation Effects
This paper addresses a production planning problem faced by Brazilian meat companies. Several perishable products are manufactured on production lines that share limited resources, including tools, machines, and workers. Resource scarcity forces managers to decide which lines to operate in each period while respecting capacity constraints. The problem also involves inventory holding costs, backlogging, sequence-dependent setup times and costs, and costs associated with assembling production lines. Product perishability further complicates decision-making, as major customers (supermarkets and restaurant chains) avoid accepting items close to their shelf life at standard prices, making discount policies based on product age necessary. To address this problem, we propose a modeling and optimization approach. First, a price-and age-dependent demand function is developed, combining regular market prices and forecasted demand. Next, a customer service policy common in the target market is formalized, leading to an age-dependent pricing function. These prices are incorporated as parameters in a mixed-integer programming (MIP) model representing operational production planning decisions. A computational study evaluates the proposed approach and provides managerial insights into how price depreciation influences production planning.
- Open Access
- 26 March 2026
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Trends in Computational and Applied Mathematics
- Vol. 27 (1) , e01861
O Problema Integrado de Produção e Roteamento com Flexibilidade nos Prazos de Entrega
Este artigo investiga o problema integrado de produção, estoque e roteamento com prazos de entrega flexíveis, ou seja, as entregas podem acontecer em um conjunto de períodos, porém sujeitas a penalizações. Para lidar com o problema, desenvolve-se um modelo de otimização linear inteira que flexibiliza os prazos de entrega dos itens demandados. Considera-se um ambiente produtivo com uma única fábrica, capaz de produzir uma quantidade finita de produtos distintos que compartilham recursos produtivos. Há um conjunto de clientes com estoques próprios e uma frota limitada de veículos heterogêneos. Cada veículo realiza no máximo uma rota por período. O objetivo do modelo é determinar o plano de produção, estoque e roteamento que minimize os custos ao longo de um horizonte finito, atendendo às demandas dentro dos períodos possíveis (due dates). Análises considerando um conjunto de instâncias mostram que explorar a flexibilidade nos prazos de entrega pode reduzir significativamente os custos, especialmente os de estoque. Além disso, avaliam-se diferentes cenários com variações na capacidade veicular e prazos de entrega.
- 26 March 2026
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Trends in Computational and Applied Mathematics
- Vol. 27 (1) , e01861
Open AccessO Problema Integrado de Produção e Roteamento com Flexibilidade nos Prazos de Entrega
Este artigo investiga o problema integrado de produção, estoque e roteamento com prazos de entrega flexíveis, ou seja, as entregas podem acontecer em um conjunto de períodos, porém sujeitas a penalizações. Para lidar com o problema, desenvolve-se um modelo de otimização linear inteira que flexibiliza os prazos de entrega dos itens demandados. Considera-se um ambiente produtivo com uma única fábrica, capaz de produzir uma quantidade finita de produtos distintos que compartilham recursos produtivos. Há um conjunto de clientes com estoques próprios e uma frota limitada de veículos heterogêneos. Cada veículo realiza no máximo uma rota por período. O objetivo do modelo é determinar o plano de produção, estoque e roteamento que minimize os custos ao longo de um horizonte finito, atendendo às demandas dentro dos períodos possíveis (due dates). Análises considerando um conjunto de instâncias mostram que explorar a flexibilidade nos prazos de entrega pode reduzir significativamente os custos, especialmente os de estoque. Além disso, avaliam-se diferentes cenários com variações na capacidade veicular e prazos de entrega.
- 15 December 2025
- Published by Elsevier in International Journal of Production Economics
- Vol. 293
A modeling and optimization approach to a tactical sugarcane harvest planning problem
- 15 December 2025
- Published by Elsevier in International Journal of Production Economics
- Vol. 293
A modeling and optimization approach to a tactical sugarcane harvest planning problem
- 26 November 2025
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 212
A new formulation for a multi-stage, multilevel batch scheduling problem
- 26 November 2025
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 212
A new formulation for a multi-stage, multilevel batch scheduling problem
- Open Access
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 192906-192919
Efficient Surgical Kit Configuration via MILP and Graph-Based Clustering Heuristics
The formation of surgical kits is essential for efficient resource management in hospitals. This problem involves determining the appropriate items and quantities to ensure that kits meet the demands of surgical procedures without shortages. A key challenge is designing shared kits that fulfill overlapping demands across procedures without including excess items, which may be discarded once deemed contaminated. Unlike existing approaches that allow oversupply, we propose optimization-based methods, including a mixed-integer linear programming model (MILP) and a two-stage heuristic, to minimize surplus in shared kits. The first stage applies a biclique enumeration framework from bipartite graph clustering. Computational experiments using real data from a Brazilian hospital demonstrate that the proposed methods effectively identify shared kit compositions. Although the heuristic yielded lower-quality solutions than the solver for larger instances, it successfully uncovered meaningful patterns that offer valuable insights andwarrant further exploration. In addition, tests conducted with a commercial solver using the proposed mathematical model and the heuristic results as initial solutions revealed alternative solutions with a higher number of shared kits in certain instances.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 192906-192919
Open AccessEfficient Surgical Kit Configuration via MILP and Graph-Based Clustering Heuristics
The formation of surgical kits is essential for efficient resource management in hospitals. This problem involves determining the appropriate items and quantities to ensure that kits meet the demands of surgical procedures without shortages. A key challenge is designing shared kits that fulfill overlapping demands across procedures without including excess items, which may be discarded once deemed contaminated. Unlike existing approaches that allow oversupply, we propose optimization-based methods, including a mixed-integer linear programming model (MILP) and a two-stage heuristic, to minimize surplus in shared kits. The first stage applies a biclique enumeration framework from bipartite graph clustering. Computational experiments using real data from a Brazilian hospital demonstrate that the proposed methods effectively identify shared kit compositions. Although the heuristic yielded lower-quality solutions than the solver for larger instances, it successfully uncovered meaningful patterns that offer valuable insights andwarrant further exploration. In addition, tests conducted with a commercial solver using the proposed mathematical model and the heuristic results as initial solutions revealed alternative solutions with a higher number of shared kits in certain instances.
- 7 November 2024
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (1) , 1-35
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times
- 7 November 2024
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (1) , 1-35
Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times
- 7 August 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (1) , 1-27
Models for two-dimensional bin packing problems with customer order spread
- 7 August 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (1) , 1-27
Models for two-dimensional bin packing problems with customer order spread
- Open Access
- 5 October 2023
- Published by Cambridge University Press (CUP) in Mathematics in Industry Repository
Locomotive maintenance scheduling: optimization approaches and a case study
The Locomotive Maintenance Scheduling Problem arises in the planning and control operations in railroad companies. In this problem, locomotives are parked in yards adjacent to maintenance shops where various maintenance tasks are performed. These shops have limited and specific service stations for each type of maintenance. The goal is to schedule locomotives to service stations aiming at satisfying the locomotive availability targets as well as reducing the backlog for unavailable locomotives by the end of the planning horizon. Despite its practical relevance, this problem has received limited attention in the literature, particularly regarding the development of decision-making tools. To reduce this research gap, we propose mathematical models and a heuristic approach based on the real-world case of MRS Logistics, a Brazilian railroad company. Computational experiments using data provided by the company indicate the effectiveness of the proposed models and heuristic, showing potential improvements for the company's operations
- 5 October 2023
- Published by Cambridge University Press (CUP) in Mathematics in Industry Repository
Open AccessLocomotive maintenance scheduling: optimization approaches and a case study
The Locomotive Maintenance Scheduling Problem arises in the planning and control operations in railroad companies. In this problem, locomotives are parked in yards adjacent to maintenance shops where various maintenance tasks are performed. These shops have limited and specific service stations for each type of maintenance. The goal is to schedule locomotives to service stations aiming at satisfying the locomotive availability targets as well as reducing the backlog for unavailable locomotives by the end of the planning horizon. Despite its practical relevance, this problem has received limited attention in the literature, particularly regarding the development of decision-making tools. To reduce this research gap, we propose mathematical models and a heuristic approach based on the real-world case of MRS Logistics, a Brazilian railroad company. Computational experiments using data provided by the company indicate the effectiveness of the proposed models and heuristic, showing potential improvements for the company's operations
- Open Access
- 31 July 2023
- Published by Cambridge University Press (CUP) in Mathematics in Industry Repository
Foundry planning optimization: a decision support tool for a real-world case
We address the real case of a large-scale market-driven and captive company in Brazil, with a particular focus on the production planning of its foundry sector. The situation involves a wide range of item types produced from different alloy types, and capacitated furnaces and production lines. Given the internal and external demand of each item type over a specific time horizon, the company aims to determine which and how many items to produce and store each day, while minimizing total inventory and the number of setups required. To represent and solve this problem, we introduce a novel optimization model and incorporate it into a decision-support tool. We are not aware of any other solution approach that encompasses all the specificities of the studied company. Computational experiments using real-world data provided by the company indicate that our approach is an effective tool for supporting efficient planning in the foundry sector.
- 31 July 2023
- Published by Cambridge University Press (CUP) in Mathematics in Industry Repository
Open AccessFoundry planning optimization: a decision support tool for a real-world case
We address the real case of a large-scale market-driven and captive company in Brazil, with a particular focus on the production planning of its foundry sector. The situation involves a wide range of item types produced from different alloy types, and capacitated furnaces and production lines. Given the internal and external demand of each item type over a specific time horizon, the company aims to determine which and how many items to produce and store each day, while minimizing total inventory and the number of setups required. To represent and solve this problem, we introduce a novel optimization model and incorporate it into a decision-support tool. We are not aware of any other solution approach that encompasses all the specificities of the studied company. Computational experiments using real-world data provided by the company indicate that our approach is an effective tool for supporting efficient planning in the foundry sector.
- 4 May 2023
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 62 (6) , 1977-1998
Service-level-driven procurement and production lot-sizing problem with demand fulfilment
This paper presents novel models for the Integrated Procurement and Lot-Sizing Problem with multiple customers and backlogging. Since allowing backlog in a traditional cost minimisation model involves dealing with intangible costs of not fulfilling the demand on time, we propose optimising service-levels while keeping the costs minimal using a budget constraint. The motivation of this study emanates from a manufacturing company that assembles commercial and industrial refrigeration equipment, using both purchased materials and in-house products. Instead of considering an aggregate demand, we consider the specific demand from various customers. This allows us to incorporate demand fulfilment decisions into the model in case of stock-outs by deciding which customers will have their orders backlogged. The fill-rate, or β service-level, is considered both globally and for customers and products individually. Computational experiments show that the service-level-driven models improve service when compared to the traditional cost model and also end up enforcing service equity among different customers at the expense of a deterioration in the global fill-rate.
- 4 May 2023
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 62 (6) , 1977-1998
Service-level-driven procurement and production lot-sizing problem with demand fulfilment
This paper presents novel models for the Integrated Procurement and Lot-Sizing Problem with multiple customers and backlogging. Since allowing backlog in a traditional cost minimisation model involves dealing with intangible costs of not fulfilling the demand on time, we propose optimising service-levels while keeping the costs minimal using a budget constraint. The motivation of this study emanates from a manufacturing company that assembles commercial and industrial refrigeration equipment, using both purchased materials and in-house products. Instead of considering an aggregate demand, we consider the specific demand from various customers. This allows us to incorporate demand fulfilment decisions into the model in case of stock-outs by deciding which customers will have their orders backlogged. The fill-rate, or β service-level, is considered both globally and for customers and products individually. Computational experiments show that the service-level-driven models improve service when compared to the traditional cost model and also end up enforcing service equity among different customers at the expense of a deterioration in the global fill-rate.