http://web.nchu.edu.tw/pweb/users/arborfish/lesson/8682.pdf

A survey of variants and extensions of the resource-constrained project scheduling problem

https://www.econstor.eu/bitstream/10419/155418/1/manuskript_344.pdf

Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

The paper describes an algorithm for the generation of a general class of precedence- and resource-constrained scheduling problems. Easy and hard instances for the single- and multi-mode resource-constrained project scheduling problem are benchmarked by using the state of the art (branch-and-bound-) procedures. The strong impact of the chosen parametric characterization of the problems is shown via an in-depth computational study. The results provided, demonstrate that the classical benchmark instances used by several researchers over decades belong to the subset of the very easy ones. In addition it is shown that hard instances, being far more smaller in size than presumed in the literature, may not be solved to optimality even within a huge amount of computational time.

https://www.econstor.eu/bitstream/10419/155395/1/manuskript_301.pdf

Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances

This paper addresses the issue of how to generate problem instances of controlled difficulty. It focuses on precedence- and resource-constrained (project) scheduling problems, but similar ideas may be applied to other network optimization problems. It describes a network construction procedure that takes into account a) constraints on the network topology, b) a resource factor that reflects the density of the coefficient matrix, and c) a resource strength, which measures the availability of resources. The strong impact of the chosen parametric characterization of the problems is shown via an in depth computational study. Instances for the single- and multi-mode resource-constrained project scheduling problem are benchmarked by using the state of the art (branch and bound) procedures. The results provided, demonstrate that the classical benchmark instances used by several researchers over decades belong to the subset of the very easy ones. In addition, it is shown that hard instances, being far more smalle...

Characterization and generation of a general class of resource-constrained project scheduling problems

http://www.optimization-online.org/DB_FILE/2004/10/989.pdf

A genetic algorithm for the resource constrained multi-project scheduling problem

Application of heuristic solution procedures to the practical problem of project scheduling has previously been studied by numerous researchers. However, there is little consensus about their findings, and the practicing manager is currently at a loss as to which scheduling rule to use. Furthermore, since no categorization process was developed, it is assumed that once a rule is selected it must be used throughout the whole project. This research breaks away from this tradition by providing a categorization process based on two powerful project summary measures. The first measure identifies the location of the peak of total resource requirements and the second measure identifies the rate of utilization of each resource type. The performance of the rules are classified according to values of these two measures, and it is shown that a rule introduced by this research performs significantly better on most categories of projects.

I. Kurtulus

Papers

Multi-Project Scheduling: Categorization of Heuristic Rules Performance