ReP USP - Resultado da busca

Artigo de periodico
Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? (2025)
Rolim, Gustavo Alencar; Nagano, Marcelo Seido
Source: Computers and Operations Research. Unidade: EESC
Subjects: PESQUISA OPERACIONAL, ALGORITMOS GENÉTICOS, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?. Computers and Operations Research, v. 182, p. 1-15, 2025Tradução . . Disponível em: https://dx.doi.org/10.1016/j.cor.2025.107110. Acesso em: 09 nov. 2025.
APA
Rolim, G. A., & Nagano, M. S. (2025). Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? Computers and Operations Research, 182, 1-15. doi:10.1016/j.cor.2025.107110
NLM
Rolim GA, Nagano MS. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? [Internet]. Computers and Operations Research. 2025 ; 182 1-15.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.1016/j.cor.2025.107110
Vancouver
Rolim GA, Nagano MS. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? [Internet]. Computers and Operations Research. 2025 ; 182 1-15.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.1016/j.cor.2025.107110
Artigo de periodico
A clique covering MIP model for the irregular strip packing problem (2017)
Rodrigues, Marcos Okamura; Toledo, Franklina Maria Bragion de
Source: Computers and Operations Research. Unidade: ICMC
Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RODRIGUES, Marcos Okamura e TOLEDO, Franklina Maria Bragion de. A clique covering MIP model for the irregular strip packing problem. Computers and Operations Research, v. No 2017, p. 221-234, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2016.11.006. Acesso em: 09 nov. 2025.
APA
Rodrigues, M. O., & Toledo, F. M. B. de. (2017). A clique covering MIP model for the irregular strip packing problem. Computers and Operations Research, No 2017, 221-234. doi:10.1016/j.cor.2016.11.006
NLM
Rodrigues MO, Toledo FMB de. A clique covering MIP model for the irregular strip packing problem [Internet]. Computers and Operations Research. 2017 ; No 2017 221-234.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
Vancouver
Rodrigues MO, Toledo FMB de. A clique covering MIP model for the irregular strip packing problem [Internet]. Computers and Operations Research. 2017 ; No 2017 221-234.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
Artigo de periodico
Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (2015)
Furlan, Marcos; Almada-Lobo, Bernardo; Santos, Maristela Oliveira dos ; Morabito, Reinaldo
Source: Computers and Operations Research. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FURLAN, Marcos et al. Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines. Computers and Operations Research, v. 59, p. 33-50, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2014.12.008. Acesso em: 09 nov. 2025.
APA
Furlan, M., Almada-Lobo, B., Santos, M. O. dos, & Morabito, R. (2015). Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines. Computers and Operations Research, 59, 33-50. doi:10.1016/j.cor.2014.12.008
NLM
Furlan M, Almada-Lobo B, Santos MO dos, Morabito R. Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines [Internet]. Computers and Operations Research. 2015 ; 59 33-50.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2014.12.008
Vancouver
Furlan M, Almada-Lobo B, Santos MO dos, Morabito R. Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines [Internet]. Computers and Operations Research. 2015 ; 59 33-50.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2014.12.008
Artigo de periodico
Determining the K-best solutions of knapsack problems (2014)
Leão, Aline Aparecida de Souza; Cherri, Luiz H; Arenales, Marcos Nereu
Source: Computers and Operations Research. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEÃO, Aline Aparecida de Souza e CHERRI, Luiz H e ARENALES, Marcos Nereu. Determining the K-best solutions of knapsack problems. Computers and Operations Research, v. 49, p. 71-82, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2014.03.008. Acesso em: 09 nov. 2025.
APA
Leão, A. A. de S., Cherri, L. H., & Arenales, M. N. (2014). Determining the K-best solutions of knapsack problems. Computers and Operations Research, 49, 71-82. doi:10.1016/j.cor.2014.03.008
NLM
Leão AA de S, Cherri LH, Arenales MN. Determining the K-best solutions of knapsack problems [Internet]. Computers and Operations Research. 2014 ; 49 71-82.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008
Vancouver
Leão AA de S, Cherri LH, Arenales MN. Determining the K-best solutions of knapsack problems [Internet]. Computers and Operations Research. 2014 ; 49 71-82.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008

USP Schools

ReP

Filtros

Authors

Subjects

Indexado em