Online Makespan Minimization with Parallel Schedules.

Susanne Albers Matthias Hellwig

Published in: SWAT (2014)

Keyphrases

makespan minimization
scheduling problem
parallel machines
flowshop
job shop scheduling problem
single machine
processing times
metaheuristic
setup times
total weighted tardiness
polynomially solvable
polynomial time approximation
special case
tabu search
precedence constraints
job shop scheduling
release dates