default search action
Thiago Henrique Nogueira
Person information
- affiliation: Federal University of Viçosa, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Thiago Henrique Nogueira, Felipe Provezano Coutinho, Maria Gabriela Mendonça Peixoto, Eduardo Gontijo Carrano, Martín Gómez Ravetti:
Evolutionary algorithm framework for optimizing truck scheduling in multi-dock truck cross-docking centers. Evol. Intell. 18(1): 2 (2025) - 2022
- [j9]Priscila M. Cota, Thiago Henrique Nogueira, Angel A. Juan, Martín Gómez Ravetti:
Integrating vehicle scheduling and open routing decisions in a cross-docking center with multiple docks. Comput. Ind. Eng. 164: 107869 (2022) - [j8]Fernanda F. Alves, Thiago Henrique Nogueira, Martín Gómez Ravetti:
Learning algorithms to deal with failures in production planning. Comput. Ind. Eng. 169: 108231 (2022) - [j7]Thiago Henrique Nogueira, Helena Ramalhinho Dias Lourenço, Carlos Roberto Venâncio de Carvalho, Martín Gómez Ravetti:
A hybrid VNS-Lagrangean heuristic framework applied on single machine scheduling problem with sequence-dependent setup times, release dates and due dates. Optim. Lett. 16(1): 59-78 (2022) - [c2]Matheus de Freitas Araujo, José Elias Claudio Arroyo, Thiago Henrique Nogueira:
Heuristics Assisted by Machine Learning for the Integrated Production Planning and Distribution Problem. ISDA (4) 2022: 120-131 - 2021
- [j6]Fernanda F. Alves, Thiago Henrique Nogueira, Maurício C. de Souza, Martín Gómez Ravetti:
Approaches for the joint resolution of lot-sizing and scheduling with infeasibilities occurrences. Comput. Ind. Eng. 155: 107176 (2021) - [c1]Victor Hugo Vidigal Corrêa, André Gustavo dos Santos, Thiago Henrique Nogueira:
Strategies for Electric Location-routing Problems Considering Short and Long Term Horizons. ICEIS (1) 2021: 795-802 - 2020
- [j5]Thiago Henrique Nogueira, Felipe Provezano Coutinho, Rafael Pereira Ribeiro, Martín Gómez Ravetti:
Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center. Comput. Ind. Eng. 143: 106391 (2020) - [j4]Thiago Henrique Nogueira, Amanda Bimbato Bettoni, Gustavo Tiradentes de Oliveira Mendes, André Gustavo dos Santos, Martín Gómez Ravetti:
Problem on the integration between production and delivery with parallel batching machines of generic job sizes and processing times. Comput. Ind. Eng. 146: 106573 (2020)
2010 – 2019
- 2019
- [j3]Gabriela B. Fonseca, Thiago Henrique Nogueira, Martín Gómez Ravetti:
A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem. Eur. J. Oper. Res. 275(1): 139-154 (2019) - 2016
- [j2]Priscila M. Cota, Bárbara M. R. Gimenez, Dhiego P. M. Araújo, Thiago Henrique Nogueira, Maurício C. de Souza, Martín Gómez Ravetti:
Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre. Comput. Ind. Eng. 95: 135-143 (2016) - 2015
- [j1]Thiago Henrique Nogueira, Carlos Roberto Venâncio de Carvalho, Gabriel Pinheiro Alves Santos, Larissa Cristina de Camargo:
Mathematical model applied to single-track line scheduling problem in Brazilian railways. 4OR 13(4): 403-441 (2015)
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 2024-12-11 21:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint