Randomized algorithms for on-line scheduling problems: how low can't you go?

Leen Stougie Arjen P. A. Vestjens

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

Keyphrases

randomized algorithms
scheduling problem
lower bound
approximation algorithms
flowshop
np hard
processing times
randomized algorithm
worst case
tabu search
single machine
practical problems
job shop scheduling problem
special case
linear programming
linear combination
learning algorithm