diff --git a/README.md b/README.md
index fbf120db1c5034bfdbe03101799c2d5f83dfc04e..f88df71f3efcc1898cc925b56c7a532316127188 100644
--- a/README.md
+++ b/README.md
@@ -7,8 +7,8 @@ This repository contains a [Batsim](https://batsim.readthedocs.io/en/latest/)-co
 This algorithm is strongly based on EASY backfilling.
 The main addition over EASY is that a powercap must be followed during a time window.
 In other words, a constraint on the maximum power consumption value is set for the whole platform.
-This algorithm uses additional data on the power consumption of jobs to take its decisions. 
-We implemented two ways to sort the waiting queue: FCFS or Smallest Area First (SAF). For SAF, the area is calculated by multiplying the number of resources by the 
+This algorithm uses additional data on the power consumption of jobs to take its decisions.
+We implemented two ways to sort the waiting queue: FCFS or Smallest Area First (SAF). For SAF, the area is calculated by multiplying the number of requested resources by the requested time.
 
 Please read [the algorithm implementation](./easypower.cpp) for all details.
 
@@ -46,7 +46,7 @@ batsim -l <path/to/compiled/easypower.so> 0 <INPUT-PARAMETERS> \
        -w <path/to/workload.json> \
        -e <path/to/output/directory/>
 ```
-or 
+or
 ```
 batsim -l <path/to/compiled/knapsack_greedy.so> 0 <INPUT-PARAMETERS> \
        -p <path/to/platform.xml> \