Vinícius Amaral Armentano

According to our database1, Vinícius Amaral Armentano authored at least 26 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows.
Optim. Lett., 2020

Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows.
Comput. Ind. Eng., 2020

2011
A computational study of parametric tabu search for 0-1 mixed integer programs.
Comput. Oper. Res., 2011

Tabu search with path relinking for an integrated production-distribution problem.
Comput. Oper. Res., 2011

2010
A tabu search procedure for coordinating production, inventory and distribution routing problems.
Int. Trans. Oper. Res., 2010

2009
Tank allocation problems in maritime bulk shipping.
Comput. Oper. Res., 2009

Adaptive granular local search heuristic for a dynamic vehicle routing problem.
Comput. Oper. Res., 2009

2007
Robust optimization models for project scheduling with resource availability cost.
J. Sched., 2007

Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach.
Eur. J. Oper. Res., 2007

2006
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times.
J. Heuristics, 2006

Scatter search for project scheduling with resource availability cost.
Eur. J. Oper. Res., 2006

A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines.
Eur. J. Oper. Res., 2006

2005
Genetic local search for multi-objective flowshop scheduling problems.
Eur. J. Oper. Res., 2005

Metaheuristic Approaches for the Multilevel Resource-Constrained lot-sizing Problem with setup and lead times.
Asia Pac. J. Oper. Res., 2005

2004
A partial enumeration heuristic for multi-objective flowshop scheduling problems.
J. Oper. Res. Soc., 2004

Tardiness minimization in a flexible job shop: A tabu search approach.
J. Intell. Manuf., 2004

An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem.
J. Heuristics, 2004

2001
Lower bounding schemes for flowshops with blocking in-process.
J. Oper. Res. Soc., 2001

A heuristic for single machine scheduling with early and tardy costs.
Eur. J. Oper. Res., 2001

2000
Tabu search for scheduling on identical parallel machines to minimize mean tardiness.
J. Intell. Manuf., 2000

1999
Tabu search for total tardiness minimization in flowshop scheduling problems.
Comput. Oper. Res., 1999

1997
A heuristic method for lot-sizing in multi-stage systems.
Comput. Oper. Res., 1997

1995
The application of valid inequalities to the multi-stage lot-sizing problem.
Comput. Oper. Res., 1995

1994
Multi-item capacitated lot-sizing by a Cross decomposition based algorithm.
Ann. Oper. Res., 1994

Analytic Process of State and its Application in FMS Scheduling.
Proceedings of the Production Management Methods, 1994

1992
Scheduling and Control of AGV Based Material Handling Systems.
Proceedings of the Human Aspects in Computer Integrated Manufacturing, 1992


  Loading...