Before revision:  We investigate resource allocation problems where the scheduling duration (i.e., time ) is optimized through Lyapunov optimization techniques by taking into account the padding overhead, airtime fairness and energy consumption of the users.
After revision:  We investigate resource allocation problems where the scheduling duration is fixed and does not change from time to time. In the second algorithm the scheduling duration is dynamically determined in a resource allocation framework by taking into account the padding overhead, airtime fairness and energy consumption of the users.