Publicação

Comparative analysis on approximation algorithms for the resource constrained project scheduling problem

Ver documento

Detalhes bibliográficos
Resumo:In Resource Constrained Project Scheduling Problem (RCPSP) exact algorithms can only solve small instances, and several approximation algorithms have been proposed that can solve large instances with a quasi-optimal solution. So far there is no comparative analysis of several algorithms running on the same machine, with equal time limit and large instances; this is our main goal. A new performance indicator is proposed that is not affected by the presence of simple problems in the instance set. The instance set was built by assembling the main sets in the literature and also JobShop and FlowShop instances transformed to RCPSP. In this work 30 meta-heuristics were implemented, obtaining a total of 159.364.665 solutions evaluated of RCPSP.
Autores principais:Coelho, José
Outros Autores:Valadares, Luis Tavares
Assunto:RCPSP Comparative analysis Performance indicator
Ano:2002
País:Portugal
Tipo de documento:documento de conferência
Tipo de acesso:acesso aberto
Instituição associada:Universidade Aberta
Idioma:inglês
Origem:Repositório Aberto da Universidade Aberta
Descrição
Resumo:In Resource Constrained Project Scheduling Problem (RCPSP) exact algorithms can only solve small instances, and several approximation algorithms have been proposed that can solve large instances with a quasi-optimal solution. So far there is no comparative analysis of several algorithms running on the same machine, with equal time limit and large instances; this is our main goal. A new performance indicator is proposed that is not affected by the presence of simple problems in the instance set. The instance set was built by assembling the main sets in the literature and also JobShop and FlowShop instances transformed to RCPSP. In this work 30 meta-heuristics were implemented, obtaining a total of 159.364.665 solutions evaluated of RCPSP.