We study the makespan minimization of MapReduce scheduling on servers with different speeds.

Both online and offline versions of this problem are considered.

On offline version, we present non-preemptive and preemptive approximation algorithms.

On online version, we design non-preemptive and preemptive heuristics.

We verify the advantage of our offline and online algorithms comparing with the state-of-the-art.