@inproceedings{davies2022on,
author = {Davies, Sami and Kulkarni, Janardhan (Jana) and Rothvoss, Thomas and Sandeep, Sai and Tarnawski, Jakub and Zhang, Yihao},
title = {On the Hardness of Scheduling With Non-Uniform Communication Delays},
booktitle = {SODA 2022},
year = {2022},
month = {January},
abstract = {In the scheduling with non-uniform communication delay problem, the input is a set of jobs with precedence constraints. Associated with every precedence constraint between a pair of jobs is a communication delay, the time duration the scheduler has to wait between the two jobs if they are scheduled on different machines. The objective is to assign the jobs to machines to minimize the makespan of the schedule. Despite being a fundamental problem in theory and a consequential problem in practice, the approximability of scheduling problems with communication delays is not very well understood. One of the top ten open problems in scheduling theory, in the influential list by Schuurman and Woeginger and its latest update by Bansal, asks if the problem admits a constant factor approximation algorithm. In this paper, we answer the question in negative by proving that there is a logarithmic hardness for the problem under the standard complexity theory assumption that NP-complete problems do not admit quasi-polynomial time algorithms. Our hardness result is obtained using a surprisingly simple reduction from a problem that we call Unique Machine Precedence constraints Scheduling (UMPS). We believe that this problem is of central importance in understanding the hardness of many scheduling problems and conjecture that it is very hard to approximate. Among other things, our conjecture implies a logarithmic hardness of related machine scheduling with precedences, a long-standing open problem in scheduling theory and approximation algorithms.},
url = {http://approjects.co.za/?big=en-us/research/publication/on-the-hardness-of-scheduling-with-non-uniform-communication-delays/},
}