André Renato Sales Amaral

Orcid: 0000-0001-7344-3994

According to our database1, André Renato Sales Amaral authored at least 28 papers between 2001 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Adaptive iterated local search for the parallel row ordering problem.
Expert Syst. Appl., 2022

A heuristic approach for the double row layout problem.
Ann. Oper. Res., 2022

2021
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order.
Optim. Lett., 2021

Lexicographic optimization-based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem.
Int. Trans. Oper. Res., 2021

Otimização por Enxame de Partículas híbrido de duas fases Aplicado o Problema de Layout em Linha Dupla.
Inteligencia Artif., 2021

Simulated Annealing and Iterated Local Search Approaches to the Aircraft Refueling Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

2020
An improved model for the parallel row ordering problem.
J. Oper. Res. Soc., 2020

An Iterated Local Search for the Multi-objective Dial-a-Ride Problem.
Proceedings of the Intelligent Systems Design and Applications, 2020

A Solution Approach to The Problem of Nesting Rectangles with Arbitrary Rotations into Containers of Irregular Convex and Non-Convex Shapes.
Proceedings of the Computational Logistics - 11th International Conference, 2020

2019
An improved mixed-integer programming model for the double row layout of facilities.
Optim. Lett., 2019

A mixed-integer programming formulation for the double row layout of machines in manufacturing systems.
Int. J. Prod. Res., 2019

A GRASP algorithm for solving large-scale single row facility layout problems.
Comput. Oper. Res., 2019

2018
A simulated annealing metaheuristic for the bi-objective flexible job shop scheduling problem.
Proceedings of the 2018 IEEE International Conference on Research in Intelligent and Computing in Engineering, 2018

A Hybrid Iterated Local Search Metaheuristic for the Flexible job Shop Scheduling Problem.
Proceedings of the XLIV Latin American Computer Conference, 2018

A Clustering Search Metaheuristic for the Bi-objective Flexible Job Shop Scheduling Problem.
Proceedings of the XLIV Latin American Computer Conference, 2018

2014
Simulated annealing and tabu search approaches for the Corridor Allocation Problem.
Eur. J. Oper. Res., 2014

2013
Optimal solutions for the double row layout problem.
Optim. Lett., 2013

A polyhedral approach to the single row facility layout problem.
Math. Program., 2013

A parallel ordering problem in facilities layout.
Comput. Oper. Res., 2013

2012
The corridor allocation problem.
Comput. Oper. Res., 2012

2011
Single row facility layout problem using a permutation-based genetic algorithm.
Eur. J. Oper. Res., 2011

2009
A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem.
Optim. Lett., 2009

A new lower bound for the single row facility layout problem.
Discret. Appl. Math., 2009

2008
An Exact Approach to the One-Dimensional Facility Layout Problem.
Oper. Res., 2008

A New Lower Bound for the Minimum Linear Arrangement of a Graph.
Electron. Notes Discret. Math., 2008

2007
An efficient approach for large scale graph partitioning.
J. Comb. Optim., 2007

2006
On the exact solution of a facility layout problem.
Eur. J. Oper. Res., 2006

2001
Analysis of upper bounds for the Pallet Loading Problem.
Eur. J. Oper. Res., 2001


  Loading...