Maristela Oliveira Santos

Orcid: 0000-0003-0822-3439

According to our database1, Maristela Oliveira Santos authored at least 22 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:



Service-level-driven procurement and production lot-sizing problem with demand fulfilment.
Int. J. Prod. Res., March, 2024

Matheuristic for the lot-sizing and scheduling problem in integrated pulp and paper production.
Comput. Ind. Eng., 2024

A Memetic Algorithm for the multi-product Production Routing Problem.
Comput. Ind. Eng., August, 2023

Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks.
Int. J. Prod. Res., May, 2023

Safety-Stock: Predicting the demand for supplies in Brazilian hospitals during the COVID-19 pandemic.
Knowl. Based Syst., 2022

A mixed integer programming model and solution method for the operation of an integrated water supply system.
Int. Trans. Oper. Res., 2022

Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources.
RAIRO Oper. Res., 2021

MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products.
J. Oper. Res. Soc., 2021

Models for the two-dimensional level strip packing problem - a review and a computational evaluation.
J. Oper. Res. Soc., 2020

Meta-heuristics for the one-dimensional cutting stock problem with usable leftover.
J. Heuristics, 2020

Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems.
Eur. J. Oper. Res., 2020

Parallel local search algorithms for high school timetabling problems.
Eur. J. Oper. Res., 2018

An integrated approach for production lot sizing and raw material purchasing.
Eur. J. Oper. Res., 2018

Clustering-Based Search in a Memetic Algorithm for the Vehicle Routing Problem with Time Windows.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem.
J. Intell. Manuf., 2017

Clustering-Based Crossover in an Evolutionary Algorithm for the Vehicle Routing Problem with Time Windows.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines.
Comput. Oper. Res., 2015

An optimization approach for the lot sizing and scheduling problem in the brewery industry.
Comput. Ind. Eng., 2014

A hybrid VNS approach for the short-term production planning and scheduling: A case study in the pulp and paper industry.
Comput. Oper. Res., 2013

Integrated pulp and paper mill planning and scheduling.
Comput. Ind. Eng., 2012

The constrained compartmentalized knapsack problem: mathematical models and solution methods.
Eur. J. Oper. Res., 2011

Infeasibility handling in genetic algorithm using nested domains for production planning.
Comput. Oper. Res., 2010