Filtros : "NAGANO, MARCELO SEIDO" "Inglês" "Springer" Limpar

Filtros



Limitar por data


  • Fonte: 4OR - A Quarterly Journal of Operations Research. Unidade: EESC

    Assuntos: ALGORITMOS, SEQUENCIAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ALMEIDA, Fernando Siqueira de e NAGANO, Marcelo Seido. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times. 4OR - A Quarterly Journal of Operations Research, p. 1-15, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10288-023-00535-7. Acesso em: 09 out. 2024.
    • APA

      Almeida, F. S. de, & Nagano, M. S. (2023). An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times. 4OR - A Quarterly Journal of Operations Research, 1-15. doi:10.1007/s10288-023-00535-7
    • NLM

      Almeida FS de, Nagano MS. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times [Internet]. 4OR - A Quarterly Journal of Operations Research. 2023 ; 1-15.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s10288-023-00535-7
    • Vancouver

      Almeida FS de, Nagano MS. An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times [Internet]. 4OR - A Quarterly Journal of Operations Research. 2023 ; 1-15.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s10288-023-00535-7
  • Fonte: OR Spectrum. Unidade: EESC

    Assuntos: HEURÍSTICA, MANUFATURA, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ROSSI, Fernando Luis e NAGANO, Marcelo Seido. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion. OR Spectrum, p. 1-36, 2022Tradução . . Disponível em: https://doi.org/10.1007/s00291-022-00678-9. Acesso em: 09 out. 2024.
    • APA

      Rossi, F. L., & Nagano, M. S. (2022). Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion. OR Spectrum, 1-36. doi:10.1007/s00291-022-00678-9
    • NLM

      Rossi FL, Nagano MS. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion [Internet]. OR Spectrum. 2022 ; 1-36.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s00291-022-00678-9
    • Vancouver

      Rossi FL, Nagano MS. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion [Internet]. OR Spectrum. 2022 ; 1-36.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s00291-022-00678-9
  • Fonte: Arabian Journal for Science and Engineering. Unidade: EESC

    Assuntos: HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido e PRATA, Bruno de Athayde. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, p. 1-15, 2021Tradução . . Disponível em: https://doi.org/10.1007/s13369-021-06244-9. Acesso em: 09 out. 2024.
    • APA

      Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2021). Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, 1-15. doi:10.1007/s13369-021-06244-9
    • NLM

      Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
    • Vancouver

      Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
  • Fonte: Production Engineering: research and development. Unidade: EESC

    Assuntos: ALGORITMOS GENÉTICOS, SEQUENCIAÇÃO DA PRODUÇÃO

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PINTO, Anderson Rogério Faia e NAGANO, Marcelo Seido. An approach for the solution to order batching and sequencing in picking systems. Production Engineering: research and development, v. 13, p. 325-341, 2019Tradução . . Disponível em: https://doi.org/10.1007/s11740-019-00904-4. Acesso em: 09 out. 2024.
    • APA

      Pinto, A. R. F., & Nagano, M. S. (2019). An approach for the solution to order batching and sequencing in picking systems. Production Engineering: research and development, 13, 325-341. doi:10.1007/s11740-019-00904-4
    • NLM

      Pinto ARF, Nagano MS. An approach for the solution to order batching and sequencing in picking systems [Internet]. Production Engineering: research and development. 2019 ; 13 325-341.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s11740-019-00904-4
    • Vancouver

      Pinto ARF, Nagano MS. An approach for the solution to order batching and sequencing in picking systems [Internet]. Production Engineering: research and development. 2019 ; 13 325-341.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s11740-019-00904-4
  • 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

    PrivadoAcesso à fonteDOIComo citar
    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: 09 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. 09 ] 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. 09 ] Available from: https://doi.org/10.1007/978-3-030-33607-3_3
  • Fonte: Journal of the Brazilian Society of Mechanical Sciences and Engineering. Unidade: EESC

    Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, ALGORITMOS DE SCHEDULING, SISTEMAS DE PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOCCELLIN, João Vitor et al. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, v. 40, n. 1, 2018Tradução . . Disponível em: https://doi.org/10.1007/s40430-018-0980-4. Acesso em: 09 out. 2024.
    • APA

      Moccellin, J. V., Nagano, M. S., Pitombeira Neto, A. R., & Prata, B. de A. (2018). Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 40( 1). doi:10.1007/s40430-018-0980-4
    • NLM

      Moccellin JV, Nagano MS, Pitombeira Neto AR, Prata B de A. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times [Internet]. Journal of the Brazilian Society of Mechanical Sciences and Engineering. 2018 ; 40( 1):[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s40430-018-0980-4
    • Vancouver

      Moccellin JV, Nagano MS, Pitombeira Neto AR, Prata B de A. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times [Internet]. Journal of the Brazilian Society of Mechanical Sciences and Engineering. 2018 ; 40( 1):[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s40430-018-0980-4
  • Fonte: Production Engineering: research and development. Unidade: EESC

    Assuntos: SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      NAGANO, Marcelo Seido e ROSSI, Fernando Luis e TOMAZELLA, Caio Paziani. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop. Production Engineering: research and development, n. 11, p. 523-529, 2017Tradução . . Disponível em: https://doi.org/10.1007/s11740-017-0747-2. Acesso em: 09 out. 2024.
    • APA

      Nagano, M. S., Rossi, F. L., & Tomazella, C. P. (2017). A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop. Production Engineering: research and development, ( 11), 523-529. doi:10.1007/s11740-017-0747-2
    • NLM

      Nagano MS, Rossi FL, Tomazella CP. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop [Internet]. Production Engineering: research and development. 2017 ;( 11): 523-529.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s11740-017-0747-2
    • Vancouver

      Nagano MS, Rossi FL, Tomazella CP. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop [Internet]. Production Engineering: research and development. 2017 ;( 11): 523-529.[citado 2024 out. 09 ] Available from: https://doi.org/10.1007/s11740-017-0747-2
  • Fonte: Decision models in engineering and management. Unidades: FEARP, EESC

    Assuntos: FLUXO DE CAIXA, FINANÇAS, ADMINISTRAÇÃO FINANCEIRA

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MORAES, Marcelo Botelho da Costa e NAGANO, Marcelo Seido e SOBREIRO, Vinicius Amorim. Stochastic cash flow management models:: a literature review since the 1980s. Decision models in engineering and management. Tradução . Cham: Springer, 2015. . Disponível em: https://doi.org/10.1007/978-3-319-11949-6_2. Acesso em: 09 out. 2024.
    • APA

      Moraes, M. B. da C., Nagano, M. S., & Sobreiro, V. A. (2015). Stochastic cash flow management models:: a literature review since the 1980s. In Decision models in engineering and management. Cham: Springer. doi:10.1007/978-3-319-11949-6_2
    • NLM

      Moraes MB da C, Nagano MS, Sobreiro VA. Stochastic cash flow management models:: a literature review since the 1980s [Internet]. In: Decision models in engineering and management. Cham: Springer; 2015. [citado 2024 out. 09 ] Available from: https://doi.org/10.1007/978-3-319-11949-6_2
    • Vancouver

      Moraes MB da C, Nagano MS, Sobreiro VA. Stochastic cash flow management models:: a literature review since the 1980s [Internet]. In: Decision models in engineering and management. Cham: Springer; 2015. [citado 2024 out. 09 ] Available from: https://doi.org/10.1007/978-3-319-11949-6_2

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo     2012 - 2024