On minimizing dataset transfer time in an acyclic network with four servers

Resumo

Under consideration is some optimization problem of data transmission in a hierarchical acyclic network. This problem is a special case of the makespan minimization problem with multiprocessor jobs on dedicated machines.We study computational complexity of the subproblems with a specific set of job types, where the type of a job is a subset of the machines required by the job.