Abstract
We consider scheduling problems in a multiprocessor system with incompatibfle jobs of unit-time length where two incompatible jobs can not be processed on the same machine. Given a deadline k′ and a number of k machines, the problem is to find a feasible assignment of the jobs to the machines. We prove the computational complexity of this scheduling problem restricted to different graph classes, arbitary and constant numbers k and k′.
Cite
CITATION STYLE
Bodlaender, H. L., & Jansen, K. (1993). On the complexity of scheduling incompatible jobs with unit-times. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 711 LNCS, pp. 291–300). Springer Verlag. https://doi.org/10.1007/3-540-57182-5_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
