On the Value of Job Migration in Online Makespan Minimization.

Susanne Albers Matthias Hellwig

Published in: Algorithmica (2017)

Keyphrases

makespan minimization
processing times
flowshop
scheduling problem
parallel machines
release dates
single machine
setup times
total weighted tardiness
sequence dependent setup times
special case
evolutionary computation
branch and bound algorithm
polynomially solvable