A Lower Bound for Scheduling Mechanisms.
George ChristodoulouElias KoutsoupiasAngelina VidaliPublished in: Algorithmica (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- scheduling problem
- objective function
- scheduling algorithm
- worst case
- np hard
- resource constraints
- upper and lower bounds
- parallel machines
- building blocks
- optimal solution
- database systems
- mechanism design
- lagrangian relaxation
- precedence constraints
- round robin
- flexible manufacturing systems
- polynomial approximation
- sufficiently accurate