Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling

Abstract

In the problem of Parallel Task Scheduling (PTS), we are asked to schedule $n$ jobs, each with a fixed processing time and machine requirement, such that the completion time of the last job is minimized. Jansen and Rau (2019) presented an algorithm for PTS that achieves an approximation ratio of $(3/2)\text{OPT} + p_{\max}$. They additionally posed the open question whether an approximation ratio of $(4/3)\text{OPT} + p_{\max}$ is possible. In this work, we present such an algorithm with a running time of $O(n\log n)$. The problem of Multiple Cluster Scheduling (MCS) is a natural extension of PTS where we are given $N$ clusters each of $m$ machines to schedule jobs. Jansen and Rau (2019) adapted their PTS algorithm to MCS with the following results: (1) a 2 approximation, and (2) a near-linear 9/4 approximation if $N$ is divisible by 3. We improve the running time of their 2-approximation and generalize the 9/4 approximation to the general case. The 2-approximation for MCS is tight, since one cannot hope for an approximation ratio better than 2, unless P=NP [Zhuk, 2006]. In addition to our theoretical results, we implement our algorithm and show its practical applicability.