ReP USP - Resultado da busca

Artigo de periodico
A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (2022)
Abreu, Levi Ribeiro de; Araújo, Kennedy Anderson Guimarães; Prata, Bruno de Athayde; Nagano, Marcelo Seido ; Moccellin, João Vitor
Source: Engineering Optimization. Unidades: EESC, IME
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. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, v. 54, n. 9, p. 1563-1582, 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2021.1957101. Acesso em: 27 set. 2024.
APA
Abreu, L. R. de, Araújo, K. A. G., Prata, B. de A., Nagano, M. S., & Moccellin, J. V. (2022). A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, 54( 9), 1563-1582. doi:10.1080/0305215X.2021.1957101
NLM
Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 set. 27 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
Vancouver
Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 set. 27 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
Artigo de periodico
A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (2022)
Prata, Bruno de Athayde; Nagano, Marcelo Seido
Source: Engineering Optimization. Unidade: EESC
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, SCHEDULING, ALGORITMOS DE SCHEDULING, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRATA, Bruno de Athayde e NAGANO, Marcelo Seido. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, p. [1-15], 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2022.2144274. Acesso em: 27 set. 2024.
APA
Prata, B. de A., & Nagano, M. S. (2022). A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, [1-15]. doi:10.1080/0305215X.2022.2144274
NLM
Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 set. 27 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
Vancouver
Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 set. 27 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
Artigo de periodico
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (2020)
Nagano, Marcelo Seido ; Almeida, Fernando Siqueira de; Miyata, Hugo Hissashi
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: 27 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.1797000
NLM
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. 27 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000
Vancouver
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. 27 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000

USP Schools

ReP

Filtros

Authors