Login / Signup

On the parameterized complexity of interval scheduling with eligible machine sets.

Danny HermelinYuval ItzhakiHendrik MolterDvir Shabtay
Published in: J. Comput. Syst. Sci. (2024)
Keyphrases
  • parameterized complexity
  • scheduling problem
  • global constraints
  • job shop scheduling
  • fixed parameter tractable