Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms

摘要

In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine.