Menu

Filtros : "Indexado no Web of Science" "2023" "NAGANO, MARCELO SEIDO" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Artigo de periodico

    A Rolling Horizon scheme for rescheduling in agricultural harvest (2023)

    Santos, Fernando Montenegro dos; Pérez Galarce, Francisco; Monardes Concha, Carlos; Candia Vejar, Alfredo; Nagano, Marcelo Seido ; Gómez Lagos, Javier

    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: 14 set. 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 set. 14 ] 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 set. 14 ] Available from: https://doi.org/10.1016/j.compag.2023.108392

  • Artigo de periodico

    An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (2023)

    Almeida, Fernando Siqueira de ; Nagano, Marcelo Seido

    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: 14 set. 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 set. 14 ] 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 set. 14 ] Available from: https://doi.org/10.1007/s10288-023-00535-7

  • Artigo de periodico

    Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (2023)

    Rolim, Gustavo Alencar; Nagano, Marcelo Seido ; Prata, Bruno de Athayde

    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: 14 set. 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 set. 14 ] 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 set. 14 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
  • 1

1 - 3 (3 records)

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