A lower bound for scheduling mechanisms.
George ChristodoulouElias KoutsoupiasAngelina VidaliPublished in: SODA (2007)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- scheduling problem
- precedence constraints
- objective function
- lower bounding
- scheduling algorithm
- branch and bound
- np hard
- optimal solution
- lower and upper bounds
- flexible manufacturing systems
- round robin
- resource allocation
- worst case
- upper and lower bounds
- dynamic scheduling
- resource constraints
- real time database systems
- neural network
- online algorithms
- lagrangian relaxation
- competitive ratio
- manufacturing systems
- polynomial approximation