default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVinícius Amaral Armentano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j24]Ramon Faganello Fachini, Vinícius Amaral Armentano:
Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows. Comput. Ind. Eng. 148: 106641 (2020)- [j23]Ramon Faganello Fachini
, Vinícius Amaral Armentano:
Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. Optim. Lett. 14(3): 579-609 (2020)
2010 – 2019
- 2011
- [j22]Luís Henrique Sacchi, Vinícius Amaral Armentano:
A computational study of parametric tabu search for 0-1 mixed integer programs. Comput. Oper. Res. 38(2): 464-473 (2011) - [j21]Vinícius Amaral Armentano, André Luís Shiguemoto, Arne Løkketangen:
Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38(8): 1199-1209 (2011) - 2010
- [j20]André Luís Shiguemoto, Vinícius Amaral Armentano:
A tabu search procedure for coordinating production, inventory and distribution routing problems. Int. Trans. Oper. Res. 17(2): 179-195 (2010)
2000 – 2009
- 2009
- [j19]Rodrigo Moretti Branchini, Vinícius Amaral Armentano, Arne Løkketangen:
Adaptive granular local search heuristic for a dynamic vehicle routing problem. Comput. Oper. Res. 36(11): 2955-2968 (2009) - [j18]Lars Magnus Hvattum, Kjetil Fagerholt, Vinícius Amaral Armentano:
Tank allocation problems in maritime bulk shipping. Comput. Oper. Res. 36(11): 3051-3060 (2009) - 2007
- [j17]Vinícius Amaral Armentano, Moacir Felizardo de França Filho:
Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach. Eur. J. Oper. Res. 183(1): 100-114 (2007) - [j16]Denise Sato Yamashita, Vinícius Amaral Armentano, Manuel Laguna:
Robust optimization models for project scheduling with resource availability cost. J. Sched. 10(1): 67-76 (2007) - 2006
- [j15]Denise Sato Yamashita, Vinícius Amaral Armentano, Manuel Laguna:
Scatter search for project scheduling with resource availability cost. Eur. J. Oper. Res. 169(2): 623-637 (2006) - [j14]Franklina Maria Bragion Toledo, Vinícius Amaral Armentano:
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur. J. Oper. Res. 175(2): 1070-1083 (2006) - [j13]Vinícius Amaral Armentano, Olinto César Bassi de Araújo:
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. J. Heuristics 12(6): 427-446 (2006) - 2005
- [j12]Regina Berretta, Paulo Morelato França, Vinícius Amaral Armentano:
Metaheuristic Approaches for the Multilevel Resource-Constrained lot-sizing Problem with setup and lead times. Asia Pac. J. Oper. Res. 22(2): 261-286 (2005) - [j11]José Elias Claudio Arroyo, Vinícius Amaral Armentano:
Genetic local search for multi-objective flowshop scheduling problems. Eur. J. Oper. Res. 167(3): 717-738 (2005) - 2004
- [j10]Vinícius Amaral Armentano, José Elias Claudio Arroyo:
An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem. J. Heuristics 10(5): 463-481 (2004) - [j9]Cintia Rigão Scrich, Vinícius Amaral Armentano, Manuel Laguna:
Tardiness minimization in a flexible job shop: A tabu search approach. J. Intell. Manuf. 15(1): 103-115 (2004) - [j8]José Elias Claudio Arroyo, Vinícius Amaral Armentano:
A partial enumeration heuristic for multi-objective flowshop scheduling problems. J. Oper. Res. Soc. 55(9): 1000-1007 (2004) - 2001
- [j7]Renata Mazzini, Vinícius Amaral Armentano:
A heuristic for single machine scheduling with early and tardy costs. Eur. J. Oper. Res. 128(1): 129-146 (2001) - [j6]Débora P. Ronconi, Vinícius Amaral Armentano:
Lower bounding schemes for flowshops with blocking in-process. J. Oper. Res. Soc. 52(11): 1289-1297 (2001) - 2000
- [j5]Vinícius Amaral Armentano, Denise Sato Yamashita:
Tabu search for scheduling on identical parallel machines to minimize mean tardiness. J. Intell. Manuf. 11(5): 453-460 (2000)
1990 – 1999
- 1999
- [j4]Vinícius Amaral Armentano, Débora P. Ronconi:
Tabu search for total tardiness minimization in flowshop scheduling problems. Comput. Oper. Res. 26(3): 219-235 (1999) - 1997
- [j3]Paulo Morelato França, Vinícius Amaral Armentano, Regina Berretta, Alistair Richard Clark:
A heuristic method for lot-sizing in multi-stage systems. Comput. Oper. Res. 24(9): 861-874 (1997) - 1995
- [j2]Alistair Richard Clark, Vinícius Amaral Armentano:
The application of valid inequalities to the multi-stage lot-sizing problem. Comput. Oper. Res. 22(7): 669-680 (1995) - 1994
- [j1]Kleber X. X. De Souza, Vinícius Amaral Armentano:
Multi-item capacitated lot-sizing by a Cross decomposition based algorithm. Ann. Oper. Res. 50(1): 557-574 (1994) - [c2]X.-B. Wu, Vinícius Amaral Armentano:
Analytic Process of State and its Application in FMS Scheduling. Production Management Methods 1994: 271-278 - 1992
- [c1]X.-B. Wu, Vinícius Amaral Armentano:
Scheduling and Control of AGV Based Material Handling Systems. PROLAMAT 1992: 729-736
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-28 23:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
