A branch and bound algorithm for the resource-constrained project scheduling problem.
Peter BruckerSigrid KnustArno SchooOlaf ThielePublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- branch and bound algorithm
- resource constrained project scheduling problem
- precedence relations
- precedence constraints
- project scheduling
- lower bound
- branch and bound
- resource constraints
- upper bound
- optimal solution
- test problems
- np hard
- combinatorial optimization
- lagrangian relaxation
- single machine scheduling problem
- upper bounding
- artificial bee colony
- ant colony algorithm
- search algorithm
- feasible solution
- approximation algorithms
- genetic algorithm
- column generation
- release dates
- harmony search
- cost function
- computational complexity