Filtros : "NAGANO, MARCELO SEIDO" "SCHEDULING" Removido: "2022" Limpar

Filtros



Refine with date range


  • Source: IFAC Journal of Systems and Control. Unidade: EESC

    Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, HEURÍSTICA, 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

      NAGANO, Marcelo Seido e JUNQUEIRA, Viviane Souza Vilela e ROSSI, Fernando Luis. An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times. IFAC Journal of Systems and Control, v. 29, p. 1-10, 2024Tradução . . Disponível em: https://dx.doi.org/10.1016/j.ifacsc.2024.100279. Acesso em: 16 set. 2024.
    • APA

      Nagano, M. S., Junqueira, V. S. V., & Rossi, F. L. (2024). An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times. IFAC Journal of Systems and Control, 29, 1-10. doi:10.1016/j.ifacsc.2024.100279
    • NLM

      Nagano MS, Junqueira VSV, Rossi FL. An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times [Internet]. IFAC Journal of Systems and Control. 2024 ; 29 1-10.[citado 2024 set. 16 ] Available from: https://dx.doi.org/10.1016/j.ifacsc.2024.100279
    • Vancouver

      Nagano MS, Junqueira VSV, Rossi FL. An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times [Internet]. IFAC Journal of Systems and Control. 2024 ; 29 1-10.[citado 2024 set. 16 ] Available from: https://dx.doi.org/10.1016/j.ifacsc.2024.100279
  • 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: 16 set. 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 set. 16 ] 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 set. 16 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
  • 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: 16 set. 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 set. 16 ] 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 set. 16 ] Available from: https://doi.org/10.1016/j.cie.2019.05.034
  • Source: Expert Systems with Applications: an international journal. Unidade: EESC

    Subjects: SCHEDULING, FLUXOGRAMA, LOJAS

    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. The blocking flow shop scheduling problem: a comprehensive and conceptual review. Expert Systems with Applications: an international journal, v. 135, p. 130-156, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2019.06.069. Acesso em: 16 set. 2024.
    • APA

      Miyata, H. H., & Nagano, M. S. (2019). The blocking flow shop scheduling problem: a comprehensive and conceptual review. Expert Systems with Applications: an international journal, 135, 130-156. doi:10.1016/j.eswa.2019.06.069
    • NLM

      Miyata HH, Nagano MS. The blocking flow shop scheduling problem: a comprehensive and conceptual review [Internet]. Expert Systems with Applications: an international journal. 2019 ; 135 130-156.[citado 2024 set. 16 ] Available from: https://doi.org/10.1016/j.eswa.2019.06.069
    • Vancouver

      Miyata HH, Nagano MS. The blocking flow shop scheduling problem: a comprehensive and conceptual review [Internet]. Expert Systems with Applications: an international journal. 2019 ; 135 130-156.[citado 2024 set. 16 ] Available from: https://doi.org/10.1016/j.eswa.2019.06.069
  • Source: Swarm and Evolutionary Computation. Unidade: EESC

    Subjects: SCHEDULING, ALGORITMOS DE SCHEDULING, HEURÍSTICA

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

      TAVARES NETO, Roberto Fernandes e NAGANO, Marcelo Seido. An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle. Swarm and Evolutionary Computation, v. 44, p. 612-621, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2018.08.001. Acesso em: 16 set. 2024.
    • APA

      Tavares Neto, R. F., & Nagano, M. S. (2019). An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle. Swarm and Evolutionary Computation, 44, 612-621. doi:10.1016/j.swevo.2018.08.001
    • NLM

      Tavares Neto RF, Nagano MS. An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle [Internet]. Swarm and Evolutionary Computation. 2019 ; 44 612-621.[citado 2024 set. 16 ] Available from: https://doi.org/10.1016/j.swevo.2018.08.001
    • Vancouver

      Tavares Neto RF, Nagano MS. An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle [Internet]. Swarm and Evolutionary Computation. 2019 ; 44 612-621.[citado 2024 set. 16 ] Available from: https://doi.org/10.1016/j.swevo.2018.08.001
  • 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: 16 set. 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 set. 16 ] 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 set. 16 ] 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: 16 set. 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 set. 16 ] 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 set. 16 ] 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: 16 set. 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 set. 16 ] 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 set. 16 ] Available from: https://doi.org/10.1007/s11740-017-0747-2
  • Source: Journal of the Operational Research Society. Unidades: FEARP, EESC

    Subjects: HEURÍSTICA, SCHEDULING

    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 MOCCELLIN, João Vitor. A high quality solution constructive heuristic for flow shop sequencing. Journal of the Operational Research Society, v. 53, p. 1374-1379, 2002Tradução . . Disponível em: https://doi.org/10.1057/palgrave.jors.2601466. Acesso em: 16 set. 2024.
    • APA

      Nagano, M. S., & Moccellin, J. V. (2002). A high quality solution constructive heuristic for flow shop sequencing. Journal of the Operational Research Society, 53, 1374-1379. doi:10.1057/palgrave.jors.2601466
    • NLM

      Nagano MS, Moccellin JV. A high quality solution constructive heuristic for flow shop sequencing [Internet]. Journal of the Operational Research Society. 2002 ; 53 1374-1379.[citado 2024 set. 16 ] Available from: https://doi.org/10.1057/palgrave.jors.2601466
    • Vancouver

      Nagano MS, Moccellin JV. A high quality solution constructive heuristic for flow shop sequencing [Internet]. Journal of the Operational Research Society. 2002 ; 53 1374-1379.[citado 2024 set. 16 ] Available from: https://doi.org/10.1057/palgrave.jors.2601466

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