Menu

Filtros : "HEURÍSTICA" "Financiado pelo CNPq" Limpar

Filtros

Refine with date range

1 - 20 (28 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: 27 nov. 2025.

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

  • Artigo de periodico

    Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion (2022)

    Rossi, Fernando Luis; Nagano, Marcelo Seido

    Source: OR Spectrum. Unidade: EESC

    Subjects: HEURÍSTICA, MANUFATURA, 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. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion. OR Spectrum, p. 1-36, 2022Tradução . . Disponível em: https://doi.org/10.1007/s00291-022-00678-9. Acesso em: 27 nov. 2025.

    • APA

      Rossi, F. L., & Nagano, M. S. (2022). Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion. OR Spectrum, 1-36. doi:10.1007/s00291-022-00678-9

    • NLM

      Rossi FL, Nagano MS. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion [Internet]. OR Spectrum. 2022 ; 1-36.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00291-022-00678-9

    • Vancouver

      Rossi FL, Nagano MS. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion [Internet]. OR Spectrum. 2022 ; 1-36.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00291-022-00678-9

  • Artigo de periodico

    Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times (2022)

    Almeida, Fernando Siqueira de ; Nagano, Marcelo Seido

    Source: Journal of the Operational Research Society. Unidade: EESC

    Subjects: SEQUENCIAÇÃ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

      ALMEIDA, Fernando Siqueira de e NAGANO, Marcelo Seido. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, p. 1-12, 2022Tradução . . Disponível em: https://doi.org/10.1080/01605682.2022.2039569. Acesso em: 27 nov. 2025.

    • APA

      Almeida, F. S. de, & Nagano, M. S. (2022). Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, 1-12. doi:10.1080/01605682.2022.2039569

    • NLM

      Almeida FS de, Nagano MS. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2022 ; 1-12.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/01605682.2022.2039569

    • Vancouver

      Almeida FS de, Nagano MS. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2022 ; 1-12.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/01605682.2022.2039569

  • Trabalho de evento

    AGAVaPS: adaptive genetic algorithm with varying population size (2022)

    Ribeiro, Rafael Rodrigues Mendes; Maciel, Carlos Dias

    Source: Proceedings. Conference titles: IEEE Congress on Evolutionary Computation - CEC. Unidade: EESC

    Subjects: ALGORITMOS GENÉTICOS, HEURÍSTICA, ENGENHARIA ELÉTRICA

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

    • ABNT

      RIBEIRO, Rafael Rodrigues Mendes e MACIEL, Carlos Dias. AGAVaPS: adaptive genetic algorithm with varying population size. 2022, Anais.. Picataway, NJ, USA: IEEE, 2022. Disponível em: https://doi.org/10.1109/CEC55065.2022.9870394. Acesso em: 27 nov. 2025.

    • APA

      Ribeiro, R. R. M., & Maciel, C. D. (2022). AGAVaPS: adaptive genetic algorithm with varying population size. In Proceedings. Picataway, NJ, USA: IEEE. doi:10.1109/CEC55065.2022.9870394

    • NLM

      Ribeiro RRM, Maciel CD. AGAVaPS: adaptive genetic algorithm with varying population size [Internet]. Proceedings. 2022 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/CEC55065.2022.9870394

    • Vancouver

      Ribeiro RRM, Maciel CD. AGAVaPS: adaptive genetic algorithm with varying population size [Internet]. Proceedings. 2022 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/CEC55065.2022.9870394

  • Artigo de periodico

    MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products (2021)

    Soler, Willy Alves de Oliveira ; Santos, Maristela Oliveira dos ; Akartunalı, Kerem

    Source: Journal of the Operational Research Society. Unidade: ICMC

    Subjects: INDÚSTRIA DE ALIMENTOS, ANÁLISE DE DESEMPENHO, ALGORITMOS, HEURÍSTICA

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

    • ABNT

      SOLER, Willy Alves de Oliveira e SANTOS, Maristela Oliveira dos e AKARTUNALI, Kerem. MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products. Journal of the Operational Research Society, v. 72, n. 8, p. 1691-1706, 2021Tradução . . Disponível em: https://doi.org/10.1080/01605682.2019.1640588. Acesso em: 27 nov. 2025.

    • APA

      Soler, W. A. de O., Santos, M. O. dos, & Akartunalı, K. (2021). MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products. Journal of the Operational Research Society, 72( 8), 1691-1706. doi:10.1080/01605682.2019.1640588

    • NLM

      Soler WA de O, Santos MO dos, Akartunalı K. MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products [Internet]. Journal of the Operational Research Society. 2021 ; 72( 8): 1691-1706.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/01605682.2019.1640588

    • Vancouver

      Soler WA de O, Santos MO dos, Akartunalı K. MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products [Internet]. Journal of the Operational Research Society. 2021 ; 72( 8): 1691-1706.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/01605682.2019.1640588

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

  • Artigo de periodico

    Meta-heuristics for the one-dimensional cutting stock problem with usable leftover (2020)

    Ravelo, Santiago Valdés ; Meneses, Cláudio Nogueira de ; Santos, Maristela Oliveira dos

    Source: Journal of Heuristics. Unidade: ICMC

    Subjects: HEURÍSTICA, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS ÚTEIS E ESPECÍFICOS

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

    • ABNT

      RAVELO, Santiago Valdés e MENESES, Cláudio Nogueira de e SANTOS, Maristela Oliveira dos. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. Journal of Heuristics, v. 26, p. 585-618, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10732-020-09443-z. Acesso em: 27 nov. 2025.

    • APA

      Ravelo, S. V., Meneses, C. N. de, & Santos, M. O. dos. (2020). Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. Journal of Heuristics, 26, 585-618. doi:10.1007/s10732-020-09443-z

    • NLM

      Ravelo SV, Meneses CN de, Santos MO dos. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover [Internet]. Journal of Heuristics. 2020 ; 26 585-618.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10732-020-09443-z

    • Vancouver

      Ravelo SV, Meneses CN de, Santos MO dos. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover [Internet]. Journal of Heuristics. 2020 ; 26 585-618.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10732-020-09443-z

  • Artigo de periodico

    Jacob’s Ladder: logics of magic, metaphor and metaphysics (2020)

    Stern, Julio Michael

    Source: Sophia. Unidade: IME

    Subjects: MATEMÁTICA APLICADA, SILEPSE, PENSAMENTO MÁGICO, 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

      STERN, Julio Michael. Jacob’s Ladder: logics of magic, metaphor and metaphysics. Sophia, v. 59, p. 365-385, 2020Tradução . . Disponível em: https://doi.org/10.1007/s11841-017-0592-y. Acesso em: 27 nov. 2025.

    • APA

      Stern, J. M. (2020). Jacob’s Ladder: logics of magic, metaphor and metaphysics. Sophia, 59, 365-385. doi:10.1007/s11841-017-0592-y

    • NLM

      Stern JM. Jacob’s Ladder: logics of magic, metaphor and metaphysics [Internet]. Sophia. 2020 ; 59 365-385.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s11841-017-0592-y

    • Vancouver

      Stern JM. Jacob’s Ladder: logics of magic, metaphor and metaphysics [Internet]. Sophia. 2020 ; 59 365-385.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s11841-017-0592-y

  • Artigo de periodico

    A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (2020)

    Birgin, Ernesto Julian Goldberg ; Jesus Filho, José Eurípedes Ferreira de; Ronconi, Débora Pretti

    Source: Computers & Operations Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE 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

      BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, v. 114, n. 1-14, p. 104824, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2019.104824. Acesso em: 27 nov. 2025.

    • APA

      Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2020). A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, 114( 1-14), 104824. doi:10.1016/j.cor.2019.104824

    • NLM

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2019.104824

    • Vancouver

      Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2019.104824

  • Artigo de periodico

    MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration (2020)

    Freitas, Karla Barbosa de ; Arantes, Márcio da Silva; Toledo, Claudio Fabiano Motta ; Delbem, Alexandre Cláudio Botazzo

    Source: Journal of Heuristics. Unidade: ICMC

    Subjects: REDES DE DISTRIBUIÇÃO DE ENERGIA ELÉTRICA, HEURÍSTICA, COMPARABILIDADE DOS DADOS, BENCHMARKS

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

    • ABNT

      FREITAS, Karla Barbosa de et al. MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration. Journal of Heuristics, v. 26, p. 59-81, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10732-019-09421-0. Acesso em: 27 nov. 2025.

    • APA

      Freitas, K. B. de, Arantes, M. da S., Toledo, C. F. M., & Delbem, A. C. B. (2020). MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration. Journal of Heuristics, 26, 59-81. doi:10.1007/s10732-019-09421-0

    • NLM

      Freitas KB de, Arantes M da S, Toledo CFM, Delbem ACB. MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration [Internet]. Journal of Heuristics. 2020 ; 26 59-81.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10732-019-09421-0

    • Vancouver

      Freitas KB de, Arantes M da S, Toledo CFM, Delbem ACB. MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration [Internet]. Journal of Heuristics. 2020 ; 26 59-81.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10732-019-09421-0

  • Artigo de periodico

    Irregular packing problems: a review of mathematical models (2020)

    Leão, Aline Aparecida de Souza; Toledo, Franklina Maria Bragion de ; Oliveira, José Fernando ; Carravilla, Maria Antónia ; Alvarez-Valdés, Ramón

    Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: MODELOS MATEMÁTICOS, HEURÍSTICA, PLANEJAMENTO DA PRODUÇÃO

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

    • ABNT

      LEÃO, Aline Aparecida de Souza et al. Irregular packing problems: a review of mathematical models. European Journal of Operational Research, v. 282, n. 3, p. 803-822, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2019.04.045. Acesso em: 27 nov. 2025.

    • APA

      Leão, A. A. de S., Toledo, F. M. B. de, Oliveira, J. F., Carravilla, M. A., & Alvarez-Valdés, R. (2020). Irregular packing problems: a review of mathematical models. European Journal of Operational Research, 282( 3), 803-822. doi:10.1016/j.ejor.2019.04.045

    • NLM

      Leão AA de S, Toledo FMB de, Oliveira JF, Carravilla MA, Alvarez-Valdés R. Irregular packing problems: a review of mathematical models [Internet]. European Journal of Operational Research. 2020 ; 282( 3): 803-822.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejor.2019.04.045

    • Vancouver

      Leão AA de S, Toledo FMB de, Oliveira JF, Carravilla MA, Alvarez-Valdés R. Irregular packing problems: a review of mathematical models [Internet]. European Journal of Operational Research. 2020 ; 282( 3): 803-822.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejor.2019.04.045

  • Artigo de periodico

    Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center (2020)

    Nogueira, Thiago Henrique; Coutinho, Felipe Provezano ; Ribeiro, Rafael Pereira; Ravetti, Martín Gómez

    Source: Computers & Industrial Engineering. Unidade: ICMC

    Subjects: LOGÍSTICA, TRANSBORDO DE CARGA, HEURÍSTICA, CAMINHÕES

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

    • ABNT

      NOGUEIRA, Thiago Henrique et al. Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center. Computers & Industrial Engineering, v. 143, p. 1-15, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2020.106391. Acesso em: 27 nov. 2025.

    • APA

      Nogueira, T. H., Coutinho, F. P., Ribeiro, R. P., & Ravetti, M. G. (2020). Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center. Computers & Industrial Engineering, 143, 1-15. doi:10.1016/j.cie.2020.106391

    • NLM

      Nogueira TH, Coutinho FP, Ribeiro RP, Ravetti MG. Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center [Internet]. Computers & Industrial Engineering. 2020 ; 143 1-15.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cie.2020.106391

    • Vancouver

      Nogueira TH, Coutinho FP, Ribeiro RP, Ravetti MG. Parallel-machine scheduling methodology for a multi-dock truck sequencing problem in a cross-docking center [Internet]. Computers & Industrial Engineering. 2020 ; 143 1-15.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cie.2020.106391

  • Artigo de periodico

    Usability heuristics on parental privacy controls for smart toys: from an exploratory map to a confirmatory research (2020)

    Salgado, André de Lima ; Fortes, Renata Pontin de Mattos ; Oliveira, Ricardo Ramos de; Freire, André Pimenta

    Source: Electronic Commerce Research and Applications. Unidade: ICMC

    Subjects: HEURÍSTICA, USABILIDADE DE SOFTWARE, COMPUTAÇÃO MÓVEL, BRINQUEDOS, CRIANÇAS, PRIVACIDADE

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

    • ABNT

      SALGADO, André de Lima et al. Usability heuristics on parental privacy controls for smart toys: from an exploratory map to a confirmatory research. Electronic Commerce Research and Applications, v. 42, p. 1-13, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.elerap.2020.100984. Acesso em: 27 nov. 2025.

    • APA

      Salgado, A. de L., Fortes, R. P. de M., Oliveira, R. R. de, & Freire, A. P. (2020). Usability heuristics on parental privacy controls for smart toys: from an exploratory map to a confirmatory research. Electronic Commerce Research and Applications, 42, 1-13. doi:10.1016/j.elerap.2020.100984

    • NLM

      Salgado A de L, Fortes RP de M, Oliveira RR de, Freire AP. Usability heuristics on parental privacy controls for smart toys: from an exploratory map to a confirmatory research [Internet]. Electronic Commerce Research and Applications. 2020 ; 42 1-13.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.elerap.2020.100984

    • Vancouver

      Salgado A de L, Fortes RP de M, Oliveira RR de, Freire AP. Usability heuristics on parental privacy controls for smart toys: from an exploratory map to a confirmatory research [Internet]. Electronic Commerce Research and Applications. 2020 ; 42 1-13.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.elerap.2020.100984

  • Artigo de periodico

    A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem (2020)

    Azevedo, Leonildo José de Melo de ; Estrella, Júlio Cezar ; Toledo, Claudio Fabiano Motta ; Reiff-Marganiec, Stephan

    Source: IEEE Access. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, COMPUTAÇÃO EM NUVEM, 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

      AZEVEDO, Leonildo José de Melo de et al. A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem. IEEE Access, v. 8, p. 122469-122479, 2020Tradução . . Disponível em: https://doi.org/10.1109/ACCESS.2020.3006171. Acesso em: 27 nov. 2025.

    • APA

      Azevedo, L. J. de M. de, Estrella, J. C., Toledo, C. F. M., & Reiff-Marganiec, S. (2020). A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem. IEEE Access, 8, 122469-122479. doi:10.1109/ACCESS.2020.3006171

    • NLM

      Azevedo LJ de M de, Estrella JC, Toledo CFM, Reiff-Marganiec S. A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem [Internet]. IEEE Access. 2020 ; 8 122469-122479.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ACCESS.2020.3006171

    • Vancouver

      Azevedo LJ de M de, Estrella JC, Toledo CFM, Reiff-Marganiec S. A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem [Internet]. IEEE Access. 2020 ; 8 122469-122479.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ACCESS.2020.3006171

  • Trabalho de evento

    Exploratory path planning for mobile robots in dynamic environments with ant colony optimization (2020)

    Santos, Valéria C; Otero, Fernando Esteban Barril ; Johnson, Colin; Osório, Fernando Santos ; Toledo, Claudio Fabiano Motta

    Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference - GECCO. Unidade: ICMC

    Subjects: ROBÔS, ANÁLISE DE TRAJETÓRIAS, HEURÍSTICA

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

    • ABNT

      SANTOS, Valéria C et al. Exploratory path planning for mobile robots in dynamic environments with ant colony optimization. 2020, Anais.. New York: ACM, 2020. Disponível em: https://doi.org/10.1145/3377930.3390219. Acesso em: 27 nov. 2025.

    • APA

      Santos, V. C., Otero, F. E. B., Johnson, C., Osório, F. S., & Toledo, C. F. M. (2020). Exploratory path planning for mobile robots in dynamic environments with ant colony optimization. In Proceedings. New York: ACM. doi:10.1145/3377930.3390219

    • NLM

      Santos VC, Otero FEB, Johnson C, Osório FS, Toledo CFM. Exploratory path planning for mobile robots in dynamic environments with ant colony optimization [Internet]. Proceedings. 2020 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1145/3377930.3390219

    • Vancouver

      Santos VC, Otero FEB, Johnson C, Osório FS, Toledo CFM. Exploratory path planning for mobile robots in dynamic environments with ant colony optimization [Internet]. Proceedings. 2020 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1145/3377930.3390219

  • Artigo de periodico

    Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time (2020)

    Queiroz, Thiago Alves de ; Mundim, Leandro Resende

    Source: International Transactions in Operational Research. Unidade: ICMC

    Subjects: PROGRAMAÇÃO PARALELA, HEURÍSTICA, ESCALONAMENTO MULTIDIMENSIONAL

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

    • ABNT

      QUEIROZ, Thiago Alves de e MUNDIM, Leandro Resende. Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time. International Transactions in Operational Research, v. 27, n. 3, p. 1478-1500, 2020Tradução . . Disponível em: https://doi.org/10.1111/itor.12738. Acesso em: 27 nov. 2025.

    • APA

      Queiroz, T. A. de, & Mundim, L. R. (2020). Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time. International Transactions in Operational Research, 27( 3), 1478-1500. doi:10.1111/itor.12738

    • NLM

      Queiroz TA de, Mundim LR. Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1478-1500.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1111/itor.12738

    • Vancouver

      Queiroz TA de, Mundim LR. Multiobjective pseudo-variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1478-1500.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1111/itor.12738

  • Trabalho de evento-anais periodico

    Multi-objective basic variable neighborhood search for portfolio selection (2020)

    Queiroz, Thiago Alves de ; Mundim, Leandro Resende ; Carvalho, André Carlos Ponce de Leon Ferreira de

    Source: Lecture Notes in Computer Science. Conference titles: International Conference on Variable Neighborhood Search - ICVNS. Unidade: ICMC

    Subjects: RECONHECIMENTO DE PADRÕES, HEURÍSTICA

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

    • ABNT

      QUEIROZ, Thiago Alves de e MUNDIM, Leandro Resende e CARVALHO, André Carlos Ponce de Leon Ferreira de. Multi-objective basic variable neighborhood search for portfolio selection. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-44932-2_5. Acesso em: 27 nov. 2025. , 2020

    • APA

      Queiroz, T. A. de, Mundim, L. R., & Carvalho, A. C. P. de L. F. de. (2020). Multi-objective basic variable neighborhood search for portfolio selection. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-44932-2_5

    • NLM

      Queiroz TA de, Mundim LR, Carvalho ACP de LF de. Multi-objective basic variable neighborhood search for portfolio selection [Internet]. Lecture Notes in Computer Science. 2020 ; 12010 67–80.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-030-44932-2_5

    • Vancouver

      Queiroz TA de, Mundim LR, Carvalho ACP de LF de. Multi-objective basic variable neighborhood search for portfolio selection [Internet]. Lecture Notes in Computer Science. 2020 ; 12010 67–80.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-030-44932-2_5

  • Artigo de periodico

    Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem (2020)

    Lunardi, Willian Tessaro ; Birgin, Ernesto Julian Goldberg ; Laborie, Philippe ; Ronconi, Débora Pretti ; Voos, Holger

    Source: Computers & Operations Research. Unidades: IME, EP

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

      LUNARDI, Willian Tessaro et al. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, v. 123, p. 1-20, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2020.105020. Acesso em: 27 nov. 2025.

    • APA

      Lunardi, W. T., Birgin, E. J. G., Laborie, P., Ronconi, D. P., & Voos, H. (2020). Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, 123, 1-20. doi:10.1016/j.cor.2020.105020

    • NLM

      Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2020.105020

    • Vancouver

      Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.cor.2020.105020

  • Artigo de periodico

    A method for classifying usability findings to enhance validation of new heuristics (2019)

    Salgado, André de Lima ; Fortes, Renata Pontin de Mattos ; Hung, Patrick C. K ; Moreira, Dilvan de Abreu

    Source: Revista de Sistemas e Computação : RSC. Unidade: ICMC

    Subjects: USABILIDADE DE SOFTWARE, HEURÍSTICA

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

    • ABNT

      SALGADO, André de Lima et al. A method for classifying usability findings to enhance validation of new heuristics. Revista de Sistemas e Computação : RSC, v. 9, n. ja-ju 2019, p. 96-118, 2019Tradução . . Disponível em: https://revistas.unifacs.br/index.php/rsc/article/view/5852. Acesso em: 27 nov. 2025.

    • APA

      Salgado, A. de L., Fortes, R. P. de M., Hung, P. C. K., & Moreira, D. de A. (2019). A method for classifying usability findings to enhance validation of new heuristics. Revista de Sistemas e Computação : RSC, 9( ja-ju 2019), 96-118. Recuperado de https://revistas.unifacs.br/index.php/rsc/article/view/5852

    • NLM

      Salgado A de L, Fortes RP de M, Hung PCK, Moreira D de A. A method for classifying usability findings to enhance validation of new heuristics [Internet]. Revista de Sistemas e Computação : RSC. 2019 ; 9( ja-ju 2019): 96-118.[citado 2025 nov. 27 ] Available from: https://revistas.unifacs.br/index.php/rsc/article/view/5852

    • Vancouver

      Salgado A de L, Fortes RP de M, Hung PCK, Moreira D de A. A method for classifying usability findings to enhance validation of new heuristics [Internet]. Revista de Sistemas e Computação : RSC. 2019 ; 9( ja-ju 2019): 96-118.[citado 2025 nov. 27 ] Available from: https://revistas.unifacs.br/index.php/rsc/article/view/5852

  • Artigo de periodico

    Capacitated lot sizing and scheduling with order acceptance and delivery time windows: mathematical model and a mip-based heuristic (2019)

    Soler, Willy Alves de Oliveira ; Poldi, Kelly Cristina ; Santos, Maristela Oliveira dos

    Source: Pesquisa Operacional. Unidade: ICMC

    Subjects: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, PROGRAMAÇÃO MISTA, 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

      SOLER, Willy Alves de Oliveira e POLDI, Kelly Cristina e SANTOS, Maristela Oliveira dos. Capacitated lot sizing and scheduling with order acceptance and delivery time windows: mathematical model and a mip-based heuristic. Pesquisa Operacional, v. 3, p. 471-496, 2019Tradução . . Disponível em: https://doi.org/10.1590/0101-7438.2019.039.03.0471. Acesso em: 27 nov. 2025.

    • APA

      Soler, W. A. de O., Poldi, K. C., & Santos, M. O. dos. (2019). Capacitated lot sizing and scheduling with order acceptance and delivery time windows: mathematical model and a mip-based heuristic. Pesquisa Operacional, 3, 471-496. doi:10.1590/0101-7438.2019.039.03.0471

    • NLM

      Soler WA de O, Poldi KC, Santos MO dos. Capacitated lot sizing and scheduling with order acceptance and delivery time windows: mathematical model and a mip-based heuristic [Internet]. Pesquisa Operacional. 2019 ; 3 471-496.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1590/0101-7438.2019.039.03.0471

    • Vancouver

      Soler WA de O, Poldi KC, Santos MO dos. Capacitated lot sizing and scheduling with order acceptance and delivery time windows: mathematical model and a mip-based heuristic [Internet]. Pesquisa Operacional. 2019 ; 3 471-496.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1590/0101-7438.2019.039.03.0471

1 - 20 (28 records)

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