Maristela Oliveira Santos

Maristela Oliveira Santos

Auto-generated profile, based on publicly available information

Maristela Oliveira Santos

Universidade de São Paulo

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2012 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
MSMaristela Oliveira Santos
Maristela Oliveira Santos
BABernardo Almada-Lobo
Bernardo Almada-Lobo

1 June 2014 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
TBTamara A. Baldo
Tamara A. Baldo
MSMaristela O. Santos
Maristela O. Santos
BABernardo Almada-Lobo
Bernardo Almada-Lobo
RMReinaldo Morabito
Reinaldo Morabito

2 July 2015 in The International Journal of Advanced Manufacturing Technology
Verified
Journal Article
Closed access
PDF file
PMPedro Belluco Macedo
Pedro Belluco Macedo
DADouglas Alem
Douglas Alem
MSMaristela Santos
Maristela Santos
MJMuris Lage Junior
Muris Lage Junior
AMAlfredo Moreno
Alfredo Moreno

1 September 2018 in European Journal of Operational Research
Verified
Journal Article
Closed access
ACArtur Lovato Cunha
Artur Lovato Cunha
MSMaristela Oliveira Santos
Maristela Oliveira Santos
RMReinaldo Morabito
Reinaldo Morabito
ABAna Barbosa-Povoa
Ana Barbosa-Povoa

1 July 2013 in Computers & Operations Research
Verified
Journal Article
Closed access
GFGonçalo Figueira
Gonçalo Figueira
MSMaristela Oliveira Santos
Maristela Oliveira Santos
BABernardo Almada-Lobo
Bernardo Almada-Lobo

3 August 2019 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
WSWilly A. O. Soler
Willy A. O. Soler
MSMaristela O. Santos
Maristela O. Santos
KAKerem Akartunalı
Kerem Akartunalı
This paper addresses a lot sizing and scheduling problem inspired from a real-world production environment apparent in food industry. Due to the scarcity of resources, only a subset of production lines can operate simultaneously, and those lines need to be assembled in each production period. In addition, the products are perishable, and there are often significant sequence-dependent setup times and costs. We first propose a standard mixed integer programming model for the problem, and then a reformulation of the standard model in order to allow us to define a branching rule to accelerate the performance of the branch-and-bound algorithm. We also propose an efficient relax-and-fix procedure that can provide high-quality feasible solutions and competitive dual bounds for the problem. Computational experiments indicate that our approaches provide superior results when benchmarked with a commercial solver and an established relax-and-fix heuristic from the literature.