ReP USP - Resultado da busca

Artigo de periodico
Evaluating procedures in the NEH heuristic for the PFSP - SIST (2024)
Laurentys, Clarissa Tararam de; Nagano, Marcelo Seido
Fonte: Journal of Project Management. Unidade: EESC
Assuntos: HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO, SEQUENCIAÇÃO DA PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LAURENTYS, Clarissa Tararam de e NAGANO, Marcelo Seido. Evaluating procedures in the NEH heuristic for the PFSP - SIST. Journal of Project Management, v. 9, n. 1, p. 17-26, 2024Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2023.11.001. Acesso em: 09 nov. 2025.
APA
Laurentys, C. T. de, & Nagano, M. S. (2024). Evaluating procedures in the NEH heuristic for the PFSP - SIST. Journal of Project Management, 9( 1), 17-26. doi:10.5267/j.jpm.2023.11.001
NLM
Laurentys CT de, Nagano MS. Evaluating procedures in the NEH heuristic for the PFSP - SIST [Internet]. Journal of Project Management. 2024 ; 9( 1): 17-26.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.11.001
Vancouver
Laurentys CT de, Nagano MS. Evaluating procedures in the NEH heuristic for the PFSP - SIST [Internet]. Journal of Project Management. 2024 ; 9( 1): 17-26.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.11.001
Artigo de periodico
A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time (2024)
Nagano, Marcelo Seido ; Rossi, Fernando Luis
Fonte: Journal of Project Management. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAGANO, Marcelo Seido e ROSSI, Fernando Luis. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time. Journal of Project Management, v. 9, n. 1, p. 45-60, 2024Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2023.9.001. Acesso em: 09 nov. 2025.
APA
Nagano, M. S., & Rossi, F. L. (2024). A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time. Journal of Project Management, 9( 1), 45-60. doi:10.5267/j.jpm.2023.9.001
NLM
Nagano MS, Rossi FL. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Journal of Project Management. 2024 ; 9( 1): 45-60.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001
Vancouver
Nagano MS, Rossi FL. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Journal of Project Management. 2024 ; 9( 1): 45-60.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001
Artigo de periodico
Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times (2023)
Souza, Edson Antonio Gonçalves de; Nagano, Marcelo Seido ; Miyata, Hugo Hissashi; Abreu, Levi Ribeiro de
Fonte: Journal of Project Management. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, PROGRAMAÇÃO DINÂMICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOUZA, Edson Antonio Gonçalves de et al. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times. Journal of Project Management, v. 8, n. 2, p. 99-118, 2023Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2022.12.001. Acesso em: 09 nov. 2025.
APA
Souza, E. A. G. de, Nagano, M. S., Miyata, H. H., & Abreu, L. R. de. (2023). Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times. Journal of Project Management, 8( 2), 99-118. doi:10.5267/j.jpm.2022.12.001
NLM
Souza EAG de, Nagano MS, Miyata HH, Abreu LR de. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times [Internet]. Journal of Project Management. 2023 ; 8( 2): 99-118.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001
Vancouver
Souza EAG de, Nagano MS, Miyata HH, Abreu LR de. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times [Internet]. Journal of Project Management. 2023 ; 8( 2): 99-118.[citado 2025 nov. 09 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001

Unidades USP

ReP

Filtros

Autores