A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption.

Tomás Ebenlendr Jirí Sgall

Published in: WAOA (2011)

Keyphrases

online algorithms
lower bound
parallel machines
competitive ratio
online learning
worst case
upper bound
learning algorithm
scheduling problem
branch and bound algorithm
batch processing
np hard
optimal solution
special case
data sets
data structure
single machine
flowshop
vc dimension
objective function