Menu

Filtros : "Nagano, Marcelo Seido" "Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)" Removidos: "Journal of Academy of Business and Economics" "TRABALHO DE EVENTO-RESUMO" "FCF001, GRU999" "ENZIMAS" "Paixão, Thiago Regis Longo Cesar da" "2011" Limpar

Filtros

Refine with date range

  • 1

1 - 14 (14 records)

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

  • Artigo de periodico

    Systematic literature review on organisational culture and strategic management in the public sector andschool management (2023)

    Oliveira, Pedro Henrique de ; Paschoalotto, Marco Antonio Catussi ; Santos, Fernando César Almada ; Sousa, Thales Botelho de ; Nagano, Marcelo Seido

    Source: School Leadership & Management. Unidade: EESC

    Assunto: 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

      OLIVEIRA, Pedro Henrique de et al. Systematic literature review on organisational culture and strategic management in the public sector andschool management. School Leadership & Management, p. 1-28, 2023Tradução . . Disponível em: https://doi.org/10.1080/13632434.2023.2176483. Acesso em: 29 jun. 2024.

    • APA

      Oliveira, P. H. de, Paschoalotto, M. A. C., Santos, F. C. A., Sousa, T. B. de, & Nagano, M. S. (2023). Systematic literature review on organisational culture and strategic management in the public sector andschool management. School Leadership & Management, 1-28. doi:10.1080/13632434.2023.2176483

    • NLM

      Oliveira PH de, Paschoalotto MAC, Santos FCA, Sousa TB de, Nagano MS. Systematic literature review on organisational culture and strategic management in the public sector andschool management [Internet]. School Leadership & Management. 2023 ; 1-28.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/13632434.2023.2176483

    • Vancouver

      Oliveira PH de, Paschoalotto MAC, Santos FCA, Sousa TB de, Nagano MS. Systematic literature review on organisational culture and strategic management in the public sector andschool management [Internet]. School Leadership & Management. 2023 ; 1-28.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/13632434.2023.2176483

  • Artigo de periodico

    A performance index for tradittional reailers incorporating digital marketplace: benchmarking through data envelopment analysis (DEA) (2023)

    Melo, I. C.; Alves Junior, Paulo Nocera ; Callefi, Jéssica Syrio; Kodama, Tatiana Kimura ; Nagano, Marcelo Seido ; Rebelatto, Daisy Aparecida do Nascimento

    Source: Journal of Organizational Computing and Electronic Commerce. Unidade: EESC

    Subjects: COMÉRCIO ELETRÔNICO, WEB SITES, BENCHMARKING, 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

      MELO, I. C. et al. A performance index for tradittional reailers incorporating digital marketplace: benchmarking through data envelopment analysis (DEA). Journal of Organizational Computing and Electronic Commerce, p. 1-21, 2023Tradução . . Disponível em: https://doi.org/10.1080/10919392.2023.2177070. Acesso em: 29 jun. 2024.

    • APA

      Melo, I. C., Alves Junior, P. N., Callefi, J. S., Kodama, T. K., Nagano, M. S., & Rebelatto, D. A. do N. (2023). A performance index for tradittional reailers incorporating digital marketplace: benchmarking through data envelopment analysis (DEA). Journal of Organizational Computing and Electronic Commerce, 1-21. doi:10.1080/10919392.2023.2177070

    • NLM

      Melo IC, Alves Junior PN, Callefi JS, Kodama TK, Nagano MS, Rebelatto DA do N. A performance index for tradittional reailers incorporating digital marketplace: benchmarking through data envelopment analysis (DEA) [Internet]. Journal of Organizational Computing and Electronic Commerce. 2023 ; 1-21.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/10919392.2023.2177070

    • Vancouver

      Melo IC, Alves Junior PN, Callefi JS, Kodama TK, Nagano MS, Rebelatto DA do N. A performance index for tradittional reailers incorporating digital marketplace: benchmarking through data envelopment analysis (DEA) [Internet]. Journal of Organizational Computing and Electronic Commerce. 2023 ; 1-21.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/10919392.2023.2177070

  • 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: 29 jun. 2024.

    • 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 2024 jun. 29 ] 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 2024 jun. 29 ] Available from: https://doi.org/10.1080/00207543.2022.2154404

  • Artigo de periodico

    A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (2022)

    Abreu, Levi Ribeiro de; Araújo, Kennedy Anderson Guimarães; Prata, Bruno de Athayde; Nagano, Marcelo Seido ; Moccellin, João Vitor

    Source: Engineering Optimization. Unidades: EESC, IME

    Assunto: 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

      ABREU, Levi Ribeiro de et al. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, v. 54, n. 9, p. 1563-1582, 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2021.1957101. Acesso em: 29 jun. 2024.

    • APA

      Abreu, L. R. de, Araújo, K. A. G., Prata, B. de A., Nagano, M. S., & Moccellin, J. V. (2022). A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, 54( 9), 1563-1582. doi:10.1080/0305215X.2021.1957101

    • NLM

      Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101

    • Vancouver

      Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101

  • Artigo de periodico

    Organizational culture and strategic management in brazilian public organizations: systematization of factors to improve school management (2022)

    Oliveria, Pedro Henrique de ; Santos, Fernando César Almada ; Paschoalotto, Marco Antonio Catussi ; Nagano, Marcelo Seido ; Hashimoto, Elizabeth Mie ; Robertson, Peter J.

    Source: International Journal of Public Administration. Unidade: EESC

    Subjects: ADMINISTRAÇÃO ESTRATÉGICA, CULTURA ORGANIZACIONAL, ADMINISTRAÇÃO PÚBLICA, 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

      OLIVERIA, Pedro Henrique de et al. Organizational culture and strategic management in brazilian public organizations: systematization of factors to improve school management. International Journal of Public Administration, p. 1-15, 2022Tradução . . Disponível em: https://doi.org/10.1080/01900692.2022.2069118. Acesso em: 29 jun. 2024.

    • APA

      Oliveria, P. H. de, Santos, F. C. A., Paschoalotto, M. A. C., Nagano, M. S., Hashimoto, E. M., & Robertson, P. J. (2022). Organizational culture and strategic management in brazilian public organizations: systematization of factors to improve school management. International Journal of Public Administration, 1-15. doi:10.1080/01900692.2022.2069118

    • NLM

      Oliveria PH de, Santos FCA, Paschoalotto MAC, Nagano MS, Hashimoto EM, Robertson PJ. Organizational culture and strategic management in brazilian public organizations: systematization of factors to improve school management [Internet]. International Journal of Public Administration. 2022 ; 1-15.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/01900692.2022.2069118

    • Vancouver

      Oliveria PH de, Santos FCA, Paschoalotto MAC, Nagano MS, Hashimoto EM, Robertson PJ. Organizational culture and strategic management in brazilian public organizations: systematization of factors to improve school management [Internet]. International Journal of Public Administration. 2022 ; 1-15.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/01900692.2022.2069118

  • Artigo de periodico

    Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function (2022)

    Miyata, Hugo Hissashi ; Nagano, Marcelo Seido ; Gupta, Jatinder N. D

    Source: International Journal of Production Research. Unidade: EESC

    Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, SCHEDULING, PROGRAMAÇÃO LINEAR, 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 e GUPTA, Jatinder N. D. Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function. International Journal of Production Research, p. 1-29, 2022Tradução . . Disponível em: https://doi.org/10.1080/00207543.2022.2127959. Acesso em: 29 jun. 2024.

    • APA

      Miyata, H. H., Nagano, M. S., & Gupta, J. N. D. (2022). Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function. International Journal of Production Research, 1-29. doi:10.1080/00207543.2022.2127959

    • NLM

      Miyata HH, Nagano MS, Gupta JND. Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function [Internet]. International Journal of Production Research. 2022 ; 1-29.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/00207543.2022.2127959

    • Vancouver

      Miyata HH, Nagano MS, Gupta JND. Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function [Internet]. International Journal of Production Research. 2022 ; 1-29.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1080/00207543.2022.2127959

  • Artigo de periodico

    A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness (2022)

    Abreu, Levi Ribeiro de; Prata, Bruno de Athayde; Gomes, Allan Costa; Santos, Stephanie Alencar Braga; Nagano, Marcelo Seido

    Source: Swarm and Evolutionary Computation. Unidade: EESC

    Subjects: INDÚSTRIA FARMACÊUTICA, CONTATOS COM CLIENTES, ALGORITMOS GENÉTICOS, 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

      ABREU, Levi Ribeiro de et al. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, v. 75, p. 1-13, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2022.101149. Acesso em: 29 jun. 2024.

    • APA

      Abreu, L. R. de, Prata, B. de A., Gomes, A. C., Santos, S. A. B., & Nagano, M. S. (2022). A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, 75, 1-13. doi:10.1016/j.swevo.2022.101149

    • NLM

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149

    • Vancouver

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149

  • Artigo de periodico

    New efficient heuristics for scheduling open shops with makespan minimization (2022)

    Abreu, Levi Ribeiro de; Prata, Bruno de Athayde; Framinan, José Manuel; Nagano, Marcelo Seido

    Source: Computers and Operations Research. Unidade: EESC

    Assunto: 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

      ABREU, Levi Ribeiro de et al. New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, v. 142, p. 1-21, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2022.105744. Acesso em: 29 jun. 2024.

    • APA

      Abreu, L. R. de, Prata, B. de A., Framinan, J. M., & Nagano, M. S. (2022). New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, 142, 1-21. doi:10.1016/j.cor.2022.105744

    • NLM

      Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.cor.2022.105744

    • Vancouver

      Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.cor.2022.105744

  • Artigo de periodico

    Dynamic Programming algorithms and their applications in machine scheduling: a review (2022)

    Souza, Edson Antonio Gonçalves de; Nagano, Marcelo Seido ; Rolim, Gustavo Alencar

    Source: Expert Systems with Applications. Unidade: EESC

    Subjects: PROGRAMAÇÃO DINÂMICA, PESQUISA, 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

      SOUZA, Edson Antonio Gonçalves de e NAGANO, Marcelo Seido e ROLIM, Gustavo Alencar. Dynamic Programming algorithms and their applications in machine scheduling: a review. Expert Systems with Applications, v. 190, p. 1-35, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2021.116180. Acesso em: 29 jun. 2024.

    • APA

      Souza, E. A. G. de, Nagano, M. S., & Rolim, G. A. (2022). Dynamic Programming algorithms and their applications in machine scheduling: a review. Expert Systems with Applications, 190, 1-35. doi:10.1016/j.eswa.2021.116180

    • NLM

      Souza EAG de, Nagano MS, Rolim GA. Dynamic Programming algorithms and their applications in machine scheduling: a review [Internet]. Expert Systems with Applications. 2022 ; 190 1-35.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.eswa.2021.116180

    • Vancouver

      Souza EAG de, Nagano MS, Rolim GA. Dynamic Programming algorithms and their applications in machine scheduling: a review [Internet]. Expert Systems with Applications. 2022 ; 190 1-35.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.eswa.2021.116180

  • Artigo de periodico

    How to undertake reviews of large collections of articles and establish main contributions: an ontology-based literature review approach (2022)

    Martarelli, Nádia Junqueira; Nagano, Marcelo Seido

    Source: International Journal of Information Management Data Insights. Unidade: EESC

    Subjects: CONHECIMENTO, RECONHECIMENTO DE PADRÕES, MINERAÇÃO DE DADOS, ONTOLOGIA, 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

      MARTARELLI, Nádia Junqueira e NAGANO, Marcelo Seido. How to undertake reviews of large collections of articles and establish main contributions: an ontology-based literature review approach. International Journal of Information Management Data Insights, v. 2, n. 2, p. 1-8, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.jjimei.2022.100091. Acesso em: 29 jun. 2024.

    • APA

      Martarelli, N. J., & Nagano, M. S. (2022). How to undertake reviews of large collections of articles and establish main contributions: an ontology-based literature review approach. International Journal of Information Management Data Insights, 2( 2), 1-8. doi:10.1016/j.jjimei.2022.100091

    • NLM

      Martarelli NJ, Nagano MS. How to undertake reviews of large collections of articles and establish main contributions: an ontology-based literature review approach [Internet]. International Journal of Information Management Data Insights. 2022 ; 2( 2): 1-8.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.jjimei.2022.100091

    • Vancouver

      Martarelli NJ, Nagano MS. How to undertake reviews of large collections of articles and establish main contributions: an ontology-based literature review approach [Internet]. International Journal of Information Management Data Insights. 2022 ; 2( 2): 1-8.[citado 2024 jun. 29 ] Available from: https://doi.org/10.1016/j.jjimei.2022.100091

  • 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: 29 jun. 2024.

    • 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 2024 jun. 29 ] 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 2024 jun. 29 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274

  • 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: 29 jun. 2024.

    • 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 2024 jun. 29 ] 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 2024 jun. 29 ] Available from: https://doi.org/10.1007/s13369-021-06244-9

  • Tese (Doutorado)

    Contribuições para o problema flow shop com bloqueio, tempos de setup dependentes da sequência e funções-objetivo hierárquicas sujeitas ao custo total de manutenção preventiva (2020)

    Miyata, Hugo Hissashi; Nagano, Marcelo Seido (Orientador)

    Unidade: EESC

    Subjects: MANUFATURA, SEQUENCIAÇÃO DA PRODUÇÃO, PROGRAMAÇÃO LINEAR

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

    • ABNT

      MIYATA, Hugo Hissashi. Contribuições para o problema flow shop com bloqueio, tempos de setup dependentes da sequência e funções-objetivo hierárquicas sujeitas ao custo total de manutenção preventiva. 2020. Tese (Doutorado) – Universidade de São Paulo, São Carlos, 2020. Disponível em: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-05032020-085433/. Acesso em: 29 jun. 2024.

    • APA

      Miyata, H. H. (2020). Contribuições para o problema flow shop com bloqueio, tempos de setup dependentes da sequência e funções-objetivo hierárquicas sujeitas ao custo total de manutenção preventiva (Tese (Doutorado). Universidade de São Paulo, São Carlos. Recuperado de https://www.teses.usp.br/teses/disponiveis/18/18156/tde-05032020-085433/

    • NLM

      Miyata HH. Contribuições para o problema flow shop com bloqueio, tempos de setup dependentes da sequência e funções-objetivo hierárquicas sujeitas ao custo total de manutenção preventiva [Internet]. 2020 ;[citado 2024 jun. 29 ] Available from: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-05032020-085433/

    • Vancouver

      Miyata HH. Contribuições para o problema flow shop com bloqueio, tempos de setup dependentes da sequência e funções-objetivo hierárquicas sujeitas ao custo total de manutenção preventiva [Internet]. 2020 ;[citado 2024 jun. 29 ] Available from: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-05032020-085433/
  • 1

1 - 14 (14 records)

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