Olinto CESAR BASSI Araujo

Prof. Dr. Olinto CESAR BASSI Araujo

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 December 2014 in Computers & Operations Research
Verified
Journal Article
Closed access
ÁDÁrton P. Dorneles
Árton P. Dorneles
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
LBLuciana S. Buriol
Luciana S. Buriol

1 October 2015 in Electric Power Systems Research
Verified
Journal Article
Closed access
RCRafael Corrêa
Rafael Corrêa
GCGhendy Cardoso
Ghendy Cardoso
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
LMLenois Mariotto
Lenois Mariotto

24 June 2014 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
FSFernando Stefanello
Fernando Stefanello
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
FMFelipe Muller
Felipe Muller

16 January 2018 in International Journal of Production Research
Verified
Journal Article
Open access
RTRenan Spencer Trindade
Renan Spencer Trindade
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
MFMarcia Fampa
Marcia Fampa
FMFelipe Muller
Felipe Muller
Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping jobs in batches and scheduling them on machines. We consider problems where jobs have non-identical sizes and processing times, and the total size of each batch cannot exceed the machine capacity. The processing time of a batch is defined as the longest processing time among all jobs assigned to it. Jobs can also have non-identical release times, and in this case, a batch can only be processed when all jobs assigned to it are available. This paper discusses four different versions of batch scheduling problems, considering a single processing machine or parallel processing machines and considering jobs with or without release times. New mixed integer linear programming formulations are proposed as enhancements of formulations proposed in the literature, and symmetry breaking constraints are investigated to reduce the size of the feasible sets. Computational results show that the proposed formulations have a better performance than other models in the literature, being able to solve to optimality instances only considered before to be solved by heuristic procedures.

1 August 2007 in Pesquisa Operacional
Verified
Journal Article
Open access
PDF file
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
VAVinícius Amaral Armentano
Vinícius Amaral Armentano
This paper deals with the container loading problem which involves the selection of a subset of boxes, each box with a given volume, such that they fit in a single container and maximize its volume utilization subject to orientation and stability constraints. We propose a multi-start random constructive heuristic with a load arrangement that is based on maximal cuboids that fit in given empty spaces. Each instance is adaptively evaluated by a set of criteria, and at each step of the construction process one maximal cuboid is chosen probabilistically from a restricted list of candidates. In order to enhance the flexibility in the construction of a solution, a probabilistic reduction on such cuboids is allowed. Computational tests on several instances from the literature show that the proposed method performs better than other approaches.

1 October 2021 in Computers & Operations Research
Verified
Journal Article
Closed access
RTRenan Spencer Trindade
Renan Spencer Trindade
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
MFMarcia Fampa
Marcia Fampa