Nearly insensitive bounds on SMART scheduling.
Adam WiermanMor Harchol-BalterTakayuki OsogamiPublished in: SIGMETRICS (2005)
Keyphrases
- scheduling problem
- scheduling algorithm
- lower bound
- upper bound
- round robin
- resource allocation
- upper and lower bounds
- smart environments
- project scheduling
- dynamic scheduling
- minimize total
- resource utilization
- parallel machines
- lower and upper bounds
- resource constraints
- average case
- optimal solution
- case study
- production scheduling
- parallel processors
- artificial intelligence
- neural network
- tight bounds
- preventive maintenance
- real time