ABSTRACT
This survey deals with problems at the intersection of two scientific fields: graph theory and scheduling. They can either be viewed as scheduling dependent jobs —jobs with resource conflicts—or as graph coloring optimization involving different objective functions.
