SciELO - Scientific Electronic Library Online

 
vol.27 número1Economic efficiency of Embrapa's research centers and the influence of contextual variablesUm modelo de análise envoltória de dados para o estabelecimento de metas de continuidade do fornecimento de energia elétrica índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

Compartilhar


Pesquisa Operacional

versão impressa ISSN 0101-7438versão On-line ISSN 1678-5142

Resumo

YAMASHITA, Denise Sato  e  MORABITO, Reinaldo. Um algoritmo exato para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos. Pesqui. Oper. [online]. 2007, vol.27, n.1, pp.27-49. ISSN 0101-7438.  http://dx.doi.org/10.1590/S0101-74382007000100003.

In this paper we propose an exact algorithm to generate tradeoff curves between cost and time of a project, based on the multi-mode resource availability cost problem. Two versions of the algorithm are proposed, the first is an adaptation of an exact algorithm proposed in the literature, where there is only a single mode to execute the activities, and the second incorporates strategies in order to improve the performance of the solution method, resulting in a significant decrease in the computational time. It is worth noting that the proposed algorithm is computationally viable to solve only problems of moderate size. Both versions of the algorithm were tested solving different instances generated by the software Progen. Tradeoff curves are presented and analyzed, illustrating how the method can be used in situations where the decision maker is confronted with the difficult task of balancing costs and deadlines of a project.

Palavras-chave : project scheduling; multiples modes; resource availability cost; exact algorithm; tradeoff between cost and deadline.

        · resumo em Português     · texto em Português     · Português ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons