A branch-and-bound algorithm for the resource-constrained project scheduling problem.
Ulrich DorndorfErwin PeschToàn Phan HuyPublished in: Math. Methods Oper. Res. (2000)
Keyphrases
- branch and bound algorithm
- resource constrained project scheduling problem
- precedence relations
- lower bound
- project scheduling
- precedence constraints
- branch and bound
- resource constraints
- upper bound
- combinatorial optimization
- np hard
- test problems
- optimal solution
- single machine scheduling problem
- lagrangian relaxation
- harmony search
- upper bounding
- ant colony algorithm
- artificial bee colony
- metaheuristic
- search space
- search algorithm
- feasible solution
- genetic algorithm
- neural network