An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem.
Dmitry I. ArkhipovOlga BattaïaAlexander A. LazarevPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- lower bound
- np hard
- optimal solution
- objective function
- learning algorithm
- worst case
- computational complexity
- dynamic programming
- optimization algorithm
- cost function
- simulated annealing
- search space
- combinatorial optimization
- lower and upper bounds
- resource constrained project scheduling problem
- neural network
- upper bound
- particle swarm optimization
- min max