We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time, the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró et al.  on coloring precolored bipartite graphs.
|Journal||Discrete Applied Mathematics|
|Publication status||Published - 1994|