Malleable scheduling beyond identical machines.

Dimitris Fotakis Jannik Matuschke Orestis Papadigenopoulos

Published in: CoRR (2019)

Keyphrases

identical machines
processing times
single machine
scheduling problem
job scheduling
precedence constraints
polynomial time approximation
scheduling jobs
setup times
np hard
release dates
search algorithm
partially ordered