Total Completion Time Minimization for Scheduling with Incompatibility Cliques

Klaus Jansen, Alexandra Lassota, Marten Maack +1

This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph and no two jobs connected by an edge are allowed to be assigned to the s…