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
Fonte: Computers and Operations Research. Unidade: EESC
Assuntos: 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
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (2023)
Rolim, Gustavo Alencar; Nagano, Marcelo Seido ; Prata, Bruno de Athayde
Fonte: Computers and Operations Research. Unidade: EESC
Assuntos: BENCHMARKS, HEURÍSTICA, SEMICONDUTORES, 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 e PRATA, Bruno de Athayde. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, v. 153, p. 1-18, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2023.106159. Acesso em: 09 nov. 2025.
APA
Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2023). Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, 153, 1-18. doi:10.1016/j.cor.2023.106159
NLM
Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
Vancouver
Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
Artigo de periodico
New efficient heuristics for scheduling open shops with makespan minimization (2022)
Abreu, Levi Ribeiro de; Prata, Bruno de Athayde; Framinan, José Manuel; Nagano, Marcelo Seido
Fonte: Computers and Operations Research. Unidade: EESC
Assunto: ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ABREU, Levi Ribeiro de et al. New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, v. 142, p. 1-21, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2022.105744. Acesso em: 09 nov. 2025.
APA
Abreu, L. R. de, Prata, B. de A., Framinan, J. M., & Nagano, M. S. (2022). New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, 142, 1-21. doi:10.1016/j.cor.2022.105744
NLM
Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
Vancouver
Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
Artigo de periodico
An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (2021)
Ferreira, Kamyla Maria ; Queiroz, Thiago Alves de ; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: EFEITO ESTUFA, MODELOS MATEMÁTICOS, EMBALAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Kamyla Maria e QUEIROZ, Thiago Alves de e TOLEDO, Franklina Maria Bragion de. An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Computers and Operations Research, v. 136, p. 1-27, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2021.105452. Acesso em: 09 nov. 2025.
APA
Ferreira, K. M., Queiroz, T. A. de, & Toledo, F. M. B. de. (2021). An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Computers and Operations Research, 136, 1-27. doi:10.1016/j.cor.2021.105452
NLM
Ferreira KM, Queiroz TA de, Toledo FMB de. An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery [Internet]. Computers and Operations Research. 2021 ; 136 1-27.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2021.105452
Vancouver
Ferreira KM, Queiroz TA de, Toledo FMB de. An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery [Internet]. Computers and Operations Research. 2021 ; 136 1-27.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2021.105452
Artigo de periodico
Exact approaches for the cutting path determination problem (2019)
Silva, Everton Fernandes da ; Oliveira, Larissa Tebaldi de ; Oliveira, José Fernando ; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: CORTE, PRODUÇÃO INDUSTRIAL, ALGORITMOS ÚTEIS E ESPECÍFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Everton Fernandes da et al. Exact approaches for the cutting path determination problem. Computers and Operations Research, v. 112, p. 1-14, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2019.104772. Acesso em: 09 nov. 2025.
APA
Silva, E. F. da, Oliveira, L. T. de, Oliveira, J. F., & Toledo, F. M. B. de. (2019). Exact approaches for the cutting path determination problem. Computers and Operations Research, 112, 1-14. doi:10.1016/j.cor.2019.104772
NLM
Silva EF da, Oliveira LT de, Oliveira JF, Toledo FMB de. Exact approaches for the cutting path determination problem [Internet]. Computers and Operations Research. 2019 ; 112 1-14.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2019.104772
Vancouver
Silva EF da, Oliveira LT de, Oliveira JF, Toledo FMB de. Exact approaches for the cutting path determination problem [Internet]. Computers and Operations Research. 2019 ; 112 1-14.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2019.104772
Artigo de periodico
A clique covering MIP model for the irregular strip packing problem (2017)
Rodrigues, Marcos Okamura; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: 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

Unidades USP

ReP

Filtros

Autores

Autores USP

Ano de publicação

Assuntos

Agência de fomento

Indexado em