Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling.
Maria AyalaChristian ArtiguesBernat GaciasPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- resource constrained
- lagrangian relaxation
- lower bound
- resource constraints
- job shop
- branch and bound algorithm
- lower and upper bounds
- upper bound
- np hard
- setup times
- sensor networks
- dual decomposition
- integer programming
- scheduling problem
- branch and bound
- wireless sensor networks
- dynamic programming
- mixed integer programming
- precedence constraints
- feasible solution
- single machine scheduling problem
- optimal solution
- column generation
- temporal constraints
- objective function
- release dates
- valid inequalities
- sequence dependent setup times
- linear programming
- rfid tags
- routing problem
- embedded systems
- single machine
- power consumption
- lagrangian dual