A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem.
Morteza DavariErik DemeulemeesterPublished in: Int. J. Prod. Res. (2019)
Keyphrases
- branch and bound algorithm
- resource constrained project scheduling problem
- chance constrained
- stochastic programming
- lower bound
- robust optimization
- knapsack problem
- branch and bound
- optimal solution
- np hard
- resource constraints
- computationally tractable
- upper bound
- test problems
- linear program
- combinatorial optimization
- precedence constraints
- multistage
- single machine scheduling problem
- lagrangian relaxation
- search algorithm
- mathematical programming
- linear programming
- search space
- column generation
- multiple objectives
- integer programming