Resource load-based makespan estimation algorithm for resource-constrained project scheduling problem

International audience; The resource constrained project scheduling problem (RCPSP) is a well-known combinatorialoptimisation problem. It was shown by reduction from the 3-partition problem that the decisionvariant of the RCPSP isNP-complete in the strong sense even without precedence constraintsand only one resource [1]. A library of instances PSPLIB was created to compare solutionalgorithms and lower bounds, the most known approaches were presented in parts [2], [3] and [4].