We present a new approach for scheduling workloads containing periodic tasks in soft real-time systems. The proposed algorithm consists on finding a new set of priorities depending of the three main criteria identified in a real-time system: fixed priority initially assumed by user, deadline and energy efficiency. Our proposition involves a computational procedure that is responsible of extracting the new values of priorities out of the importance of the three factors previously mentioned. An eventual re-adjustment of the deadlines is also faced all along with the reloading of the system’s power on specified instants. The resulting system is, therefore, feasible and effectively schedulable compared to the mono-criteria algorithms. This contribution allows also the definition of precise instants of reloading which enforces the new concept of extending the lifetime of the system.