Lower bounds on online deadline scheduling with preemption penalties.
Stanley P. Y. FungPublished in: Inf. Process. Lett. (2008)
Keyphrases
- lower bound
- scheduling algorithm
- online algorithms
- parallel machines
- online learning
- resource constraints
- upper bound
- batch processing
- np hard
- scheduling problem
- objective function
- response time
- branch and bound algorithm
- timing constraints
- round robin
- resource utilization
- branch and bound
- upper and lower bounds
- online communities
- combinatorial optimization
- real time database systems
- learning algorithm
- real time