Login / Signup
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.
René van Bevern
Rolf Niedermeier
Ondrej Suchý
Published in:
J. Sched. (2017)
Keyphrases
</>
search algorithm
parallel machines
optimal solution
scheduling algorithm
parameterized complexity