Restrictions of Graph Partition Problems
Let J be a set of n jobs, all with job processing time or job length one, and let M be a set of k machines. Incompatibilities between jobs are described by an undirected graph G = (J, E) with vertex set J. If G contains an edge between two jobs j and j′ (j ≠ j′), we demand that these two jobs can not be executed by the same machine. An assignment of the jobs to the machines, which satisfies the incompatibility relation, is called a schedule. The processing time of a machine is given by the number of assigned jobs, since each job has processing time one.
Unable to display preview. Download preview PDF.
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.Google Scholar
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London, 1980.Google Scholar
- R.M. Karp, Reducibility among combinatorial problems, in: Miller and Thatcher: Complexity of Computer Computations, Plenum Press (1972), pp. 85–104.Google Scholar
- Z. Lonc, On complexity of some chain and antichain partition problems, WG Conference, LNCS 570 (1991), pp. 97–104.Google Scholar