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

Nodari Vakhania, Frank Werner, Kevin Johedan Ramírez-Fuentes +1

Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many heuristics…