“We study the problem of scheduling precedence-constrained jobs on heterogenous machines in the presence of non-uniform job and machine communication delays. We are given a set of n unit size precedence-ordered jobs, and a set of m related machines each with size m_i (machine i can execute at most m_i jobs at any time). … The objective is to construct a schedule that minimizes makespan, … the maximum completion time over all jobs. We consider schedules which allow duplication of jobs as well as schedules which do not.”

Find the paper and full list of authors at Dagstuhl Research Online Publication Server.