Filters : "European Journal of Operational Research" Limpar

Filters



Refine with date range


  • Source: European Journal of Operational Research. Unidade: FEARP

    Subjects: FUNÇÕES LOGARÍTMICAS, MODELOS MATEMÁTICOS, TOMADA DE DECISÃO

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LEONETI, Alexandre Bevilacqua e GOMES, Luiz Flavio Autran Monteiro. A novel version of the TODIM method based on the exponential model of prospect theory: the ExpTODIM method. European Journal of Operational Research, v. 295, n. 3, p. 1042-1055, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2021.03.055. Acesso em: 12 ago. 2022.
    • APA

      Leoneti, A. B., & Gomes, L. F. A. M. (2021). A novel version of the TODIM method based on the exponential model of prospect theory: the ExpTODIM method. European Journal of Operational Research, 295( 3), 1042-1055. doi:10.1016/j.ejor.2021.03.055
    • NLM

      Leoneti AB, Gomes LFAM. A novel version of the TODIM method based on the exponential model of prospect theory: the ExpTODIM method [Internet]. European Journal of Operational Research. 2021 ; 295( 3): 1042-1055.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2021.03.055
    • Vancouver

      Leoneti AB, Gomes LFAM. A novel version of the TODIM method based on the exponential model of prospect theory: the ExpTODIM method [Internet]. European Journal of Operational Research. 2021 ; 295( 3): 1042-1055.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2021.03.055
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING

    Versão AceitaOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 12 ago. 2022.
    • APA

      Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021
    • NLM

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
    • Vancouver

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, ELIPSE

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      TEDESCHI, Danilo Françoso e ANDRETTA, Marina. New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, v. 291, n. 1, p. 114-127, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.09.029. Acesso em: 12 ago. 2022.
    • APA

      Tedeschi, D. F., & Andretta, M. (2021). New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, 291( 1), 114-127. doi:10.1016/j.ejor.2020.09.029
    • NLM

      Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
    • Vancouver

      Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
  • Source: European Journal of Operational Research. Unidade: IME

    Subject: TEORIA DOS GRAFOS

    Available on 2023-01-05Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flavio Keidi et al. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, v. 293, n. 3, p. 826-836, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.059. Acesso em: 12 ago. 2022.
    • APA

      Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, 293( 3), 826-836. doi:10.1016/j.ejor.2020.12.059
    • NLM

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
    • Vancouver

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
  • Source: European Journal of Operational Research. Unidade: ICMC

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

    PrivateOnline source accessDOIHow 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: http://dx.doi.org/10.1016/j.ejor.2019.04.045. Acesso em: 12 ago. 2022.
    • 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 2022 ago. 12 ] Available from: http://dx.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 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2019.04.045
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: ENSINO MÉDIO, HORÁRIO ESCOLAR, ALGORITMOS ÚTEIS E ESPECÍFICOS

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SAVINIEC, Landir et al. Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems. European Journal of Operational Research, v. 280, n. 3, p. 1064-1081, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2019.08.001. Acesso em: 12 ago. 2022.
    • APA

      Saviniec, L., Santos, M. O. dos, Costa, A. M., & Santos, L. M. R. dos. (2020). Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems. European Journal of Operational Research, 280( 3), 1064-1081. doi:10.1016/j.ejor.2019.08.001
    • NLM

      Saviniec L, Santos MO dos, Costa AM, Santos LMR dos. Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems [Internet]. European Journal of Operational Research. 2020 ; 280( 3): 1064-1081.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2019.08.001
    • Vancouver

      Saviniec L, Santos MO dos, Costa AM, Santos LMR dos. Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems [Internet]. European Journal of Operational Research. 2020 ; 280( 3): 1064-1081.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2019.08.001
  • Source: European Journal of Operational Research. Unidade: EESC

    Subjects: PROGRAMAÇÃO NÃO LINEAR, SISTEMAS ELÉTRICOS DE POTÊNCIA, ENGENHARIA ELÉTRICA

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PINHEIRO, Ricardo Bento Nogueira Mori e LAGE, Guilherme Guimarães e COSTA, Geraldo Roberto Martins da. A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem. European Journal of Operational Research, v. 276, n. 3, p. 1137-1153, 2019Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2019.01.060. Acesso em: 12 ago. 2022.
    • APA

      Pinheiro, R. B. N. M., Lage, G. G., & Costa, G. R. M. da. (2019). A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem. European Journal of Operational Research, 276( 3), 1137-1153. doi:10.1016/j.ejor.2019.01.060
    • NLM

      Pinheiro RBNM, Lage GG, Costa GRM da. A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem [Internet]. European Journal of Operational Research. 2019 ; 276( 3): 1137-1153.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2019.01.060
    • Vancouver

      Pinheiro RBNM, Lage GG, Costa GRM da. A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem [Internet]. European Journal of Operational Research. 2019 ; 276( 3): 1137-1153.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2019.01.060
  • Source: European Journal of Operational Research. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS PARA PROCESSAMENTO

    PrivateOnline source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, v. 272, n. 2, p. 447-464, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.07.006. Acesso em: 12 ago. 2022.
    • APA

      Birgin, E. J. G., & Lobato, R. D. (2019). A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, 272( 2), 447-464. doi:10.1016/j.ejor.2018.07.006
    • NLM

      Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
    • Vancouver

      Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SAVINIEC, Landir e SANTOS, Maristela Oliveira dos e COSTA, Alysson Machado. Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, v. Fe 2018, n. 1, p. 81-98, 2018Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2017.07.029. Acesso em: 12 ago. 2022.
    • APA

      Saviniec, L., Santos, M. O. dos, & Costa, A. M. (2018). Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, Fe 2018( 1), 81-98. doi:10.1016/j.ejor.2017.07.029
    • NLM

      Saviniec L, Santos MO dos, Costa AM. Parallel local search algorithms for high school timetabling problems [Internet]. European Journal of Operational Research. 2018 ; Fe 2018( 1): 81-98.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2017.07.029
    • Vancouver

      Saviniec L, Santos MO dos, Costa AM. Parallel local search algorithms for high school timetabling problems [Internet]. European Journal of Operational Research. 2018 ; Fe 2018( 1): 81-98.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2017.07.029
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

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

      CUNHA, Artur Lovato da et al. An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research, v. 269, n. 3, p. 923-938, 2018Tradução . . Acesso em: 12 ago. 2022.
    • APA

      Cunha, A. L. da, Santos, M. O. dos, Morabito, R., & Ana Barbosa-Póvoa Ana Barbosa-Póvoa,. (2018). An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research, 269( 3), 923-938. doi:10.1016/j.ejor.2018.02.042
    • NLM

      Cunha AL da, Santos MO dos, Morabito R, Ana Barbosa-Póvoa Ana Barbosa-Póvoa. An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research. 2018 ; 269( 3): 923-938.[citado 2022 ago. 12 ]
    • Vancouver

      Cunha AL da, Santos MO dos, Morabito R, Ana Barbosa-Póvoa Ana Barbosa-Póvoa. An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research. 2018 ; 269( 3): 923-938.[citado 2022 ago. 12 ]
  • Source: European Journal of Operational Research. Unidade: EESC

    Subjects: PLANEJAMENTO DA PRODUÇÃO, CONTROLE DA PRODUÇÃO, MANUFATURA

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SAGAWA, Juliana Keiko e NAGANO, Marcelo Seido e SPERANZA NETO, Mauro. A closed-loop model of a multi-station and multi-product manufacturing system using bond graphs and hybrid controllers. European Journal of Operational Research, v. 258, n. 2, p. 677-691, 2017Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2016.08.056. Acesso em: 12 ago. 2022.
    • APA

      Sagawa, J. K., Nagano, M. S., & Speranza Neto, M. (2017). A closed-loop model of a multi-station and multi-product manufacturing system using bond graphs and hybrid controllers. European Journal of Operational Research, 258( 2), 677-691. doi:10.1016/j.ejor.2016.08.056
    • NLM

      Sagawa JK, Nagano MS, Speranza Neto M. A closed-loop model of a multi-station and multi-product manufacturing system using bond graphs and hybrid controllers [Internet]. European Journal of Operational Research. 2017 ; 258( 2): 677-691.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2016.08.056
    • Vancouver

      Sagawa JK, Nagano MS, Speranza Neto M. A closed-loop model of a multi-station and multi-product manufacturing system using bond graphs and hybrid controllers [Internet]. European Journal of Operational Research. 2017 ; 258( 2): 677-691.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2016.08.056
  • Source: European Journal of Operational Research. Unidade: EP

    Subjects: TRANSPORTES, ALGORITMOS E ESTRUTURAS DE DADOS, HEURÍSTICA

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SILVA, Marcos Roberto e CUNHA, Cláudio Barbieri da. A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. European Journal of Operational Research, v. No 2017, n. 3, p. 954-965, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2017.03.066. Acesso em: 12 ago. 2022.
    • APA

      Silva, M. R., & Cunha, C. B. da. (2017). A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. European Journal of Operational Research, No 2017( 3), 954-965. doi:10.1016/j.ejor.2017.03.066
    • NLM

      Silva MR, Cunha CB da. A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem [Internet]. European Journal of Operational Research. 2017 ; No 2017( 3): 954-965.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2017.03.066
    • Vancouver

      Silva MR, Cunha CB da. A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem [Internet]. European Journal of Operational Research. 2017 ; No 2017( 3): 954-965.[citado 2022 ago. 12 ] Available from: https://doi.org/10.1016/j.ejor.2017.03.066
  • Source: European Journal of Operational Research. Unidade: EACH

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FREIRE, Alexandre da Silva e MORENO, Eduardo e YUSHIMITO, Wilfredo F. A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research, v. 252, n. 1, p. 204-212, 2016Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2015.12.026. Acesso em: 12 ago. 2022.
    • APA

      Freire, A. da S., Moreno, E., & Yushimito, W. F. (2016). A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research, 252( 1), 204-212. doi:10.1016/j.ejor.2015.12.026
    • NLM

      Freire A da S, Moreno E, Yushimito WF. A branch-and-bound algorithm for the maximum capture problem with random utilities [Internet]. European Journal of Operational Research. 2016 ; 252( 1): 204-212.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.12.026
    • Vancouver

      Freire A da S, Moreno E, Yushimito WF. A branch-and-bound algorithm for the maximum capture problem with random utilities [Internet]. European Journal of Operational Research. 2016 ; 252( 1): 204-212.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.12.026
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CHERRI, Luiz Henrique et al. Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, v. 253, n. 3, p. 570-583, 2016Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2016.03.009. Acesso em: 12 ago. 2022.
    • APA

      Cherri, L. H., Mundim, L. R., Andretta, M., Toledo, F. M. B. de, Oliveira, J. F., & Carravilla, M. A. (2016). Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, 253( 3), 570-583. doi:10.1016/j.ejor.2016.03.009
    • NLM

      Cherri LH, Mundim LR, Andretta M, Toledo FMB de, Oliveira JF, Carravilla MA. Robust mixed-integer linear programming models for the irregular strip packing problem [Internet]. European Journal of Operational Research. 2016 ; 253( 3): 570-583.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2016.03.009
    • Vancouver

      Cherri LH, Mundim LR, Andretta M, Toledo FMB de, Oliveira JF, Carravilla MA. Robust mixed-integer linear programming models for the irregular strip packing problem [Internet]. European Journal of Operational Research. 2016 ; 253( 3): 570-583.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2016.03.009
  • Source: European Journal of Operational Research. Unidade: FEARP

    Subjects: TAXA DE JUROS, TAXAS DE JUROS FUTUROS, FINANÇAS, PREÇOS, ANÁLISE DE COVARIÂNCIA

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LAURINI, Márcio Poletti e OHASHI, Alberto. A noisy principal component analysis for forward rate curves. European Journal of Operational Research, v. 246, n. 1, p. 140–153, 2015Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2015.04.038. Acesso em: 12 ago. 2022.
    • APA

      Laurini, M. P., & Ohashi, A. (2015). A noisy principal component analysis for forward rate curves. European Journal of Operational Research, 246( 1), 140–153. doi:10.1016/j.ejor.2015.04.038
    • NLM

      Laurini MP, Ohashi A. A noisy principal component analysis for forward rate curves [Internet]. European Journal of Operational Research. 2015 ; 246( 1): 140–153.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.04.038
    • Vancouver

      Laurini MP, Ohashi A. A noisy principal component analysis for forward rate curves [Internet]. European Journal of Operational Research. 2015 ; 246( 1): 140–153.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.04.038
  • Source: European Journal of Operational Research. Unidade: EESC

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

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SAGAWA, Juliano Keiko e NAGANO, Marcelo Seido. Modeling the dynamics of a multi-product manufacturing system: a real case application. European Journal of Operational Research, v. 244, n. 2, p. 624-636, 2015Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2015.01.017. Acesso em: 12 ago. 2022.
    • APA

      Sagawa, J. K., & Nagano, M. S. (2015). Modeling the dynamics of a multi-product manufacturing system: a real case application. European Journal of Operational Research, 244( 2), 624-636. doi:10.1016/j.ejor.2015.01.017
    • NLM

      Sagawa JK, Nagano MS. Modeling the dynamics of a multi-product manufacturing system: a real case application [Internet]. European Journal of Operational Research. 2015 ; 244( 2): 624-636.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.01.017
    • Vancouver

      Sagawa JK, Nagano MS. Modeling the dynamics of a multi-product manufacturing system: a real case application [Internet]. European Journal of Operational Research. 2015 ; 244( 2): 624-636.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.01.017
  • Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: ALGORITMOS DE SCHEDULING, PESQUISA OPERACIONAL, CIÊNCIA DA COMPUTAÇÃO

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e FERREIRA, João Eduardo e RONCONI, Débora Pretti. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, v. 247, n. 2, p. 421-440, 2015Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2015.06.023. Acesso em: 12 ago. 2022.
    • APA

      Birgin, E. J. G., Ferreira, J. E., & Ronconi, D. P. (2015). List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. European Journal of Operational Research, 247( 2), 421-440. doi:10.1016/j.ejor.2015.06.023
    • NLM

      Birgin EJG, Ferreira JE, Ronconi DP. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility [Internet]. European Journal of Operational Research. 2015 ; 247( 2): 421-440.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.06.023
    • Vancouver

      Birgin EJG, Ferreira JE, Ronconi DP. List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility [Internet]. European Journal of Operational Research. 2015 ; 247( 2): 421-440.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2015.06.023
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CHERRI, Adriana Cristina et al. The one-dimensional cutting stock problem with usable leftovers: a survey. European Journal of Operational Research, v. 236, n. 2, p. 395-402, 2014Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2013.11.026. Acesso em: 12 ago. 2022.
    • APA

      Cherri, A. C., Yanasse, H. H., Poldi, K. C., Vianna, A. C. G., & Arenales, M. N. (2014). The one-dimensional cutting stock problem with usable leftovers: a survey. European Journal of Operational Research, 236( 2), 395-402. doi:10.1016/j.ejor.2013.11.026
    • NLM

      Cherri AC, Yanasse HH, Poldi KC, Vianna ACG, Arenales MN. The one-dimensional cutting stock problem with usable leftovers: a survey [Internet]. European Journal of Operational Research. 2014 ; 236( 2): 395-402.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2013.11.026
    • Vancouver

      Cherri AC, Yanasse HH, Poldi KC, Vianna ACG, Arenales MN. The one-dimensional cutting stock problem with usable leftovers: a survey [Internet]. European Journal of Operational Research. 2014 ; 236( 2): 395-402.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2013.11.026
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CAMARGO, Victor C. B e TOLEDO, Franklina Maria Bragion de e ALMADA-LOBO, Bernardo. HOPS: Hamming-Oriented Partition search for production planning in the spinning industry. European Journal of Operational Research, v. 234, n. 1, p. 266-277, 2014Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2013.10.017. Acesso em: 12 ago. 2022.
    • APA

      Camargo, V. C. B., Toledo, F. M. B. de, & Almada-Lobo, B. (2014). HOPS: Hamming-Oriented Partition search for production planning in the spinning industry. European Journal of Operational Research, 234( 1), 266-277. doi:10.1016/j.ejor.2013.10.017
    • NLM

      Camargo VCB, Toledo FMB de, Almada-Lobo B. HOPS: Hamming-Oriented Partition search for production planning in the spinning industry [Internet]. European Journal of Operational Research. 2014 ; 234( 1): 266-277.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2013.10.017
    • Vancouver

      Camargo VCB, Toledo FMB de, Almada-Lobo B. HOPS: Hamming-Oriented Partition search for production planning in the spinning industry [Internet]. European Journal of Operational Research. 2014 ; 234( 1): 266-277.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2013.10.017
  • Source: European Journal of Operational Research. Unidade: ICMC

    Subjects: PESQUISA OPERACIONAL, OTIMIZAÇÃO COMBINATÓRIA, HEURÍSTICA, VEÍCULOS

    Online source accessDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      OLIVEIRA, Beatriz Brito et al. A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company. European Journal of Operational Research, v. 237, n. 2, p. Se 2014, 2014Tradução . . Disponível em: http://dx.doi.org/10.1016/j.ejor.2014.02.018. Acesso em: 12 ago. 2022.
    • APA

      Oliveira, B. B., Carravilla, M. A., Oliveira, J. F., & Toledo, F. M. B. de. (2014). A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company. European Journal of Operational Research, 237( 2), Se 2014. doi:10.1016/j.ejor.2014.02.018
    • NLM

      Oliveira BB, Carravilla MA, Oliveira JF, Toledo FMB de. A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company [Internet]. European Journal of Operational Research. 2014 ; 237( 2): Se 2014.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2014.02.018
    • Vancouver

      Oliveira BB, Carravilla MA, Oliveira JF, Toledo FMB de. A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company [Internet]. European Journal of Operational Research. 2014 ; 237( 2): Se 2014.[citado 2022 ago. 12 ] Available from: http://dx.doi.org/10.1016/j.ejor.2014.02.018

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