Bounding the power of preemption in randomized scheduling.
Ran CanettiSandy IraniPublished in: STOC (1995)
Keyphrases
- parallel machines
- batch processing
- scheduling problem
- resource utilization
- upper bound
- resource allocation
- scheduling algorithm
- minimize total
- flexible manufacturing systems
- resource constraints
- power consumption
- website
- computational power
- artificial intelligence
- scheduling strategy
- dynamic scheduling
- database
- completion times
- neural network