Malleable scheduling beyond identical machines.

Dimitris Fotakis Jannik Matuschke Orestis Papadigenopoulos

Published in: J. Sched. (2023)

Keyphrases

identical machines
processing times
scheduling problem
job scheduling
single machine
scheduling jobs
precedence constraints
polynomial time approximation
setup times
release dates
optimization problems
theoretical analysis
message passing