• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

Properties of Lower Bounds for the RCPSP

P. 191-194.
Gafarov E., Lazarev A. A., Werner F.

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.