• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack.

René van BevernRolf NiedermeierOndrej Suchý
Published in: J. Sched. (2017)
Keyphrases
  • search algorithm
  • parallel machines
  • optimal solution
  • scheduling algorithm
  • parameterized complexity