Improved Bounds for the Online Scheduling Problem.

John F. Rudin III R. Chandrasekaran

Published in: SIAM J. Comput. (2003)

Keyphrases

scheduling problem
single machine
lower bound
real time
upper bound
tabu search
flowshop
online learning
np hard
setup times
processing times
total tardiness
permutation flowshop
online environment
improved algorithm
worst case
parallel machines
vc dimension
precedence constraints
multi class
data sets