A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource.
Cansu AltintasMeral AzizogluPublished in: Int. J. Inf. Technol. Proj. Manag. (2020)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- test problems
- precedence constraints
- upper bound
- np hard
- optimal solution
- search tree
- randomly generated problems
- lower bounding
- combinatorial optimization
- mixed integer linear programming
- max sat
- variable ordering
- maximum clique
- upper bounding
- single machine scheduling problem
- lagrangian relaxation
- resource constrained project scheduling problem
- scheduling problem
- dynamic programming
- branch and bound method
- objective function
- neural network