Login / Signup
On the Complexity of Scheduling Problems With a Fixed Number of Identical Machines.
Klaus Jansen
Kai Kahler
Published in:
CoRR (2022)
Keyphrases
</>
fixed number
scheduling problem
identical machines
processing times
single machine
precedence constraints
identical parallel machines
job scheduling
flowshop
setup times
worst case
np hard
computational complexity
release dates
finite number
job shop scheduling problem
tabu search
single machine scheduling problem