论文部分内容阅读
We consider an extension of classic parallel machine scheduling,where an undirected conflict graph is part of the input.Each node in the graph represents a job and an edge implies that its two jobs cannot be scheduled on the same machine.