Preemptive scheduling for approximate computing on heterogeneous machines: Tradeoff between weighted accuracy and makespan.

•For a given makespan, an algorithm is provided to minimize the weighted accuracy of computations.•The proposed algorithm is shown to be optimal.•The paper considers scheduling jobs on multiple servers.•The paper provides an optimal tradeoff between the two objectives of makespan and weighted accuracy.