Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances.
Eduard Kh. GimadiEvgenii N. GoncharovAlexandr A. ShtepaPublished in: AIST (2020)
Keyphrases
- resource constrained project scheduling problem
- lower bound
- resource constrained scheduling
- lower and upper bounds
- upper bound
- project scheduling
- resource constraints
- precedence relations
- linear programming relaxation
- branch and bound algorithm
- branch and bound
- optimal solution
- genetic algorithm
- ant colony algorithm
- np hard
- objective function
- search procedure
- artificial bee colony