Menu

Filtros : "EESC-SEP" "PROGRAMAÇÃO DA PRODUÇÃO" Removido: "Indexado no: Open Access Digital Library" Limpar

Filtros

Refine with date range

1 - 20 (64 records)

  • Artigo de periodico

    Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? (2025)

    Rolim, Gustavo Alencar; Nagano, Marcelo Seido

    Source: Computers and Operations Research. Unidade: EESC

    Subjects: PESQUISA OPERACIONAL, ALGORITMOS GENÉTICOS, PROGRAMAÇÃ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

      ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?. Computers and Operations Research, v. 182, p. 1-15, 2025Tradução . . Disponível em: https://dx.doi.org/10.1016/j.cor.2025.107110. Acesso em: 28 nov. 2025.

    • APA

      Rolim, G. A., & Nagano, M. S. (2025). Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? Computers and Operations Research, 182, 1-15. doi:10.1016/j.cor.2025.107110

    • NLM

      Rolim GA, Nagano MS. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? [Internet]. Computers and Operations Research. 2025 ; 182 1-15.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.1016/j.cor.2025.107110

    • Vancouver

      Rolim GA, Nagano MS. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? [Internet]. Computers and Operations Research. 2025 ; 182 1-15.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.1016/j.cor.2025.107110

  • Artigo de periodico

    Evaluating procedures in the NEH heuristic for the PFSP - SIST (2024)

    Laurentys, Clarissa Tararam de; Nagano, Marcelo Seido

    Source: Journal of Project Management. Unidade: EESC

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

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

    • ABNT

      LAURENTYS, Clarissa Tararam de e NAGANO, Marcelo Seido. Evaluating procedures in the NEH heuristic for the PFSP - SIST. Journal of Project Management, v. 9, n. 1, p. 17-26, 2024Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2023.11.001. Acesso em: 28 nov. 2025.

    • APA

      Laurentys, C. T. de, & Nagano, M. S. (2024). Evaluating procedures in the NEH heuristic for the PFSP - SIST. Journal of Project Management, 9( 1), 17-26. doi:10.5267/j.jpm.2023.11.001

    • NLM

      Laurentys CT de, Nagano MS. Evaluating procedures in the NEH heuristic for the PFSP - SIST [Internet]. Journal of Project Management. 2024 ; 9( 1): 17-26.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.11.001

    • Vancouver

      Laurentys CT de, Nagano MS. Evaluating procedures in the NEH heuristic for the PFSP - SIST [Internet]. Journal of Project Management. 2024 ; 9( 1): 17-26.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.11.001

  • Artigo de periodico

    Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis (2024)

    Prata, Bruno de Athayde; Abreu, Levi Ribeiro de; Nagano, Marcelo Seido

    Source: Results in Control and Optimization. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, INTELIGÊNCIA ARTIFICIAL, BIBLIOMETRIA

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

    • ABNT

      PRATA, Bruno de Athayde e ABREU, Levi Ribeiro de e NAGANO, Marcelo Seido. Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis. Results in Control and Optimization, v. 14, p. 1-17, 2024Tradução . . Disponível em: http://dx.doi.org/10.1016/j.rico.2023.100350. Acesso em: 28 nov. 2025.

    • APA

      Prata, B. de A., Abreu, L. R. de, & Nagano, M. S. (2024). Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis. Results in Control and Optimization, 14, 1-17. doi:10.1016/j.rico.2023.100350

    • NLM

      Prata B de A, Abreu LR de, Nagano MS. Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis [Internet]. Results in Control and Optimization. 2024 ; 14 1-17.[citado 2025 nov. 28 ] Available from: http://dx.doi.org/10.1016/j.rico.2023.100350

    • Vancouver

      Prata B de A, Abreu LR de, Nagano MS. Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis [Internet]. Results in Control and Optimization. 2024 ; 14 1-17.[citado 2025 nov. 28 ] Available from: http://dx.doi.org/10.1016/j.rico.2023.100350

  • Artigo de periodico

    A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time (2024)

    Nagano, Marcelo Seido ; Rossi, Fernando Luis

    Source: Journal of Project Management. Unidade: EESC

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

    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. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time. Journal of Project Management, v. 9, n. 1, p. 45-60, 2024Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2023.9.001. Acesso em: 28 nov. 2025.

    • APA

      Nagano, M. S., & Rossi, F. L. (2024). A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time. Journal of Project Management, 9( 1), 45-60. doi:10.5267/j.jpm.2023.9.001

    • NLM

      Nagano MS, Rossi FL. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Journal of Project Management. 2024 ; 9( 1): 45-60.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001

    • Vancouver

      Nagano MS, Rossi FL. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Journal of Project Management. 2024 ; 9( 1): 45-60.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001

  • Artigo de periodico

    Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times (2023)

    Souza, Edson Antonio Gonçalves de; Nagano, Marcelo Seido ; Miyata, Hugo Hissashi; Abreu, Levi Ribeiro de

    Source: Journal of Project Management. Unidade: EESC

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

    Versão PublicadaAcesso à 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 et al. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times. Journal of Project Management, v. 8, n. 2, p. 99-118, 2023Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2022.12.001. Acesso em: 28 nov. 2025.

    • APA

      Souza, E. A. G. de, Nagano, M. S., Miyata, H. H., & Abreu, L. R. de. (2023). Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times. Journal of Project Management, 8( 2), 99-118. doi:10.5267/j.jpm.2022.12.001

    • NLM

      Souza EAG de, Nagano MS, Miyata HH, Abreu LR de. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times [Internet]. Journal of Project Management. 2023 ; 8( 2): 99-118.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001

    • Vancouver

      Souza EAG de, Nagano MS, Miyata HH, Abreu LR de. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times [Internet]. Journal of Project Management. 2023 ; 8( 2): 99-118.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001

  • Artigo de periodico

    A new two-stage constraint programming approach for open shop scheduling problem with machine blocking (2022)

    Abreu, Levi R.; Nagano, Marcelo Seido ; Prata, Bruno A.

    Source: International Journal of Production Research. Unidade: EESC

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

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

    • ABNT

      ABREU, Levi R. e NAGANO, Marcelo Seido e PRATA, Bruno A. A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. International Journal of Production Research, 2022Tradução . . Disponível em: https://doi.org/10.1080/00207543.2022.2154404. Acesso em: 28 nov. 2025.

    • APA

      Abreu, L. R., Nagano, M. S., & Prata, B. A. (2022). A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. International Journal of Production Research. doi:10.1080/00207543.2022.2154404

    • NLM

      Abreu LR, Nagano MS, Prata BA. A new two-stage constraint programming approach for open shop scheduling problem with machine blocking [Internet]. International Journal of Production Research. 2022 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/00207543.2022.2154404

    • Vancouver

      Abreu LR, Nagano MS, Prata BA. A new two-stage constraint programming approach for open shop scheduling problem with machine blocking [Internet]. International Journal of Production Research. 2022 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/00207543.2022.2154404

  • Trabalho de evento-resumo

    Heurística ALNS para problemas de programação de no-wait flowshop mistos (2022)

    Verzelloni, João Victor Pascualote ; Nagano, Marcelo Seido

    Source: Livro de Resumos Expandidos. Conference titles: Simpósio Internacional de Iniciação Científica e Tecnológica da Universidade de São Paulo - SIICUSP. Unidade: EESC

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

    Versão PublicadaAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      VERZELLONI, João Victor Pascualote e NAGANO, Marcelo Seido. Heurística ALNS para problemas de programação de no-wait flowshop mistos. 2022, Anais.. São Carlos, SP: EESC/USP, 2022. Disponível em: http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355. Acesso em: 28 nov. 2025.

    • APA

      Verzelloni, J. V. P., & Nagano, M. S. (2022). Heurística ALNS para problemas de programação de no-wait flowshop mistos. In Livro de Resumos Expandidos. São Carlos, SP: EESC/USP. Recuperado de http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355

    • NLM

      Verzelloni JVP, Nagano MS. Heurística ALNS para problemas de programação de no-wait flowshop mistos [Internet]. Livro de Resumos Expandidos. 2022 ;[citado 2025 nov. 28 ] Available from: http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355

    • Vancouver

      Verzelloni JVP, Nagano MS. Heurística ALNS para problemas de programação de no-wait flowshop mistos [Internet]. Livro de Resumos Expandidos. 2022 ;[citado 2025 nov. 28 ] Available from: http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355

  • Artigo de periodico

    A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (2022)

    Prata, Bruno de Athayde; Nagano, Marcelo Seido

    Source: Engineering Optimization. Unidade: EESC

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

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

    • ABNT

      PRATA, Bruno de Athayde e NAGANO, Marcelo Seido. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, p. [1-15], 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2022.2144274. Acesso em: 28 nov. 2025.

    • APA

      Prata, B. de A., & Nagano, M. S. (2022). A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, [1-15]. doi:10.1080/0305215X.2022.2144274

    • NLM

      Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274

    • Vancouver

      Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274

  • Artigo de periodico

    Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm (2021)

    Miyata, Hugo Hissashi; Nagano, Marcelo Seido

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.jmsy.2021.10.005

  • Artigo de periodico

    Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times (2021)

    Rossi, Fernando Luis; Nagano, Marcelo Seido

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.cie.2021.107337

  • Artigo de periodico

    Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows (2021)

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

    Source: Arabian Journal for Science and Engineering. Unidade: EESC

    Subjects: HEURÍSTICA, PROGRAMAÇÃ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

      ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido e PRATA, Bruno de Athayde. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, p. 1-15, 2021Tradução . . Disponível em: https://doi.org/10.1007/s13369-021-06244-9. Acesso em: 28 nov. 2025.

    • APA

      Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2021). Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, 1-15. doi:10.1007/s13369-021-06244-9

    • NLM

      Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s13369-021-06244-9

    • Vancouver

      Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s13369-021-06244-9

  • Artigo de periodico

    Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance (2021)

    Yamada, Tuane Tonani; Nagano, Marcelo Seido ; Miyata, Hugo Hissashi

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.5267/j.ijiec.2021.5.002

  • Artigo de periodico

    Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation (2020)

    Rossi, Fernando Luis; Nagano, Marcelo Seido

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.swevo.2020.100689

  • Artigo de periodico

    An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (2020)

    Nagano, Marcelo Seido ; Almeida, Fernando Siqueira de; Miyata, Hugo Hissashi

    Source: Engineering Optimization. Unidade: EESC

    Subjects: ALGORITMOS, PROGRAMAÇÃ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

      NAGANO, Marcelo Seido e ALMEIDA, Fernando Siqueira de e MIYATA, Hugo Hissashi. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, p. [1-20], 2020Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2020.1797000. Acesso em: 28 nov. 2025.

    • APA

      Nagano, M. S., Almeida, F. S. de, & Miyata, H. H. (2020). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, [1-20]. doi:10.1080/0305215X.2020.1797000

    • NLM

      Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000

    • Vancouver

      Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000

  • Artigo de periodico

    A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem (2020)

    Tomazella, Caio Paziani; Nagano, Marcelo Seido

    Source: Expert Systems with Applications. Unidades: EESC, ICMC

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

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

    • ABNT

      TOMAZELLA, Caio Paziani e NAGANO, Marcelo Seido. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications, v. No 2020, p. 1-19, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2020.113556. Acesso em: 28 nov. 2025.

    • APA

      Tomazella, C. P., & Nagano, M. S. (2020). A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications, No 2020, 1-19. doi:10.1016/j.eswa.2020.113556

    • NLM

      Tomazella CP, Nagano MS. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem [Internet]. Expert Systems with Applications. 2020 ; No 2020 1-19.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.eswa.2020.113556

    • Vancouver

      Tomazella CP, Nagano MS. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem [Internet]. Expert Systems with Applications. 2020 ; No 2020 1-19.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.eswa.2020.113556

  • Artigo de periodico

    Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion (2019)

    Rossi, Fernando Luis; Nagano, Marcelo Seido

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.eswa.2019.01.057

  • Artigo de periodico

    Heuristics for the mixed no-idle flowshop with sequence-dependent setup times (2019)

    Rossi, Fernando Luis; Nagano, Marcelo Seido

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.1080/01605682.2019.1671149

  • Artigo de periodico

    Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times (2019)

    Takano, Mauricio Iwama ; Nagano, Marcelo Seido

    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: 28 nov. 2025.

    • 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 2025 nov. 28 ] 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 2025 nov. 28 ] Available from: https://doi.org/10.5267/j.ijiec.2018.5.002

  • Artigo de periodico

    Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times (2018)

    Moccellin, João Vitor; Nagano, Marcelo Seido ; Pitombeira Neto, Anselmo Ramalho; Prata, Bruno de Athayde

    Source: Journal of the Brazilian Society of Mechanical Sciences and Engineering. Unidade: EESC

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

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

    • ABNT

      MOCCELLIN, João Vitor et al. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, v. 40, n. 1, 2018Tradução . . Disponível em: https://doi.org/10.1007/s40430-018-0980-4. Acesso em: 28 nov. 2025.

    • APA

      Moccellin, J. V., Nagano, M. S., Pitombeira Neto, A. R., & Prata, B. de A. (2018). Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 40( 1). doi:10.1007/s40430-018-0980-4

    • NLM

      Moccellin JV, Nagano MS, Pitombeira Neto AR, Prata B de A. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times [Internet]. Journal of the Brazilian Society of Mechanical Sciences and Engineering. 2018 ; 40( 1):[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s40430-018-0980-4

    • Vancouver

      Moccellin JV, Nagano MS, Pitombeira Neto AR, Prata B de A. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times [Internet]. Journal of the Brazilian Society of Mechanical Sciences and Engineering. 2018 ; 40( 1):[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s40430-018-0980-4

  • Artigo de periodico

    A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times (2017)

    Takano, Mauricio Iwama ; Nagano, Marcelo Seido

    Source: Cogent Engineering. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, 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. A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times. Cogent Engineering, v. 4, 2017Tradução . . Disponível em: https://doi.org/10.1080/23311916.2017.1389638. Acesso em: 28 nov. 2025.

    • APA

      Takano, M. I., & Nagano, M. S. (2017). A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times. Cogent Engineering, 4. doi:10.1080/23311916.2017.1389638

    • NLM

      Takano MI, Nagano MS. A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times [Internet]. Cogent Engineering. 2017 ; 4[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/23311916.2017.1389638

    • Vancouver

      Takano MI, Nagano MS. A branch-and-bound method to minimize the makespan in a permutation flow shop with blocking and setup times [Internet]. Cogent Engineering. 2017 ; 4[citado 2025 nov. 28 ] Available from: https://doi.org/10.1080/23311916.2017.1389638

1 - 20 (64 records)

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