Login / Signup

Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion.

Olivier PlotonVincent T'kindt
Published in: J. Sched. (2023)
Keyphrases
  • complexity bounds
  • worst case
  • upper bound
  • lower bound
  • query containment
  • np hard
  • computational complexity
  • constraint networks
  • relational databases
  • temporal information
  • conjunctive queries