Before revision:  This problem has been considered previously in the field of parallel computing and scheduling theory for the general case where multiprocessor platforms have K distinct speeds. Our model is a bridge between the assumptions in these fields and recent advances in multicore processors technology .
After revision:  This problem has been considered previously in the field of parallel computing and scheduling theory for the general case was studied where processors have K essentially different speeds. We present the non-preemptive algorithm ``Remnants'' that achieves almost optimal makespan .