Vanhoucke, MarioCoelho, José2024-10-252024-10-252024-02-070305-0548http://hdl.handle.net/10400.2/16685This 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.engResource-constrained project schedulingInstance complexityProject networksResource constraintsjournal article10.1016/j.cor.2024.106567