Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound.
Lucio BiancoMassimiliano CaramiaPublished in: 4OR (2011)
Keyphrases
- precedence relations
- resource constraints
- lagrangian relaxation
- lower bound
- resource constrained project scheduling problem
- branch and bound algorithm
- lower and upper bounds
- resource constrained
- upper bound
- precedence constraints
- np hard
- branch and bound
- total weighted tardiness
- feasible solution
- mixed integer programming
- integer programming
- column generation
- objective function
- routing problem
- temporal constraints
- single machine scheduling problem
- valid inequalities
- dynamic programming
- setup times
- optimal solution
- linear programming relaxation
- processing times
- linear programming
- neural network
- linear program
- worst case
- multi objective