Login / Signup

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability.

Nodari VakhaniaFrank WernerKevin Johedan Ramírez-FuentesVíctor Pacheco-Valencia
Published in: CoRR (2024)
Keyphrases
  • computationally efficient
  • computational efficiency
  • computational complexity
  • worst case
  • single machine scheduling problem
  • np hard
  • approximation algorithms
  • space complexity