A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags.
Roland HeilmannPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- resource constrained project scheduling problem
- branch and bound procedure
- branch and bound
- project scheduling
- resource constraints
- precedence relations
- ant colony algorithm
- branch and bound algorithm
- genetic algorithm
- harmony search
- lower bound
- neural network
- search space
- differential evolution
- combinatorial optimization