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 problem we show that a schedule with length at most (1 + ) OPT can be calculated in polynomial time, which is the best possible result (in the sense of approximation ratio), since the problem is strongly NP-hard. For the case when all jobs must be allotted to a subset of machines with

• Type: Journal
• Year: 2010
• Where: SIAMCOMP
• Authors: Klaus Jansen, Ralf Thöle
• Keywords: Approximation Ratio, Non-preemptive Parallel Job, SIAMCOMP 2010, Strongly Np-hard