Filtros : "ENGENHARIA DE PRODUCAO" "HEURÍSTICA" Removidos: "EEFE-EFB" "Brasil" "er" Limpar

Filtros



Refine with date range


  • Source: International Journal of Industrial Engineering Computations. Unidade: EESC

    Subjects: SISTEMAS DE PRODUÇÃO, PROGRAMAÇÃO DA PRODUÇÃO, MANUTENÇÃO PREVENTIVA, HEURÍSTICA

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 02 jul. 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 jul. 02 ] 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 jul. 02 ] Available from: https://doi.org/10.5267/j.ijiec.2021.5.002
  • Source: Computers & Industrial Engineering. Unidade: EESC

    Subjects: SCHEDULING, ALGORITMOS GENÉTICOS, HEURÍSTICA

    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, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2021.107337. Acesso em: 02 jul. 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. 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[citado 2024 jul. 02 ] 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[citado 2024 jul. 02 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
  • Source: Expert Systems with Applications: an international journal. Unidade: EESC

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

    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 for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. Expert Systems with Applications: an international journal, v. 125, p. 40-54, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2019.01.057. Acesso em: 02 jul. 2024.
    • APA

      Rossi, F. L., & Nagano, M. S. (2019). Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. Expert Systems with Applications: an international journal, 125, 40-54. doi:10.1016/j.eswa.2019.01.057
    • NLM

      Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion [Internet]. Expert Systems with Applications: an international journal. 2019 ; 125 40-54.[citado 2024 jul. 02 ] Available from: https://doi.org/10.1016/j.eswa.2019.01.057
    • Vancouver

      Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion [Internet]. Expert Systems with Applications: an international journal. 2019 ; 125 40-54.[citado 2024 jul. 02 ] Available from: https://doi.org/10.1016/j.eswa.2019.01.057
  • Source: Computers & Industrial Engineering. Unidade: EESC

    Subjects: HEURÍSTICA, SCHEDULING, SEQUENCIAÇÃO DA PRODUÇÃO, MANUTENÇÃO PREVENTIVA

    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 e GUPTA, Jatinder N. D. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Computers & Industrial Engineering, v. 135, p. Se 2019, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2019.05.034. Acesso em: 02 jul. 2024.
    • APA

      Miyata, H. H., Nagano, M. S., & Gupta, J. N. D. (2019). Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Computers & Industrial Engineering, 135, Se 2019. doi:10.1016/j.cie.2019.05.034
    • NLM

      Miyata HH, Nagano MS, Gupta JND. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization [Internet]. Computers & Industrial Engineering. 2019 ; 135 Se 2019.[citado 2024 jul. 02 ] Available from: https://doi.org/10.1016/j.cie.2019.05.034
    • Vancouver

      Miyata HH, Nagano MS, Gupta JND. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization [Internet]. Computers & Industrial Engineering. 2019 ; 135 Se 2019.[citado 2024 jul. 02 ] Available from: https://doi.org/10.1016/j.cie.2019.05.034
  • Source: International Journal of Industrial Engineering Computations. Unidade: EESC

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

    Versão PublicadaAcesso à fonteDOIHow to cite
    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: 02 jul. 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 jul. 02 ] 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 jul. 02 ] Available from: https://doi.org/10.5267/j.ijiec.2018.5.002
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: MANUTENÇÃO PREVENTIVA, HEURÍSTICA, SCHEDULING

    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 e GUPTAB, Jatinder N. D. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, v. 51, n. 4, 2018Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1485903. Acesso em: 02 jul. 2024.
    • APA

      Miyata, H. H., Nagano, M. S., & Guptab, J. N. D. (2018). Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, 51( 4). doi:10.1080/0305215X.2018.1485903
    • NLM

      Miyata HH, Nagano MS, Guptab JND. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study [Internet]. Engineering Optimization. 2018 ; 51( 4):[citado 2024 jul. 02 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903
    • Vancouver

      Miyata HH, Nagano MS, Guptab JND. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study [Internet]. Engineering Optimization. 2018 ; 51( 4):[citado 2024 jul. 02 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: HEURÍSTICA, SCHEDULING

    Versão PublicadaAcesso à fonteDOIHow to cite
    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 MARTARELLI, Nádia Junqueira. High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, v. 51, n. 2, 2018Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1444163. Acesso em: 02 jul. 2024.
    • APA

      Nagano, M. S., Rossi, F. L., & Martarelli, N. J. (2018). High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, 51( 2). doi:10.1080/0305215X.2018.1444163
    • NLM

      Nagano MS, Rossi FL, Martarelli NJ. High-performing heuristics to minimize flowtime in no-idle permutation flowshop [Internet]. Engineering Optimization. 2018 ; 51( 2):[citado 2024 jul. 02 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163
    • Vancouver

      Nagano MS, Rossi FL, Martarelli NJ. High-performing heuristics to minimize flowtime in no-idle permutation flowshop [Internet]. Engineering Optimization. 2018 ; 51( 2):[citado 2024 jul. 02 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163
  • Source: Production Engineering: research and development. Unidade: EESC

    Subjects: SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA 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 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: 02 jul. 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 jul. 02 ] 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 jul. 02 ] Available from: https://doi.org/10.1007/s11740-017-0747-2
  • Source: The International Journal of Advanced Manufacturing Technology. Unidade: EESC

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

    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 e SAGAWA, Juliana Keiko. An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion. The International Journal of Advanced Manufacturing Technology, v. 90, p. 93-107, 2017Tradução . . Disponível em: https://doi.org/10.1007/s00170-016-9347-0. Acesso em: 02 jul. 2024.
    • APA

      Rossi, F. L., Nagano, M. S., & Sagawa, J. K. (2017). An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion. The International Journal of Advanced Manufacturing Technology, 90, 93-107. doi:10.1007/s00170-016-9347-0
    • NLM

      Rossi FL, Nagano MS, Sagawa JK. An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion [Internet]. The International Journal of Advanced Manufacturing Technology. 2017 ; 90 93-107.[citado 2024 jul. 02 ] Available from: https://doi.org/10.1007/s00170-016-9347-0
    • Vancouver

      Rossi FL, Nagano MS, Sagawa JK. An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion [Internet]. The International Journal of Advanced Manufacturing Technology. 2017 ; 90 93-107.[citado 2024 jul. 02 ] Available from: https://doi.org/10.1007/s00170-016-9347-0

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