Makespan minimization on unrelated parallel machines with a few bags.

Daniel R. Page Roberto Solis-Oba

Published in: Theor. Comput. Sci. (2020)

Keyphrases

unrelated parallel machines
parallel machines
scheduling problem
flowshop
setup times
processing times
sequence dependent setup times
precedence constraints
single machine
job shop scheduling problem
release dates
shared memory
special case
parallel computing
single server
polynomially solvable
job shop scheduling