A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective.
Xue LiZhengwen HeNengmin WangPublished in: Comput. Oper. Res. (2024)
Keyphrases
- branch and bound algorithm
- resource constrained project scheduling problem
- precedence relations
- precedence constraints
- lower bound
- branch and bound
- upper bound
- project scheduling
- np hard
- test problems
- combinatorial optimization
- resource constraints
- optimal solution
- single machine scheduling problem
- lagrangian relaxation
- upper bounding
- objective function
- harmony search
- fitness function
- cost function
- multi objective
- computational complexity