A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations.
Bert De ReyckWilly HerroelenPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- precedence relations
- resource constrained project scheduling problem
- branch and bound procedure
- branch and bound
- precedence constraints
- branch and bound algorithm
- resource constraints
- ant colony algorithm
- processing times
- lower bound
- upper bound
- search algorithm
- neural network
- multi objective
- artificial bee colony
- search space
- genetic algorithm ga
- harmony search