This paper present an instance transformation procedure to modify known instances of the resource-constrained project scheduling problem to make them easier to solve by heuristic and/or exact solution algorithms. The procedure makes use of a set of transformation rules that aim at reducing the feasible search space without excluding at least one possible optimal solution. The procedure will be applied to a set of 11,183 instances and it will be shown by a set of experiments that these transformations lead to 110 improved lower bounds, 16 new and better schedules (found by three meta-heuristic procedures and a set of branch-and-bound procedures) and even 64 new optimal solutions which were never not found before.

中文翻译：

---

减少资源受限项目实例的可行解空间

本文提出了一种实例转换过程，用于修改资源受限项目调度问题的已知实例，使它们更容易通过启发式和/或精确求解算法来解决。该过程利用一组变换规则，旨在减少可行的搜索空间而不排除至少一个可能的最佳解决方案。该程序将应用于一组 11,183 个实例，并且通过一组实验表明这些转换导致 110 个改进的下限、16 个新的和更好的调度（通过三个元启发式程序和一组分支发现）和绑定过程），甚至还有 64 个以前从未发现过的新最优解。