# Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

Maiti Biswaroop
Stalfa David
Svitkina Zoya
Vijayaraghavan Aravindan

FOCS, pp. 834-845, 2020.

Cited by: 0|Bibtex|Views9|
EI

Abstract:

We consider the problem of scheduling $n$ precedence-constrained jobs on $m$ uniformly-related machines in the presence of an arbitrary, fixed communication delay $\rho$. We consider a model that allows job duplication, i.e. processing of the same job on multiple machines, which, as we show, can reduce the length of a schedule (i.e., it...More

Code:

Data:

Full Text