I will present a simple online algorithm for minimizing flow time on multiple unrelated machines when we are allowed speed augmentation (the online algorithm has machines which are an epsilon fraction faster than that of the offline algorithm). No competitive algorithm for unrelated machines when speed augmentation is not permitted.