Optimal Lower Bounds for Anonymous Scheduling Mechanisms.
Itai AshlagiShahar DobzinskiRon LaviPublished in: Math. Oper. Res. (2012)
Keyphrases
- lower bound
- optimal solution
- worst case
- upper bound
- optimal cost
- scheduling problem
- optimal scheduling
- min sum
- capacity allocation
- dynamic programming
- closed form
- information systems
- parallel machines
- upper and lower bounds
- total cost
- constant factor
- round robin
- security mechanisms
- resource allocation
- objective function