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
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
Source: Computers and Operations Research. Unidade: EESC
Subjects: 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
Source: 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

USP Schools

ReP

Filtros

Subjects

Funding Agencies