ReP USP - Resultado da busca

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
Fonte: Engineering Optimization. Unidade: EESC
Assuntos: 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: 07 out. 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 out. 07 ] 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 out. 07 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000
Artigo de periodico
An improved lower bound for the blocking permutation flow shop with total completion time criterion (2020)
Nagano, Marcelo Seido ; Robazzi, João Vitor Silva; Tomazella, Caio Paziani
Fonte: Computers & Industrial Engineering. Unidades: EESC, ICMC
Assuntos: PROGRAMAÇÃO MATEMÁTICA, 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 ROBAZZI, João Vitor Silva e TOMAZELLA, Caio Paziani. An improved lower bound for the blocking permutation flow shop with total completion time criterion. Computers & Industrial Engineering, v. 146, p. 1-5, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2020.106511. Acesso em: 07 out. 2024.
APA
Nagano, M. S., Robazzi, J. V. S., & Tomazella, C. P. (2020). An improved lower bound for the blocking permutation flow shop with total completion time criterion. Computers & Industrial Engineering, 146, 1-5. doi:10.1016/j.cie.2020.106511
NLM
Nagano MS, Robazzi JVS, Tomazella CP. An improved lower bound for the blocking permutation flow shop with total completion time criterion [Internet]. Computers & Industrial Engineering. 2020 ; 146 1-5.[citado 2024 out. 07 ] Available from: https://doi.org/10.1016/j.cie.2020.106511
Vancouver
Nagano MS, Robazzi JVS, Tomazella CP. An improved lower bound for the blocking permutation flow shop with total completion time criterion [Internet]. Computers & Industrial Engineering. 2020 ; 146 1-5.[citado 2024 out. 07 ] Available from: https://doi.org/10.1016/j.cie.2020.106511
Artigo de periodico
Solving the permutation flow shop problem with blocking and setup time constraints (2020)
Takano, Mauricio Iwama; Nagano, Marcelo Seido
Fonte: International Journal of Industrial Engineering Computations. Unidade: EESC
Assuntos: PROGRAMAÇÃO MATEMÁTICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAKANO, Mauricio Iwama e NAGANO, Marcelo Seido. Solving the permutation flow shop problem with blocking and setup time constraints. International Journal of Industrial Engineering Computations, v. 11, p. 469-480, 2020Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2019.11.002. Acesso em: 07 out. 2024.
APA
Takano, M. I., & Nagano, M. S. (2020). Solving the permutation flow shop problem with blocking and setup time constraints. International Journal of Industrial Engineering Computations, 11, 469-480. doi:10.5267/j.ijiec.2019.11.002
NLM
Takano MI, Nagano MS. Solving the permutation flow shop problem with blocking and setup time constraints [Internet]. International Journal of Industrial Engineering Computations. 2020 ; 11 469-480.[citado 2024 out. 07 ] Available from: https://doi.org/10.5267/j.ijiec.2019.11.002
Vancouver
Takano MI, Nagano MS. Solving the permutation flow shop problem with blocking and setup time constraints [Internet]. International Journal of Industrial Engineering Computations. 2020 ; 11 469-480.[citado 2024 out. 07 ] Available from: https://doi.org/10.5267/j.ijiec.2019.11.002
Artigo de periodico
Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review (2020)
Rolim, Gustavo Alencar; Nagano, Marcelo Seido
Fonte: Computers & Industrial Engineering. Unidade: EESC
Assuntos: CONTROLE DA PRODUÇÃO, JUST IN TIME, 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. Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review. Computers & Industrial Engineering, v. No 2020, p. 1-30, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2020.106803. Acesso em: 07 out. 2024.
APA
Rolim, G. A., & Nagano, M. S. (2020). Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review. Computers & Industrial Engineering, No 2020, 1-30. doi:10.1016/j.cie.2020.106803
NLM
Rolim GA, Nagano MS. Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review [Internet]. Computers & Industrial Engineering. 2020 ; No 2020 1-30.[citado 2024 out. 07 ] Available from: https://doi.org/10.1016/j.cie.2020.106803
Vancouver
Rolim GA, Nagano MS. Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review [Internet]. Computers & Industrial Engineering. 2020 ; No 2020 1-30.[citado 2024 out. 07 ] Available from: https://doi.org/10.1016/j.cie.2020.106803
Artigo de periodico
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times (2019)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Fonte: Journal of the Operational Research Society. Unidade: EESC
Assuntos: HEURÍSTICA, 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
ROSSI, Fernando Luis e NAGANO, Marcelo Seido. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. Journal of the Operational Research Society, 2019Tradução . . Disponível em: https://doi.org/10.1080/01605682.2019.1671149. Acesso em: 07 out. 2024.
APA
Rossi, F. L., & Nagano, M. S. (2019). Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. Journal of the Operational Research Society. doi:10.1080/01605682.2019.1671149
NLM
Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2019 ;[citado 2024 out. 07 ] Available from: https://doi.org/10.1080/01605682.2019.1671149
Vancouver
Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2019 ;[citado 2024 out. 07 ] Available from: https://doi.org/10.1080/01605682.2019.1671149
Trabalho de evento-anais periodico
Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm (2019)
Martarelli, Nádia Junqueira; Nagano, Marcelo Seido
Fonte: Lecture Notes in Computer Science. Nome do evento: International Conference on Intelligent Data Engineering and Automated Learning - IDEAL. Unidade: EESC
Assuntos: ALGORITMOS GENÉTICOS, XXX
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTARELLI, Nádia Junqueira e NAGANO, Marcelo Seido. Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm. Lecture Notes in Computer Science. Cham, Switzerland: Springer. Disponível em: https://doi.org/10.1007/978-3-030-33607-3_3. Acesso em: 07 out. 2024. , 2019
APA
Martarelli, N. J., & Nagano, M. S. (2019). Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm. Lecture Notes in Computer Science. Cham, Switzerland: Springer. doi:10.1007/978-3-030-33607-3_3
NLM
Martarelli NJ, Nagano MS. Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm [Internet]. Lecture Notes in Computer Science. 2019 ; 11871 20-27.[citado 2024 out. 07 ] Available from: https://doi.org/10.1007/978-3-030-33607-3_3
Vancouver
Martarelli NJ, Nagano MS. Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm [Internet]. Lecture Notes in Computer Science. 2019 ; 11871 20-27.[citado 2024 out. 07 ] Available from: https://doi.org/10.1007/978-3-030-33607-3_3

Unidades USP

ReP

Filtros

Autores

Assuntos

Indexado em