Login / Signup

On the parameterized tractability of the just-in-time flow-shop scheduling problem.

Danny HermelinDvir ShabtayNimrod Talmon
Published in: J. Sched. (2019)
Keyphrases
  • np complete
  • constraint satisfaction
  • multiscale
  • computational complexity
  • multiresolution
  • database
  • databases
  • data mining
  • machine learning
  • evolutionary algorithm
  • distributed systems
  • tractable cases