A Lower Bound for Randomized On-Line Scheduling Algorithms.
Bo ChenAndré van VlietGerhard J. WoegingerPublished in: Inf. Process. Lett. (1994)
Keyphrases
- scheduling algorithm
- lower bound
- upper bound
- response time
- randomized algorithm
- branch and bound
- branch and bound algorithm
- scheduling strategy
- np hard
- optimal solution
- lower and upper bounds
- worst case
- objective function
- qos requirements
- scheduling policies
- resource consumption
- setup times
- special case
- grid environment
- real time database systems
- sufficiently accurate