Source: Journal of Project Management. Unidade: EESC
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO
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: 08 jan. 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.001NLM
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 jan. 08 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001Vancouver
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 jan. 08 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001