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: 31 ago. 2024.
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 2024 ago. 31 ] 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 2024 ago. 31 ] 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: 31 ago. 2024.
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 2024 ago. 31 ] 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 2024 ago. 31 ] 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: 31 ago. 2024.
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 2024 ago. 31 ] 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 2024 ago. 31 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001
Artigo de periodico
A branch and bound method in a permutation flow shop with blocking and setup times (2022)
Nagano, Marcelo Seido ; Takano, Mauricio Iwama ; Robazzi, João Vitor Silva
Fonte: International Journal of Industrial Engineering Computations. Unidade: EESC
Assunto: 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 TAKANO, Mauricio Iwama e ROBAZZI, João Vitor Silva. A branch and bound method in a permutation flow shop with blocking and setup times. International Journal of Industrial Engineering Computations, v. 13, p. 255-266, 2022Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2021.10.003. Acesso em: 31 ago. 2024.
APA
Nagano, M. S., Takano, M. I., & Robazzi, J. V. S. (2022). A branch and bound method in a permutation flow shop with blocking and setup times. International Journal of Industrial Engineering Computations, 13, 255-266. doi:10.5267/j.ijiec.2021.10.003
NLM
Nagano MS, Takano MI, Robazzi JVS. A branch and bound method in a permutation flow shop with blocking and setup times [Internet]. International Journal of Industrial Engineering Computations. 2022 ; 13 255-266.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2021.10.003
Vancouver
Nagano MS, Takano MI, Robazzi JVS. A branch and bound method in a permutation flow shop with blocking and setup times [Internet]. International Journal of Industrial Engineering Computations. 2022 ; 13 255-266.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2021.10.003
Artigo de periodico
Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance (2021)
Yamada, Tuane Tonani; Nagano, Marcelo Seido ; Miyata, Hugo Hissashi
Fonte: International Journal of Industrial Engineering Computations. Unidade: EESC
Assuntos: SISTEMAS DE PRODUÇÃO, PROGRAMAÇÃO DA PRODUÇÃO, MANUTENÇÃO PREVENTIVA, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
YAMADA, Tuane Tonani e NAGANO, Marcelo Seido e MIYATA, Hugo Hissashi. Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. International Journal of Industrial Engineering Computations, v. 12, p. 415-426, 2021Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2021.5.002. Acesso em: 31 ago. 2024.
APA
Yamada, T. T., Nagano, M. S., & Miyata, H. H. (2021). Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. International Journal of Industrial Engineering Computations, 12, 415-426. doi:10.5267/j.ijiec.2021.5.002
NLM
Yamada TT, Nagano MS, Miyata HH. Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance [Internet]. International Journal of Industrial Engineering Computations. 2021 ; 12 415-426.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2021.5.002
Vancouver
Yamada TT, Nagano MS, Miyata HH. Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance [Internet]. International Journal of Industrial Engineering Computations. 2021 ; 12 415-426.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2021.5.002
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: 31 ago. 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 ago. 31 ] 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 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2019.11.002
Artigo de periodico
Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times (2019)
Takano, Mauricio Iwama ; Nagano, Marcelo Seido
Fonte: International Journal of Industrial Engineering Computations. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, TEMPO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAKANO, Mauricio Iwama e NAGANO, Marcelo Seido. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times. International Journal of Industrial Engineering Computations, v. 10, p. 37-50, 2019Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2018.5.002. Acesso em: 31 ago. 2024.
APA
Takano, M. I., & Nagano, M. S. (2019). Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times. International Journal of Industrial Engineering Computations, 10, 37-50. doi:10.5267/j.ijiec.2018.5.002
NLM
Takano MI, Nagano MS. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times [Internet]. International Journal of Industrial Engineering Computations. 2019 ; 10 37-50.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2018.5.002
Vancouver
Takano MI, Nagano MS. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times [Internet]. International Journal of Industrial Engineering Computations. 2019 ; 10 37-50.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2018.5.002
Artigo de periodico
A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem (2011)
Araújo, Daniella Castro; Nagano, Marcelo Seido
Fonte: International Journal of Industrial Computations. Unidade: EESC
Assuntos: HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO (DURAÇÃO)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Daniella Castro e NAGANO, Marcelo Seido. A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem. International Journal of Industrial Computations, v. 2, p. 155-166, 2011Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2010.05.003. Acesso em: 31 ago. 2024.
APA
Araújo, D. C., & Nagano, M. S. (2011). A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem. International Journal of Industrial Computations, 2, 155-166. doi:10.5267/j.ijiec.2010.05.003
NLM
Araújo DC, Nagano MS. A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem [Internet]. International Journal of Industrial Computations. 2011 ; 2 155-166.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2010.05.003
Vancouver
Araújo DC, Nagano MS. A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem [Internet]. International Journal of Industrial Computations. 2011 ; 2 155-166.[citado 2024 ago. 31 ] Available from: https://doi.org/10.5267/j.ijiec.2010.05.003

Unidades USP

ReP

Filtros

Autores

Ano de publicação

Assuntos