Malleable Scheduling Beyond Identical Machines.

Dimitris Fotakis Jannik Matuschke Orestis Papadigenopoulos

Published in: APPROX-RANDOM (2019)

Keyphrases

identical machines
processing times
scheduling problem
single machine
job scheduling
polynomial time approximation
precedence constraints
scheduling jobs
setup times
dynamic programming
simulated annealing
flowshop
release dates