SODA Conference 2014 Conference Paper
- Lin Chen 0009
- Klaus Jansen
- Guochuan Zhang
We consider the classical scheduling problem on parallel identical machines to minimize the makespan. There is a long history of studies on this problem, focusing on exact and approximation algorithms, and it is thus natural to consider whether these algorithms are best possible in terms of the running time. Under the Exponential Time Hypothesis (ETH), we achieve the following results in this paper: The scheduling problem on a constant number m of identical machines, which is denoted as Pm ‖ C max, is known to admit a fully polynomial time approximation scheme (FPTAS) of running time O ( n ) + (1/∊) O ( m ) (indeed, the algorithm works for an even more general problem where machines are unrelated). We prove this algorithm is essentially the best possible in the sense that a (1/∊) O ( m 1–5 ) + n O (1) time FPTAS for any δ > 0 implies that ETH fails. The scheduling problem on an arbitrary number of identical machines, which is denoted as P ‖ C max, is known to admit a polynomial time approximation scheme (PTAS) of running time 2 O (1/∊ 2 log 3 (1/∊)) + n O (1). We prove this algorithm is nearly optimal in the sense that a 2 O ((1/∊) 1–5 ) + n O (1) time PTAS for any δ > 0 implies that ETH fails, leaving a small room for improvement. In addition, we also consider exact algorithms for the scheduling problem and prove the following result: The traditional dynamic programming algorithm for P ‖ C max is known to run in 2 O ( n ) time. We prove this is essentially the best possible in the sense that even if we restrict that there are n jobs and the processing time of each job is bounded by O ( n ), an exact algorithm of running time 2 (n 1–5 ) for any δ > 0 implies that ETH fails. To obtain these results we will provide two new reductions from 3SAT, one for P ‖ C max and another for P ‖ C max. Indeed, the new reductions explore the structure of scheduling problems and can also lead to other interesting results. For example, using the framework of our reduction for P ‖ C max, Chen et al. [5] are able to prove the APX-hardness of the scheduling problem in which the matrix of job processing times P = ( p ij ) m × n is of rank 3, solving the open problem mentioned in [2].