Online-Scheduling on Identical Machines with Bounded Migration.

Thorsten Ehlers Klaus Jansen

Published in: SYNASC (2013)

Keyphrases

identical machines
processing times
scheduling problem
single machine
job scheduling
precedence constraints
online learning
scheduling jobs
polynomial time approximation
np complete
steady state
single machine scheduling problem
release dates