Sciweavers

SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 7 months ago
Approximation Algorithms for Scheduling Parallel Jobs
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Klaus Jansen, Ralf Thöle