A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations.
Lucio BiancoMassimiliano CaramiaPublished in: Comput. Oper. Res. (2011)
Keyphrases
- precedence relations
- resource constrained project scheduling problem
- lower bound
- upper bound
- branch and bound algorithm
- resource constraints
- precedence constraints
- lagrangian relaxation
- processing times
- branch and bound
- ant colony algorithm
- optimal solution
- worst case
- np hard
- objective function
- neural network
- lower and upper bounds
- release dates
- harmony search
- single machine
- simulated annealing
- artificial bee colony