V
Vinícius Amaral Armentano
Researcher at State University of Campinas
Publications - 60
Citations - 2030
Vinícius Amaral Armentano is an academic researcher from State University of Campinas. The author has contributed to research in topics: Tardiness & Tabu search. The author has an hindex of 25, co-authored 59 publications receiving 1918 citations. Previous affiliations of Vinícius Amaral Armentano include University of Manchester.
Papers
More filters
Journal ArticleDOI
Genetic local search for multi-objective flowshop scheduling problems
TL;DR: A genetic local search algorithm with features such as preservation of dispersion in the population, elitism, and use of a parallel multi-objective local search so as intensify the search in distinct regions is proposed.
Journal ArticleDOI
Tabu search with path relinking for an integrated production-distribution problem
TL;DR: Two tabu search variants are proposed for the problem of integrating production and distribution planning over periods of a finite horizon, one that involves construction and a short-term memory and one that incorporates a longer term memory used to integrate a path relinking procedure to the first variant.
Journal ArticleDOI
Tabu search for total tardiness minimization in flowshop scheduling problems
TL;DR: This work addresses the permutation flowshop scheduling problem with the objective of minimizing total tardiness and investigates the application of tabu search to this problem in order to obtain better solutions in a reasonable time.
Journal ArticleDOI
Scatter search for project scheduling with resource availability cost
TL;DR: This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relations among the activities, and develops simple multi-start heuristics.
Journal ArticleDOI
Tardiness minimization in a flexible job shop: A tabu search approach
TL;DR: This paper addresses the problem of scheduling jobs in a flexible job shop with the objective of minimizing total tardiness by developing two heuristics based on tabu search: a hierarchical procedure and a multiple start procedure.