Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling.
Koji M. KobayashiKazuya OkamotoPublished in: ESA (2007)
Keyphrases
- upper bound
- lower bound
- competitive ratio
- online algorithms
- identical parallel machines
- real time
- worst case
- online learning
- scheduling problem
- single machine
- branch and bound algorithm
- lower and upper bounds
- learning algorithm
- np hard
- average case
- objective function
- processing times
- initially unknown
- branch and bound
- sample size
- resource allocation
- sample complexity
- optimal strategy
- state space
- asymptotically optimal
- precedence constraints
- completion times
- release dates
- optimal solution