Source: Engineering Optimization. Unidade: EESC
Subjects: ALGORITMOS, 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
NAGANO, Marcelo Seido e ALMEIDA, Fernando Siqueira de e MIYATA, Hugo Hissashi. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, p. [1-20], 2020Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2020.1797000. Acesso em: 09 set. 2024.APA
Nagano, M. S., Almeida, F. S. de, & Miyata, H. H. (2020). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, [1-20]. doi:10.1080/0305215X.2020.1797000NLM
Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 set. 09 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000Vancouver
Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 set. 09 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000