ReP USP - Resultado da busca

Artigo de periodico
Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects (2017)
Camargo, José Alberto de; Mendonça, Paulo Sergio Miranda ; Oliveira, Jorge Henrique Caldeira de ; Jabbour, Charbel José Chiappetta; Jabbour, Ana Beatriz Lopes de Sousa
Fonte: Annals of Operations Research. Unidade: FEARP
Assuntos: RESPONSABILIDADE SOCIAL, GESTÃO DE PROJETOS, STAKEHOLDER
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMARGO, José Alberto de et al. Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects. Annals of Operations Research, v. fe, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10479-017-2426-2. Acesso em: 27 nov. 2025.
APA
Camargo, J. A. de, Mendonça, P. S. M., Oliveira, J. H. C. de, Jabbour, C. J. C., & Jabbour, A. B. L. de S. (2017). Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects. Annals of Operations Research, fe. doi:10.1007/s10479-017-2426-2
NLM
Camargo JA de, Mendonça PSM, Oliveira JHC de, Jabbour CJC, Jabbour ABL de S. Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects [Internet]. Annals of Operations Research. 2017 ;fe[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-017-2426-2
Vancouver
Camargo JA de, Mendonça PSM, Oliveira JHC de, Jabbour CJC, Jabbour ABL de S. Giving voice to the silent: a framework for understanding stakeholders’ participation in socially-oriented initiatives, community-based actions and humanitarian operations projects [Internet]. Annals of Operations Research. 2017 ;fe[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-017-2426-2
Artigo de periodico
Sustainable vegetable crop supply problem with perishable stocks (2014)
Costa, Alysson Machado; Santos, Lana Mara Rodrigues dos; Alem, Douglas José; Santos, Ricardo Henrique Silva
Fonte: Annals of Operations Research. Unidade: ICMC
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Alysson Machado et al. Sustainable vegetable crop supply problem with perishable stocks. Annals of Operations Research, v. 219, n. 1, p. 265-283, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10479-010-0830-y. Acesso em: 27 nov. 2025.
APA
Costa, A. M., Santos, L. M. R. dos, Alem, D. J., & Santos, R. H. S. (2014). Sustainable vegetable crop supply problem with perishable stocks. Annals of Operations Research, 219( 1), 265-283. doi:10.1007/s10479-010-0830-y
NLM
Costa AM, Santos LMR dos, Alem DJ, Santos RHS. Sustainable vegetable crop supply problem with perishable stocks [Internet]. Annals of Operations Research. 2014 ; 219( 1): 265-283.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-010-0830-y
Vancouver
Costa AM, Santos LMR dos, Alem DJ, Santos RHS. Sustainable vegetable crop supply problem with perishable stocks [Internet]. Annals of Operations Research. 2014 ; 219( 1): 265-283.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-010-0830-y
Artigo de periodico
A heuristic algorithm based on multi-assignment procedures for nurse scheduling (2014)
Constantino, Ademir Aparecido; Landa-Silva, Dario; Melo, Everton Luiz de; Mendonça Neto, Candido Ferreira Xavier de; Rizzato, Douglas Baroni; Romão, Wesley
Fonte: Annals of Operations Research. Unidade: EACH
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CONSTANTINO, Ademir Aparecido et al. A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Annals of Operations Research, v. 218, n. 1, p. 165-183, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10479-013-1357-9. Acesso em: 27 nov. 2025.
APA
Constantino, A. A., Landa-Silva, D., Melo, E. L. de, Mendonça Neto, C. F. X. de, Rizzato, D. B., & Romão, W. (2014). A heuristic algorithm based on multi-assignment procedures for nurse scheduling. Annals of Operations Research, 218( 1), 165-183. doi:10.1007/s10479-013-1357-9
NLM
Constantino AA, Landa-Silva D, Melo EL de, Mendonça Neto CFX de, Rizzato DB, Romão W. A heuristic algorithm based on multi-assignment procedures for nurse scheduling [Internet]. Annals of Operations Research. 2014 ; 218( 1): 165-183.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-013-1357-9
Vancouver
Constantino AA, Landa-Silva D, Melo EL de, Mendonça Neto CFX de, Rizzato DB, Romão W. A heuristic algorithm based on multi-assignment procedures for nurse scheduling [Internet]. Annals of Operations Research. 2014 ; 218( 1): 165-183.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-013-1357-9
Artigo de periodico
Crop rotation scheduling with adjacency constraints (2011)
Santos, Lana Mara Rodrigues dos; Michelon, Philippe; Arenales, Marcos Nereu ; Santos, Ricardo Henrique Silva
Fonte: Annals of Operations Research. Unidade: ICMC
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Lana Mara Rodrigues dos et al. Crop rotation scheduling with adjacency constraints. Annals of Operations Research, v. 190, n. 1, p. 165-180, 2011Tradução . . Disponível em: https://doi.org/10.1007/s10479-008-0478-z. Acesso em: 27 nov. 2025.
APA
Santos, L. M. R. dos, Michelon, P., Arenales, M. N., & Santos, R. H. S. (2011). Crop rotation scheduling with adjacency constraints. Annals of Operations Research, 190( 1), 165-180. doi:10.1007/s10479-008-0478-z
NLM
Santos LMR dos, Michelon P, Arenales MN, Santos RHS. Crop rotation scheduling with adjacency constraints [Internet]. Annals of Operations Research. 2011 ; 190( 1): 165-180.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-008-0478-z
Vancouver
Santos LMR dos, Michelon P, Arenales MN, Santos RHS. Crop rotation scheduling with adjacency constraints [Internet]. Annals of Operations Research. 2011 ; 190( 1): 165-180.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-008-0478-z
Artigo de periodico
On the cutting stock problem under stochastic demand (2010)
Alem Junior, Douglas José; Munari Junior, Pedro Augusto; Arenales, Marcos Nereu ; Ferreira, Paulo Augusto Valente
Fonte: Annals of Operations Research. Unidade: ICMC
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALEM JUNIOR, Douglas José et al. On the cutting stock problem under stochastic demand. Annals of Operations Research, v. 179, n. 1, p. 169-186, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10479-008-0454-7. Acesso em: 27 nov. 2025.
APA
Alem Junior, D. J., Munari Junior, P. A., Arenales, M. N., & Ferreira, P. A. V. (2010). On the cutting stock problem under stochastic demand. Annals of Operations Research, 179( 1), 169-186. doi:10.1007/s10479-008-0454-7
NLM
Alem Junior DJ, Munari Junior PA, Arenales MN, Ferreira PAV. On the cutting stock problem under stochastic demand [Internet]. Annals of Operations Research. 2010 ; 179( 1): 169-186.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-008-0454-7
Vancouver
Alem Junior DJ, Munari Junior PA, Arenales MN, Ferreira PAV. On the cutting stock problem under stochastic demand [Internet]. Annals of Operations Research. 2010 ; 179( 1): 169-186.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-008-0454-7
Artigo de periodico
A coupling cutting stock-lot sizing problems in the paper industry (2008)
Poltronieri, Sônia Cristina; Poldi, Kelly Cristina; Toledo, Franklina Maria Bragion de ; Arenales, Marcos Nereu
Fonte: Annals of Operations Research. Unidade: ICMC
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
POLTRONIERI, Sônia Cristina et al. A coupling cutting stock-lot sizing problems in the paper industry. Annals of Operations Research, v. 157, n. 1, p. 91-104, 2008Tradução . . Disponível em: https://doi.org/10.1007/s10479-007-0200-6. Acesso em: 27 nov. 2025.
APA
Poltronieri, S. C., Poldi, K. C., Toledo, F. M. B. de, & Arenales, M. N. (2008). A coupling cutting stock-lot sizing problems in the paper industry. Annals of Operations Research, 157( 1), 91-104. doi:10.1007/s10479-007-0200-6
NLM
Poltronieri SC, Poldi KC, Toledo FMB de, Arenales MN. A coupling cutting stock-lot sizing problems in the paper industry [Internet]. Annals of Operations Research. 2008 ; 157( 1): 91-104.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-007-0200-6
Vancouver
Poltronieri SC, Poldi KC, Toledo FMB de, Arenales MN. A coupling cutting stock-lot sizing problems in the paper industry [Internet]. Annals of Operations Research. 2008 ; 157( 1): 91-104.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-007-0200-6
Artigo de periodico
A branch-and-bound algorithm to minimize the makespan in flowshop with blocking (2005)
Ronconi, Débora Pretti
Fonte: Annals of Operations Research. Unidade: EP
Assuntos: SEQUENCIAÇÃO DA PRODUÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RONCONI, Débora Pretti. A branch-and-bound algorithm to minimize the makespan in flowshop with blocking. Annals of Operations Research, n. 138, p. 53-65, 2005Tradução . . Disponível em: https://doi.org/10.1007/s10479-005-2444-3. Acesso em: 27 nov. 2025.
APA
Ronconi, D. P. (2005). A branch-and-bound algorithm to minimize the makespan in flowshop with blocking. Annals of Operations Research, (138), 53-65. doi:10.1007/s10479-005-2444-3
NLM
Ronconi DP. A branch-and-bound algorithm to minimize the makespan in flowshop with blocking [Internet]. Annals of Operations Research. 2005 ;(138): 53-65.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-005-2444-3
Vancouver
Ronconi DP. A branch-and-bound algorithm to minimize the makespan in flowshop with blocking [Internet]. Annals of Operations Research. 2005 ;(138): 53-65.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10479-005-2444-3

Unidades USP

ReP

Filtros

Autores

Autores USP

Ano de publicação

Assuntos

Indexado em

Afiliação dos autores externos não normalizada