Filtros : "ENGENHARIA DE PRODUCAO" "Instituto Federal de Educação Ciência e Tecnologia de São Paulo. Araraquara, SP." Removidos: "ICB-BMP" "ARRUDA JUNIOR, OLINTO RODRIGUES DE" Limpar

Filtros



Refine with date range


  • 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: 08 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. 08 ] 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. 08 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
  • 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: 08 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. 08 ] 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. 08 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163

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