Filtros : "NAGANO, MARCELO SEIDO" "Indexado no Scopus" Removido: "2007" Limpar

Filtros



Refine with date range


  • Source: Computers and Electronics in Agriculture. Unidade: EESC

    Subjects: COLHEITA, COLHEDORAS, ENGENHARIA DE PRODUÇÃO

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

      SANTOS, Fernando Montenegro dos et al. A Rolling Horizon scheme for rescheduling in agricultural harvest. Computers and Electronics in Agriculture, v. 215, p. 1-15, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.compag.2023.108392. Acesso em: 17 out. 2024.
    • APA

      Santos, F. M. dos, Pérez Galarce, F., Monardes Concha, C., Candia Vejar, A., Nagano, M. S., & Gómez Lagos, J. (2023). A Rolling Horizon scheme for rescheduling in agricultural harvest. Computers and Electronics in Agriculture, 215, 1-15. doi:10.1016/j.compag.2023.108392
    • NLM

      Santos FM dos, Pérez Galarce F, Monardes Concha C, Candia Vejar A, Nagano MS, Gómez Lagos J. A Rolling Horizon scheme for rescheduling in agricultural harvest [Internet]. Computers and Electronics in Agriculture. 2023 ; 215 1-15.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.compag.2023.108392
    • Vancouver

      Santos FM dos, Pérez Galarce F, Monardes Concha C, Candia Vejar A, Nagano MS, Gómez Lagos J. A Rolling Horizon scheme for rescheduling in agricultural harvest [Internet]. Computers and Electronics in Agriculture. 2023 ; 215 1-15.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.compag.2023.108392
  • Source: 4OR - A Quarterly Journal of Operations Research. Unidade: EESC

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

    PrivadoAcesso à fonteDOIHow to cite
    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: 17 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. 17 ] 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. 17 ] Available from: https://doi.org/10.1007/s10288-023-00535-7
  • Source: Computers and Operations Research. Unidade: EESC

    Subjects: BENCHMARKS, HEURÍSTICA, SEMICONDUTORES, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    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. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, v. 153, p. 1-18, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2023.106159. Acesso em: 17 out. 2024.
    • APA

      Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2023). Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, 153, 1-18. doi:10.1016/j.cor.2023.106159
    • NLM

      Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
    • Vancouver

      Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
  • Source: Computers and Operations Research. Unidade: EESC

    Assunto: ENGENHARIA DE PRODUÇÃO

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

      ABREU, Levi Ribeiro de et al. New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, v. 142, p. 1-21, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2022.105744. Acesso em: 17 out. 2024.
    • APA

      Abreu, L. R. de, Prata, B. de A., Framinan, J. M., & Nagano, M. S. (2022). New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, 142, 1-21. doi:10.1016/j.cor.2022.105744
    • NLM

      Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
    • Vancouver

      Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
  • Source: Swarm and Evolutionary Computation. Unidade: EESC

    Subjects: INDÚSTRIA FARMACÊUTICA, CONTATOS COM CLIENTES, ALGORITMOS GENÉTICOS, ENGENHARIA DE PRODUÇÃO

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

      ABREU, Levi Ribeiro de et al. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, v. 75, p. 1-13, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2022.101149. Acesso em: 17 out. 2024.
    • APA

      Abreu, L. R. de, Prata, B. de A., Gomes, A. C., Santos, S. A. B., & Nagano, M. S. (2022). A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, 75, 1-13. doi:10.1016/j.swevo.2022.101149
    • NLM

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149
    • Vancouver

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149
  • Source: Journal of the Operational Research Society. Unidade: EESC

    Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    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. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, p. 1-12, 2022Tradução . . Disponível em: https://doi.org/10.1080/01605682.2022.2039569. Acesso em: 17 out. 2024.
    • APA

      Almeida, F. S. de, & Nagano, M. S. (2022). Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, 1-12. doi:10.1080/01605682.2022.2039569
    • NLM

      Almeida FS de, Nagano MS. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2022 ; 1-12.[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/01605682.2022.2039569
    • Vancouver

      Almeida FS de, Nagano MS. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2022 ; 1-12.[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/01605682.2022.2039569
  • Source: Expert Systems with Applications. Unidade: EESC

    Subjects: PROGRAMAÇÃO DINÂMICA, PESQUISA, ENGENHARIA DE PRODUÇÃO

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

      SOUZA, Edson Antonio Gonçalves de e NAGANO, Marcelo Seido e ROLIM, Gustavo Alencar. Dynamic Programming algorithms and their applications in machine scheduling: a review. Expert Systems with Applications, v. 190, p. 1-35, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2021.116180. Acesso em: 17 out. 2024.
    • APA

      Souza, E. A. G. de, Nagano, M. S., & Rolim, G. A. (2022). Dynamic Programming algorithms and their applications in machine scheduling: a review. Expert Systems with Applications, 190, 1-35. doi:10.1016/j.eswa.2021.116180
    • NLM

      Souza EAG de, Nagano MS, Rolim GA. Dynamic Programming algorithms and their applications in machine scheduling: a review [Internet]. Expert Systems with Applications. 2022 ; 190 1-35.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.eswa.2021.116180
    • Vancouver

      Souza EAG de, Nagano MS, Rolim GA. Dynamic Programming algorithms and their applications in machine scheduling: a review [Internet]. Expert Systems with Applications. 2022 ; 190 1-35.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.eswa.2021.116180
  • Source: VINE Journal of Information and Knowledge Management Systems. Unidade: EESC

    Subjects: GESTÃO DO CONHECIMENTO, DESEMPENHO ORGANIZACIONAL, COOPERAÇÃO UNIVERSIDADE-EMPRESA, ENGENHARIA DE PRODUÇÃO

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

      RIBEIRO, Suzana Xavier e NAGANO, Marcelo Seido. On the relation between knowledge management and university-industry-government collaboration in Brazilian national institutes of science and technology. VINE Journal of Information and Knowledge Management Systems, p. 1-22, 2021Tradução . . Disponível em: https://doi.org/10.1108/VJIKMS-01-2020-0002. Acesso em: 17 out. 2024.
    • APA

      Ribeiro, S. X., & Nagano, M. S. (2021). On the relation between knowledge management and university-industry-government collaboration in Brazilian national institutes of science and technology. VINE Journal of Information and Knowledge Management Systems, 1-22. doi:10.1108/VJIKMS-01-2020-0002
    • NLM

      Ribeiro SX, Nagano MS. On the relation between knowledge management and university-industry-government collaboration in Brazilian national institutes of science and technology [Internet]. VINE Journal of Information and Knowledge Management Systems. 2021 ; 1-22.[citado 2024 out. 17 ] Available from: https://doi.org/10.1108/VJIKMS-01-2020-0002
    • Vancouver

      Ribeiro SX, Nagano MS. On the relation between knowledge management and university-industry-government collaboration in Brazilian national institutes of science and technology [Internet]. VINE Journal of Information and Knowledge Management Systems. 2021 ; 1-22.[citado 2024 out. 17 ] Available from: https://doi.org/10.1108/VJIKMS-01-2020-0002
  • Source: Journal of Manufacturing Systems. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, QUALIDADE DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO

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

      MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido. Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, v. 61, p. 592-612, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.jmsy.2021.10.005. Acesso em: 17 out. 2024.
    • APA

      Miyata, H. H., & Nagano, M. S. (2021). Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, 61, 592-612. doi:10.1016/j.jmsy.2021.10.005
    • NLM

      Miyata HH, Nagano MS. Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm [Internet]. Journal of Manufacturing Systems. 2021 ; 61 592-612.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.jmsy.2021.10.005
    • Vancouver

      Miyata HH, Nagano MS. Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm [Internet]. Journal of Manufacturing Systems. 2021 ; 61 592-612.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.jmsy.2021.10.005
  • Source: Computers & Industrial Engineering. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, ALGORITMOS DE SCHEDULING, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    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 and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Computers & Industrial Engineering, v. 157, p. 1-16, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2021.107337. Acesso em: 17 out. 2024.
    • APA

      Rossi, F. L., & Nagano, M. S. (2021). Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Computers & Industrial Engineering, 157, 1-16. doi:10.1016/j.cie.2021.107337
    • NLM

      Rossi FL, Nagano MS. Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times [Internet]. Computers & Industrial Engineering. 2021 ; 157 1-16.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
    • Vancouver

      Rossi FL, Nagano MS. Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times [Internet]. Computers & Industrial Engineering. 2021 ; 157 1-16.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
  • Source: Swarm and Evolutionary Computation. Unidade: EESC

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

    PrivadoAcesso à fonteDOIHow to cite
    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 and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation. Swarm and Evolutionary Computation, v. 55, p. 1-19, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2020.100689. Acesso em: 17 out. 2024.
    • APA

      Rossi, F. L., & Nagano, M. S. (2020). Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation. Swarm and Evolutionary Computation, 55, 1-19. doi:10.1016/j.swevo.2020.100689
    • NLM

      Rossi FL, Nagano MS. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation [Internet]. Swarm and Evolutionary Computation. 2020 ; 55 1-19.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2020.100689
    • Vancouver

      Rossi FL, Nagano MS. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation [Internet]. Swarm and Evolutionary Computation. 2020 ; 55 1-19.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2020.100689
  • Source: Computers & Industrial Engineering. Unidades: EESC, ICMC

    Subjects: PROGRAMAÇÃO MATEMÁTICA, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    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: 17 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. 17 ] 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. 17 ] Available from: https://doi.org/10.1016/j.cie.2020.106511
  • Source: Computers & Industrial Engineering. Unidade: EESC

    Subjects: CONTROLE DA PRODUÇÃO, JUST IN TIME, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    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: 17 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. 17 ] 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. 17 ] Available from: https://doi.org/10.1016/j.cie.2020.106803
  • Source: Journal of the Operational Research Society. Unidade: EESC

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

    Acesso à fonteDOIHow to cite
    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: 17 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. 17 ] 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. 17 ] Available from: https://doi.org/10.1080/01605682.2019.1671149
  • Source: Journal of Manufacturing Systems. Unidade: EESC

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

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

      NAGANO, Marcelo Seido e MIYATA, Hugo Hissashi e ARAÚJO, Daniella Castro. A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times. Journal of Manufacturing Systems, v. 36, p. 224-230, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.jmsy.2014.06.007. Acesso em: 17 out. 2024.
    • APA

      Nagano, M. S., Miyata, H. H., & Araújo, D. C. (2015). A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times. Journal of Manufacturing Systems, 36, 224-230. doi:10.1016/j.jmsy.2014.06.007
    • NLM

      Nagano MS, Miyata HH, Araújo DC. A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times [Internet]. Journal of Manufacturing Systems. 2015 ; 36 224-230.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.jmsy.2014.06.007
    • Vancouver

      Nagano MS, Miyata HH, Araújo DC. A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times [Internet]. Journal of Manufacturing Systems. 2015 ; 36 224-230.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.jmsy.2014.06.007
  • Source: The International Journal of Human Resource Management. Unidades: FEARP, EESC

    Subjects: ADMINISTRAÇÃO DE RECURSOS HUMANOS, ADMINISTRAÇÃO ESTRATÉGICA, MUDANÇA ORGANIZACIONAL, OBJETIVOS ORGANIZACIONAIS, MEIO AMBIENTE

    Acesso à fonteAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      JABBOUR, Charbel José Chiappetta e SANTOS, Fernando César Almada e NAGANO, Marcelo Seido. Contributions of HRM throughout the stages of environmental management: methodological triangulation applied to companies in Brazil. The International Journal of Human Resource Management, v. 21, n. 7, p. 1049-1089, 2010Tradução . . Disponível em: https://doi.org/10.1080/09585191003783512. Acesso em: 17 out. 2024.
    • APA

      Jabbour, C. J. C., Santos, F. C. A., & Nagano, M. S. (2010). Contributions of HRM throughout the stages of environmental management: methodological triangulation applied to companies in Brazil. The International Journal of Human Resource Management, 21( 7), 1049-1089. doi:10.1080/09585191003783512
    • NLM

      Jabbour CJC, Santos FCA, Nagano MS. Contributions of HRM throughout the stages of environmental management: methodological triangulation applied to companies in Brazil [Internet]. The International Journal of Human Resource Management. 2010 ; 21( 7): 1049-1089.[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/09585191003783512
    • Vancouver

      Jabbour CJC, Santos FCA, Nagano MS. Contributions of HRM throughout the stages of environmental management: methodological triangulation applied to companies in Brazil [Internet]. The International Journal of Human Resource Management. 2010 ; 21( 7): 1049-1089.[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/09585191003783512

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024