Lower bounds on precedence-constrained scheduling for parallel processors.
Ivan D. BaevWaleed MeleisAlexandre E. EichenbergerPublished in: Inf. Process. Lett. (2002)
Keyphrases
- parallel processors
- lower bound
- precedence constraints
- branch and bound algorithm
- single processor
- upper bound
- branch and bound
- search problems
- objective function
- optimal solution
- np hard
- scheduling problem
- vc dimension
- lower and upper bounds
- constraint satisfaction
- lagrangian relaxation
- dynamic programming
- min cost
- contract algorithms