A carregar...
Publicação
On the summary measures for the resource-constrained project scheduling problem
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 1.89 MB | Adobe PDF |
Orientador(es)
Resumo(s)
The resource-constrained project scheduling problem is a widely studied problem in the literature. The goal is to construct a schedule for a set of activities, such that precedence and resource constraints are respected and that an objective function is optimized. In project scheduling literature, summary measures are often used as a tool to evaluate the performance of algorithms and to analyze instances and datasets. They can be classified in two groups, network measures describe the precedence constraints of a project, while resource measures
focus on the resource constraints of the instance. In this manuscript we make an exhaustive evaluation of the summary measures for project scheduling. We provide an overview of the most prevalent measures and also introduce some new ones. For our tests we combine different datasets from the literature and generate a new set with diverse characteristics.
We evaluate the performance of the summary measures on three dimensions: consistency, instance complexity and algorithm selection. We conclude by providing an overview of which measures are best suited for each of the three investigated dimensions.
Descrição
Palavras-chave
Project scheduling Summary measures Datasets Instance complexity
Contexto Educativo
Citação
Editora
Springer