We show that the calculation of the well-known lower bound of Mingozzi for the RCPSP is an NP-hard problem and that the relative error of this lower bound can be equal to O(log n), where n is the number of jobs.