Description:
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.