In heterogeneous computing systems it is crucial to sched- ule tasks in a manner that exploits the heterogeneity of the resources and applications to optimize systems perfor- mance. Moreover, the energy efficiency in these systems is of a great interest due to different concerns such as opera- tional costs and environmental issues associated to carbon emissions. In this paper, we present a series of original low complexity energy efficient algorithms for scheduling. The main idea is to map a task to the machine that executes it fastest while the energy consumption is minimum. On the practical side, the set of experimental results showed that the proposed heuristics perform as efficiently as related ap- proaches, demonstrating their applicability for the consid- ered problem and its good scalability.