Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm.
N. R. AchuthanA. HardjawidjajaPublished in: Ann. Oper. Res. (2001)
Keyphrases
- branch and bound algorithm
- project scheduling
- lower bound
- branch and bound
- optimal solution
- np hard
- upper bound
- test problems
- combinatorial optimization
- lower bounding
- upper bounding
- resource constrained project scheduling problem
- randomly generated problems
- resource constraints
- max sat
- precedence constraints
- mixed integer linear programming
- single machine scheduling problem
- finding an optimal solution
- lagrangian relaxation
- travel time
- search space
- neural network
- metaheuristic
- artificial neural networks
- search algorithm
- objective function