Pseudo lower bounds for online parallel machine scheduling.

Zhiyi Tan Rongqi Li

Published in: Oper. Res. Lett. (2015)

Keyphrases

lower bound
online algorithms
upper bound
online learning
branch and bound algorithm
branch and bound
real time
data sets
online communities
np hard
worst case
max sat
lower and upper bounds
sample complexity
case study
special case
active learning
genetic algorithm
data structure
objective function